Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
From MaRDI portal
Publication:5578438
DOI10.1145/321556.321565zbMath0187.09703OpenAlexW1993631148MaRDI QIDQ5578438
Ralph A. Willoughby, Fred G. Gustavson, 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
Related Items
The shape of the strongest column with a follower load, Computational methods of linear algebra, The Convergence of an Algorithm for Solving Sparse Nonlinear Systems, Some Results on Sparse Matrices, A survey of direct methods for sparse linear systems, A newa priori ordering method for sparse systems of equations based on an ordered output set, Vector processing in simplex and interior methods for linear programming, La risoluzione dei sistemi lineari sparsi di grandi dimensioni, Elimination on sparse symmetric systems of a special structure, The impact of high-performance computing in the solution of linear systems: Trends and problems, Microcomputer symbolic generation of an optimal Crout algorithm for sparse systems of linear equations
