Computational Methods for General Sparse Matrices [Paperback]

1. Exploiting Sparsity.- 2. Storage Schemes.- 3. General Scheme for Linear Algebraic Problems.- 4. Pivotal Strategies for Gaussian Elimination.- 5. Use of Iterative Refinement in the GE Process.- 6. Implementation of the Algorithms.- 7. Solving Least Squares Problems by Augmentation.- 8. Sparse Matrix Technique for Ordinary Differential Equations.- 9. Condition Number Estimators in a Sparse Matrix Software.- 10. Parallel Direct Solvers.- 11 Parallel Orthomin for General Sparse Matrices.- 12. Orthogonalization Methods.- 13. Two Storage Schemes for Givens Plane Rotations.- 14. Pivotal Strategies for Givens Plane Rotations.- 15. Iterative Refinement after the Plane Rotations.- 16. Preconditioned Conjugate Gradients for Givens Plane Rotations.- References.- Author Index.Springer Book Archives