Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
From MaRDI portal
Publication:4371764
DOI10.1145/114697.116809zbMath0900.65066OpenAlexW2080975681MaRDI QIDQ4371764
Publication date: 18 March 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1991-17/
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Fast Cholesky factorization for interior point methods of linear programming, A survey of direct methods for sparse linear systems, A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization, Solving quadratically constrained convex optimization problems with an interior-point method, Advances in design and implementation of optimization software
Uses Software
