Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations

DOI10.1145/321556.321565MaRDI QIDQ5578438zbMATH OpenOpenAlexFDO

Authors Fred G. Gustavson, Ralph A. Willoughby, Werner Liniger

Publication date 1970

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321556.321565

zbMATH Keywords

numerical analysis

Cited in

(11)

• Some Results on Sparse Matrices
• The shape of the strongest column with a follower load
• A survey of direct methods for sparse linear systems
• Computational methods of linear algebra
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• A newa priori ordering method for sparse systems of equations based on an ordered output set
• Elimination on sparse symmetric systems of a special structure
• The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
• Microcomputer symbolic generation of an optimal Crout algorithm for sparse systems of linear equations
• Vector processing in simplex and interior methods for linear programming
• La risoluzione dei sistemi lineari sparsi di grandi dimensioni

This page was built for publication: Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5578438)