Iterative Methods for Sparse Linear Systems
Yousef Saad · Society for Industrial and Applied Mathematics eBooks · 2003
Preface 1. Background in linear algebra 2. Discretization of partial differential equations 3. Sparse matrices 4. Basic iterative methods 5. Projection methods 6. Krylov subspace methods Part I 7. Krylov subspace methods Part II 8. Methods related to the normal equations 9. Preconditioned iterations 10. Preconditioning techniques 11. Parallel implementations 12. Parallel preconditioners 13. Multigrid methods 14. Domain decomposition methods Bibliography Index.
Cited by 13,790 works. doi:10.1137/1.9780898718003
Authors
References
- Matrix Computations
- Reducibility among Combinatorial Problems
- The Theory of Matrices
- The algebraic eigenvalue problem
- Methods of conjugate gradients for solving linear systems
- Matrix Iterative Analysis
- Introduction to matrix computations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
- Padé-Type Approximation and General Orthogonal Polynomials