Row Modifications of a Sparse Cholesky Factorization
From MaRDI portal
Recommendations
Cited in
(21)- Rank revealing Gaussian elimination by the maximum volume concept
- A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system
- A survey of direct methods for sparse linear systems
- Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
- A compact row storage scheme for Cholesky factors using elimination trees
- Projection onto a polyhedron that exploits sparsity
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- A node-addition model for symbolic factorization
- AMPS: an augmented matrix formulation for principal submatrix updates with application to power grids
- scientific article; zbMATH DE number 4166703 (Why is no real title available?)
- Multiple-rank modifications of a sparse Cholesky factorization
- A sparse proximal implementation of the LP dual active set algorithm
- Dual multilevel optimization
- A sparse counterpart of Reichel and Gragg's package QRUP
- Bayesian contiguity constrained clustering
- Spatial best linear unbiased prediction: a computational mathematics approach for high dimensional massive datasets
- Updating preconditioners for modified least squares problems
- Cholesky Factor Updating Techniques for Rank 2 Matrix Modifications
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- scientific article; zbMATH DE number 3980363 (Why is no real title available?)
- Additive Schwarz preconditioners for the obstacle problem of clamped Kirchhoff plates
This page was built for publication: Row Modifications of a Sparse Cholesky Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317616)