Modifying a Sparse Cholesky Factorization

DOI10.1137/S0895479897321076MaRDI QIDQ4243521zbMATH OpenFDO

Authors Timothy A. Davis, William Hager

Publication date 18 May 1999

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895479897321076

zbMATH Keywords

Cholesky factorizationsparse Cholesky factorizationsparse matrixsymmetric positive definite matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• Row Modifications of a Sparse Cholesky Factorization
• Multiple-rank modifications of a sparse Cholesky factorization
• A node-addition model for symbolic factorization
• Cholesky Factor Updating Techniques for Rank 2 Matrix Modifications
• scientific article; zbMATH DE number 3850363

Cited in

(28)

• Additive Schwarz preconditioners for the obstacle problem of clamped Kirchhoff plates
• Classification of brain activation via spatial Bayesian variable selection in fMRI regression
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
• 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
• A novel multi-grid assisted reanalysis for re-meshed finite element models
• Exact and efficient isogeometric reanalysis of accurate shape and boundary modifications
• Updating preconditioners for modified least squares problems
• 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
• A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system
• Multiple-rank modifications of a sparse Cholesky factorization
• Projection onto a polyhedron that exploits sparsity
• Square root SAM: simultaneous localization and mapping via square root information smoothing
• A node-addition model for symbolic factorization
• scientific article; zbMATH DE number 1308904 (Why is no real title available?)
• Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates
• Row Modifications of a Sparse Cholesky Factorization
• A survey of direct methods for sparse linear systems
• On updating the structure of sparse matrix factors
• Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
• Bayesian contiguity constrained clustering
• Spatial best linear unbiased prediction: a computational mathematics approach for high dimensional massive datasets
• Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
• A rank-one-update method for the training of support vector machines
• Code generation for solving and differentiating through convex optimization problems
• Reanalysis-based fast solution algorithm for flexible multi-body system dynamic analysis with floating frame of reference formulation
• Parameter estimation in high dimensional Gaussian distributions

This page was built for publication: Modifying a Sparse Cholesky Factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243521)