Transcription of Iterative Methods for Sparse Linear Systems
{{id}} {{{paragraph}}}
Iterative Methods for Sparse Linear Systems Yousef Saad 6. 15 12. 4 9 5. 11 14 8. 2 10 3. 13 7. 1. Copyright c 2000 by Yousef Saad. S ECOND EDITION WITH CORRECTIONS . JANUARY 3 RD , 2000.. PREFACE xiii Acknowledgments .. xiv Suggestions for Teaching .. xv 1 BACKGROUND IN Linear ALGEBRA 1. Matrices .. 1. Square Matrices and Eigenvalues .. 3. Types of Matrices .. 4. Vector Inner Products and Norms .. 6. Matrix Norms .. 8. Subspaces, Range, and Kernel .. 9. Orthogonal Vectors and Subspaces .. 10. Canonical Forms of Matrices .. 15. Reduction to the Diagonal Form .. 15. The Jordan Canonical Form .. 16. The Schur Canonical Form .. 17. Application to Powers of Matrices .. 19. Normal and Hermitian Matrices .. 21. Normal Matrices.
Iterative methods for solving general, large sparse linear systems have been gaining popularity in many areas of scientific computing. Until recently, direct solution methods
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}
Equations, Matrices Systems of Linear, Systems of Linear Equations, Matrices, Gauss, Jordan Elimination, Linear equations, Jordan, Linear Equations: Gauss-Jordan Elimination and Matrices, Inverse Matrices, Elimination, MIT OpenCourseWare, Exercises and Problems in Linear Algebra, Linear algebra, LINEAR, Matrix Solutions to Linear Equations, Alamo Colleges