Comparison of Two Algorithms for Solving Large Linear Systems
- 1 December 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 3 (4) , 486-501
- https://doi.org/10.1137/0903032
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An Estimate for the Condition Number of a MatrixSIAM Journal on Numerical Analysis, 1979
- Some Design Features of a Sparse Matrix CodeACM Transactions on Mathematical Software, 1979
- Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and IndefiniteIMA Journal of Applied Mathematics, 1979
- METHODS FOR SPARSE LINEAR LEAST SQUARES PROBLEMSPublished by Elsevier ,1976
- Monitoring the stability of the triangular factorization of a sparse matrixNumerische Mathematik, 1974
- Some Basic Techniques for Solving Sparse Systems of Linear EquationsPublished by Springer Nature ,1972
- The Solution of Large Sparse Unsymmetric Systems of Linear EquationsIMA Journal of Applied Mathematics, 1971
- Some results on sparse matricesMathematics of Computation, 1970
- Note on the iterative refinement of least squares solutionNumerische Mathematik, 1966
- Techniques for automatic tolerance control in linear programmingCommunications of the ACM, 1966