An out-of-core sparse Cholesky solver
From MaRDI portal
Publication:2989064
DOI10.1145/1499096.1499098zbMath1364.65071OpenAlexW2113533974WikidataQ113310554 ScholiaQ113310554MaRDI QIDQ2989064
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1499096.1499098
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, An efficient analyse phase for element problems, On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems, A Cholesky out-of-core factorization, New parallel sparse direct solvers for multicore architectures, A dual gradient-projection method for large-scale strictly convex quadratic problems, On solving trust-region and other regularised subproblems in optimization, Analysis of the solution phase of a parallel multifrontal approach
Uses Software
