Focuses on the use of iterative methods for solving large sparse systems of linear equations. Templates are introduced to meet the needs of both the traditional user and the high performance specialist. Templates, a description of a general algorithm rather than the executable object or source code more commonly found in a conventional software library, offer the degree of customization the user may desire.
Focuses on the use of iterative methods for solving large sparse systems of linear equations. Templates are introduced to meet the needs of both the traditional user and the high performance specialist. Templates, a description of a general algorithm rather than the executable object or source code more commonly found in a conventional software library, offer the degree of customization the user may desire.
1. List of Symbols 2. List of Figures 3. Chapter 1: Introduction 4. Why Use Templates? 5. What Methods Are Covered? 6. Chapter 2: Iterative Methods 7. Overview of the Methods 8. Stationary Iterative Methods 9. The Jacobi Method 10. The Gauss-Seidel Method 11. The Successive Overrelaxation Method 12. The Symmetric Successive Overrelaxation Method 13. Notes and References 14. Nonstationary Iterative Methods 15. Conjugate Gradient Method (CG) 16. MINRES and SYMMLQ 17. CG on the Normal Equations, CGNE and CGNR 18. Generalized Minimal Residual (GMRES) 19. BiConjugate Gradient (BiCG) 20. Quasi-Minimal Residual (QMR) 21. Conjugate Gradient Squared Method (CGS) 22. BiConjugate Gradient Squared Method (Bi-CGSTAB) 23. Chebyshev Iteration 24. Computational Aspects of the Methods 25. A Short History of Krylov Methods 26. Survey of Recent Krylov Methods 27. Chapter 3: Preconditioners 28. The Why and How 29. Cost Trade-off 30. Left and right preconditioning 31. Jacobi Preconditioning 32. Block Jacobi Methods 33. Discussion 34. SSOR Preconditioning 35. Incomplete Factorization Preconditioners 36. Creating an Incomplete Factorization 37. Point Incomplete Factorizations 38. Block Factorization Methods 39. Incomplete LQ Factorization 40. Polynomial Preconditioners 41. Other Preconditioners 42. Preconditioning by the Symmetric Part 43. The Use of Fast Solvers 44. Alternating Direction Implicit Methods 45. Chapter 4: Related Issues 46. Complex Systems 47. Stopping Criteria 48. More Details about Stopping Criteria 49. When __ or ____ is not Readily Available 50. Estimating ____ 51. Stopping When Progress is no Longer Being Made 52. Accounting for Floating Point Errors 53. Data Structures 54. Survey of Sparse Matrix Storage Formats 55. Matrix Vector Products 56. Sparse Incomplete Factorizations 57. Parallelism 58. Inner Products 59. Vector Updates 60. Matrix-vector Products 61. Preconditioning 62. Wavefronts in the Gauss-Seidel and Conjugate Gradient Methods 63. Blocked Operations in the GMRES Method 64. Chapter 5: Remaining Topics 65. The Lanczos Connection 66. Block and n - step Iterative Methods 67. Reduced System Preconditioning 68. Domain Decomposition Methods 69. Overlapping Subdomain Methods 70. Non-overlapping Subdomain Methods 71. Further Remarks 72. Multigrid Methods 73. Row Projection Methods 74. Appendix A: Obtaining the Software 75. Appendix B: Overview of the Blas 76. Appendix C: Glossary.
1. List of Symbols 2. List of Figures 3. Chapter 1: Introduction 4. Why Use Templates? 5. What Methods Are Covered? 6. Chapter 2: Iterative Methods 7. Overview of the Methods 8. Stationary Iterative Methods 9. The Jacobi Method 10. The Gauss-Seidel Method 11. The Successive Overrelaxation Method 12. The Symmetric Successive Overrelaxation Method 13. Notes and References 14. Nonstationary Iterative Methods 15. Conjugate Gradient Method (CG) 16. MINRES and SYMMLQ 17. CG on the Normal Equations, CGNE and CGNR 18. Generalized Minimal Residual (GMRES) 19. BiConjugate Gradient (BiCG) 20. Quasi-Minimal Residual (QMR) 21. Conjugate Gradient Squared Method (CGS) 22. BiConjugate Gradient Squared Method (Bi-CGSTAB) 23. Chebyshev Iteration 24. Computational Aspects of the Methods 25. A Short History of Krylov Methods 26. Survey of Recent Krylov Methods 27. Chapter 3: Preconditioners 28. The Why and How 29. Cost Trade-off 30. Left and right preconditioning 31. Jacobi Preconditioning 32. Block Jacobi Methods 33. Discussion 34. SSOR Preconditioning 35. Incomplete Factorization Preconditioners 36. Creating an Incomplete Factorization 37. Point Incomplete Factorizations 38. Block Factorization Methods 39. Incomplete LQ Factorization 40. Polynomial Preconditioners 41. Other Preconditioners 42. Preconditioning by the Symmetric Part 43. The Use of Fast Solvers 44. Alternating Direction Implicit Methods 45. Chapter 4: Related Issues 46. Complex Systems 47. Stopping Criteria 48. More Details about Stopping Criteria 49. When __ or ____ is not Readily Available 50. Estimating ____ 51. Stopping When Progress is no Longer Being Made 52. Accounting for Floating Point Errors 53. Data Structures 54. Survey of Sparse Matrix Storage Formats 55. Matrix Vector Products 56. Sparse Incomplete Factorizations 57. Parallelism 58. Inner Products 59. Vector Updates 60. Matrix-vector Products 61. Preconditioning 62. Wavefronts in the Gauss-Seidel and Conjugate Gradient Methods 63. Blocked Operations in the GMRES Method 64. Chapter 5: Remaining Topics 65. The Lanczos Connection 66. Block and n - step Iterative Methods 67. Reduced System Preconditioning 68. Domain Decomposition Methods 69. Overlapping Subdomain Methods 70. Non-overlapping Subdomain Methods 71. Further Remarks 72. Multigrid Methods 73. Row Projection Methods 74. Appendix A: Obtaining the Software 75. Appendix B: Overview of the Blas 76. Appendix C: Glossary.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826
