Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Computational Methods for General Sparse Matrices

Computational Methods for General Sparse Matrices
Catalogue Information
Field name Details
Dewey Class 518
Title Computational Methods for General Sparse Matrices ([EBook]) / by Zahari Zlatev.
Author Zlatev, Zahari. , 1939-
Other name(s) SpringerLink (Online service)
Publication Dordrecht : Springer Netherlands , 1991.
Physical Details XIX, 328 pages : online resource.
Series Mathematics and its applications ; 65
ISBN 9789401711166
Contents note 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.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-94-017-1116-6
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 41979 Beginning of record . Catalogue Information 41979 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating41979
Quick Search