Contact us on (02) 8445 2300
For all customer service and order enquiries

Woodslane Online Catalogues

9781611970722 Academic Inspection Copy

Numerical Methods for Large Eigenvalue Problems

Description
Author
Biography
Table of
Contents
Sales
Points
Google
Preview
This revised edition discusses numerical methods for computing the eigenvalues and eigenvectors of large sparse matrices. It provides an in-depth view of the numerical methods that are applicable for solving matrix eigenvalue problems that arise in various engineering and scientific applications. Each chapter was updated by shortening or deleting outdated topics, adding topics of more recent interest and adapting the Notes and References section. Significant changes have been made to Chapters 6 through 8, which describe algorithms and their implementations and now include topics such as the implicit restart techniques, the Jacobi-Davidson method and automatic multilevel substructuring.
Yousef Saad is a College of Science and Engineering Distinguished Professor in the Department of Computer Science at the University of Minnesota. His current research interests include numerical linear algebra, sparse matrix computations, iterative methods, parallel computing, numerical methods for electronic structure and data analysis. He is a Fellow of SIAM and the AAAS.
Preface to the Classics Edition; Preface; 1. Background in matrix theory and linear algebra; 2. Sparse matrices; 3. Perturbation theory and error analysis; 4. The tools of spectral approximation; 5. Subspace iteration; 6. Krylov subspace methods; 7. Filtering and restarting techniques; 8. Preconditioning techniques; 9. Non-standard eigenvalue problems; 10. Origins of matrix eigenvalue problems; References; Index.
This revised edition discusses the numerical methods for computing the eigenvalues and eigenvectors of large sparse matrices.
Google Preview content