Multiple-Rank Modifications of a Sparse Cholesky Factorization
From MaRDI portal
Publication:2706302
DOI10.1137/S0895479899357346zbMath1049.65021MaRDI QIDQ2706302
Timothy A. Davis, William W. Hager
Publication date: 19 March 2001
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Cholesky factorizationsparse matricesmathematical softwarenumerical linear algebradirect methodsmatrix updates
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Related Items
Updating preconditioners for modified least squares problems, Irregular lattice models of fracture of multiphase particulate materials, A factorization with update procedures for a KKT matrix arising in direct optimal control, Additive Schwarz preconditioners for the obstacle problem of clamped Kirchhoff plates, A sparse proximal implementation of the LP dual active set algorithm, Dual multilevel optimization, A survey of direct methods for sparse linear systems, Dominant speed factors of active set methods for fast MPC, Projection onto a Polyhedron that Exploits Sparsity, A novel multi-grid assisted reanalysis for re-meshed finite element models, Exact and efficient isogeometric reanalysis of accurate shape and boundary modifications, Reanalysis-based fast solution algorithm for flexible multi-body system dynamic analysis with floating frame of reference formulation, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, Restrictively Preconditioned Conjugate Gradient Method for a Series of Constantly Augmented Least Squares Problems, On a primal-dual Newton proximal method for convex quadratic programs, A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system
Uses Software
