Items related to Separable Type Representations of Matrices and Fast...
Separable Type Representations of Matrices and Fast Algorithms: Volume 2 Eigenvalue Method (Operator Theory: Advances and Applications, 235) - Hardcover
Synopsis
This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number 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 to compute 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 being derived also for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable of any order representations is studied in the third part. This method is then used in the last part in order to get 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 the accessible style the text will be useful to engineers, scientists, numerical analysts, computer scientists and mathematicians alike.
"synopsis" may belong to another edition of this title.
From the Back Cover
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.
"About this title" may belong to another edition of this title.
Search results for Separable Type Representations of Matrices and Fast...
Stock Image
Separable Type Representations of Matrices and Fast Algorithms: Volume 2 Eigenvalue Method (Operator Theory: Advances and Applications, 235)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020037800
Quantity: Over 20 available
Stock Image
Separable Type Representations of Matrices and Fast Algorithms: Volume 2 Eigenvalue Method (Operator Theory: Advances and Applications, 235)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783034806114_new
Quantity: Over 20 available
Seller Image
Separable Type Representations of Matrices and Fast Algorithms
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number 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 to compute 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 being derived also for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable of any order representations is studied in the third part. This method is then used in the last part in order to get 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 the accessible style the text will be useful to engineers, scientists, numerical analysts, computer scientists and mathematicians alike. 372 pp. Englisch. Seller Inventory # 9783034806114
Quantity: 2 available
Stock Image
Separable Type Representations of Matrices and Fast Algorithms
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 374. Seller Inventory # 2697226028
Quantity: 4 available
Stock Image
Separable Type Representations of Matrices and Fast Algorithms
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 374 Illus. Seller Inventory # 96219891
Quantity: 4 available
Seller Image
Separable Type Representations of Matrices and Fast Algorithms : Volume 2 Eigenvalue Method
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number 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 to compute 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 being derived also for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable of any order representations is studied in the third part. This method is then used in the last part in order to get 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 the accessible style the text will be useful to engineers, scientists, numerical analysts, computer scientists and mathematicians alike. Seller Inventory # 9783034806114
Quantity: 1 available
Stock Image
Separable Type Representations of Matrices and Fast Algorithms: Eigenvalue Method: Vol 2
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 2014 edition. 359 pages. 9.25x6.25x1.00 inches. In Stock. Seller Inventory # x-3034806116
Quantity: 2 available
Stock Image
Separable Type Representations of Matrices and Fast Algorithms
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 374. Seller Inventory # 1897226022
Quantity: 4 available
Seller Image
Separable Type Representations of Matrices and Fast Algorithms
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 4318298
Quantity: Over 20 available
Seller Image
Separable Type Representations of Matrices and Fast Algorithms
Published by
Springer Basel, Birkhäuser Basel Okt 2013, 2013
ISBN 10: 3034806116
ISBN 13: 9783034806114
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware -This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number 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 to compute 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 being derived also for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable of any order representations is studied in the third part. This method is then used in the last part in order to get 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 the accessible style the text will be useful to engineers, scientists, numerical analysts, computer scientists and mathematicians alike.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 372 pp. Englisch. Seller Inventory # 9783034806114
Quantity: 2 available