A comparative study of algorithms for reducing the fill-in during Cholesky factorization
- 1 October 1992
- journal article
- Published by Springer Nature in Journal of Geodesy
- Vol. 66 (3) , 296-305
- https://doi.org/10.1007/bf02033190
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The Evolution of the Minimum Degree Ordering AlgorithmSIAM Review, 1989
- Distribution of mathematical software via electronic mailCommunications of the ACM, 1987
- Computer Solution of Large Sparse Positive Definite Systems.Mathematics of Computation, 1982
- A Fast Implementation of the Minimum Degree Algorithm Using Quotient GraphsACM Transactions on Mathematical Software, 1980
- Reducing the profile of sparse symmetric matricesJournal of Geodesy, 1976
- Algorithm 509: A Hybrid Profile Reduction Algorithm [F1]ACM Transactions on Mathematical Software, 1976
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse MatrixSIAM Journal on Numerical Analysis, 1976
- The Use of Linear Graphs in Gauss EliminationSIAM Review, 1961