Structured Matrices and Polynomials

Unified Superfast Algorithms

1 edition

My Reading Lists:

Create a new list




Download Options

Buy this book

Last edited by MARC Bot
November 14, 2023 | History

Structured Matrices and Polynomials

Unified Superfast Algorithms

1 edition

Structured matrices serve as a natural bridge between the areas of algebraic computations with polynomials and numerical matrix computations, allowing cross-fertilization of both fields. This book covers most fundamental numerical and algebraic computations with Toeplitz, Hankel, Vandermonde, Cauchy, and other popular structured matrices. Throughout the computations, the matrices are represented by their compressed images, called displacements, enabling both a unified treatment of various matrix structures and dramatic saving of computer time and memory. The resulting superfast algorithms allow further dramatic parallel acceleration using FFT and fast sine and cosine transforms. Included are specific applications to other fields, in particular, superfast solutions to: various fundamental problems of computer algebra; the tangential Nevanlinna--Pick and matrix Nehari problems The primary intended readership for this work includes researchers, algorithm designers, and advanced graduate students in the fields of computations with structured matrices, computer algebra, and numerical rational interpolation. The book goes beyond research frontiers and, apart from very recent research articles, includes yet unpublished results. To serve a wider audience, the presentation unfolds systematically and is written in a user-friendly engaging style. Only some preliminary knowledge of the fundamentals of linear algebra is required. This makes the material accessible to graduate students and new researchers who wish to study the rapidly exploding area of computations with structured matrices and polynomials. Examples, tables, figures, exercises, extensive bibliography, and index lend this text to classroom use or self-study.

Publish Date
Publisher
Birkhäuser Boston
Language
English
Pages
304

Buy this book

Previews available in: English

Edition Availability
Cover of: Structured Matrices and Polynomials
Structured Matrices and Polynomials: Unified Superfast Algorithms
Oct 23, 2012, Birkhäuser
paperback
Cover of: Structured Matrices and Polynomials
Structured Matrices and Polynomials: Unified Superfast Algorithms
2012, Birkhauser Verlag
in English
Cover of: Structured Matrices and Polynomials
Structured Matrices and Polynomials: Unified Superfast Algorithms
June 26, 2001, Birkhäuser Boston
Hardcover in English - 1 edition

Add another edition?

Book Details


First Sentence

"Structured matrices (such as circulant, Toeplitz, Hankel, Frobenius, Sylvester, subresultant, Bezout, Vandermonde, Cauchy, Loewner, and Pick matrices) are omnipresent in algebraic and numerical computations in the various sciences, engineering, communication, and statistics."

Classifications

Library of Congress
QA188 .P364 2001, QA1-939

The Physical Object

Format
Hardcover
Number of pages
304
Dimensions
9.3 x 6.3 x 0.8 inches
Weight
1.2 pounds

Edition Identifiers

Open Library
OL8074743M
Internet Archive
structuredmatric00panv
ISBN 10
0817642404
ISBN 13
9780817642402
LCCN
2001035928
OCLC/WorldCat
47045174
Goodreads
5622998

Work Identifiers

Work ID
OL8533150W

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
November 14, 2023 Edited by MARC Bot import existing book
December 24, 2021 Edited by ImportBot import existing book
December 3, 2020 Edited by MARC Bot import existing book
July 7, 2019 Edited by MARC Bot import existing book
April 29, 2008 Created by an anonymous user Imported from amazon.com record