Modifying a Sparse Cholesky Factorization
From MaRDI portal
Publication:4243521
DOI10.1137/S0895479897321076zbMath0929.65012MaRDI QIDQ4243521
Timothy A. Davis, William W. Hager
Publication date: 18 May 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Updating preconditioners for modified least squares problems, Parameter estimation in high dimensional Gaussian distributions, Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates, Additive Schwarz preconditioners for the obstacle problem of clamped Kirchhoff plates, A stable and optimally convergent generalized FEM (SGFEM) for linear elastic fracture mechanics, A sparse proximal implementation of the LP dual active set algorithm, Dual multilevel optimization, Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing, A survey of direct methods for sparse linear systems, Classification of brain activation via spatial Bayesian variable selection in fMRI regression, Numerical study of MHD natural convection inside a sinusoidally heated lid-driven cavity filled with Fe\(_3\)O\(_4\)-water nanofluid in the presence of Joule heating, 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, A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system
