Separable type representations of matrices and fast algorithms. Volume 2, [electronic resource] Eigenvalue method / Yuli Eidelman, Israel Gohberg, Iulian Haimovici.
2014
QA188
Linked e-resources
Linked Resource
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Separable type representations of matrices and fast algorithms. Volume 2, [electronic resource] Eigenvalue method / Yuli Eidelman, Israel Gohberg, Iulian Haimovici.
ISBN
9783034806121 electronic book
3034806124 (electronic book
9783034806114
3034806124 (electronic book
9783034806114
Published
Basel : Birkhäuser, 2014.
Language
English
Description
1 online resource (xi, 359 pages).
Item Number
10.1007/978-3-0348-0612-1 doi
Call Number
QA188
Dewey Decimal Classification
512.9/434
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.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Source of Description
Description based on online resource; title from PDF title page (SpringerLink, viewed October 14, 2013).
Series
Operator theory, advances and applications ; v.235.
Linked Resources
Record Appears in
Table of Contents
Part V. The eigenvalue structure of order one quasiseparable matrices
part VI. Divide and conquer method for the eigenproblem
part VII. Algorithms for QR iterations and for reduction to Hessenberg form
part VIII. QR iterations for companion matrices.
part VI. Divide and conquer method for the eigenproblem
part VII. Algorithms for QR iterations and for reduction to Hessenberg form
part VIII. QR iterations for companion matrices.