|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9911110002303321 |
|
|
Autore |
Börm Steffen |
|
|
Titolo |
Numerical methods for eigenvalue problems / / by Steffen Börm, Christian Mehl |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin ; ; Boston, : De Gruyter, c2012 |
|
|
|
|
|
|
|
ISBN |
|
9781283857598 |
1283857596 |
9783110250374 |
3110250373 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (216 p.) |
|
|
|
|
|
|
Collana |
|
De Gruyter graduate lectures |
|
|
|
|
|
|
Classificazione |
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Eigenvalues |
Eigenvectors |
Matrices - Data processing |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Front matter -- Preface -- Contents -- Chapter 1. Introduction -- Chapter 2. Existence and properties of eigenvalues and eigenvectors -- Chapter 3. Jacobi iteration -- Chapter 4. Power methods -- Chapter 5. QR iteration -- Chapter 6. Bisection methods -- Chapter 7. Krylov subspace methods for large sparse eigenvalue problems -- Chapter 8. Generalized and polynomial eigenvalue problems -- Bibliography -- Index |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Eigenvalues and eigenvectors of matrices and linear operators play an important role when solving problems from structural mechanics and electrodynamics, e.g., by describing the resonance frequencies of systems, when investigating the long-term behavior of stochastic processes, e.g., by describing invariant probability measures, and as a tool for solving more general mathematical problems, e.g., by diagonalizing ordinary differential equations or systems from control theory. This textbook presents a number of the most important numerical methods for finding eigenvalues and eigenvectors of matrices. The authors discuss the central ideas underlying the different algorithms and introduce the theoretical concepts required to analyze |
|
|
|
|