Separable type representations of matrices and fast algorithms. Volume 2, Eigenvalue method /
Saved in:
Author / Creator: | Eidelman, Yuli, 1955- author. |
---|---|
Imprint: | Basel : Birkhäuser, 2014. |
Description: | 1 online resource (xi, 359 pages). |
Language: | English |
Series: | Operator Theory: Advances and Applications, 0255-0156 ; volume 235 Operator theory, advances and applications ; v. 235. |
Subject: | |
Format: | E-Resource Book |
URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/11081479 |
Varying Form of Title: | Eigenvalue method |
---|---|
Other authors / contributors: | Gohberg, I. (Israel), 1928-2009, author. Haimovici, Iulian, author. |
ISBN: | 9783034806121 3034806124 9783034806053 3034806051 3034806116 9783034806114 9783034806114 |
Notes: | Includes bibliographical references and index. Online resource; title from PDF title page (SpringerLink, viewed October 14, 2013). |
Summary: | This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The primary focus is on fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work examines algorithms of multiplication, inversion and description of eigenstructure and includes a wealth of illustrative examples throughout the different chapters. The second volume, consisting of four parts, addresses the eigenvalue problem for matrices with quasiseparable structure and applications to the polynomial root finding problem. In the first part the properties of the characteristic polynomials of principal leading submatrices, the structure of eigenspaces and the basic methods for computing eigenvalues are studied in detail for matrices with quasiseparable representation of the first order. The second part is devoted to the divide and conquer method, with the main algorithms also being derived for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable representations of any order is studied in the third part. This method is then used in the last part in order to provide a fast solver for the polynomial root finding problem. The work is based mostly on results obtained by the authors and their coauthors. Due to its many significant applications and accessible style, the text will be a valuable resource for engineers, scientists, numerical analysts, computer scientists and mathematicians alike. |
Standard no.: | 10.1007/978-3-0348-0612-1 |
Similar Items
-
Separable type representations of matrices and fast algorithms. Volume 1, Basics. Completion Problems. Multiplication and Inversion Algorithms /
by: Eidelman, Yuli, 1955-
Published: (2014) -
Fast reliable algorithms for matrices with structure.
Published: (1999) -
Fast algorithms for structured matrices : theory and applications : AMS-IMS-SIAM Joint Summer Research Conference on Fast Algorithms in Mathematics, Computer Science, and Engineering, August 5-9, 2001, Mount Holyoke College, South Hadley, Massachusetts /
Published: (2003) -
Algorithms for sparse linear systems /
by: Scott, Jennifer
Published: (2023) -
Fast reliable algorithms for matrices with structure /
Published: (1999)