Multiple-rank modifications of a sparse Cholesky factorization
From MaRDI portal
Recommendations
- Modifying a Sparse Cholesky Factorization
- Row Modifications of a Sparse Cholesky Factorization
- Modified Cholesky Factorizations for Sparse Preconditioners
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- scientific article; zbMATH DE number 833702
- scientific article; zbMATH DE number 833696
- Highly Parallel Sparse Cholesky Factorization
- A Mapping Algorithm for Parallel Sparse Cholesky Factorization
- Simultaneous pursuit of sparseness and rank structures for matrix decomposition
- scientific article; zbMATH DE number 1760069
Cited in
(28)- A sparse counterpart of Reichel and Gragg's package QRUP
- Additive Schwarz preconditioners for the obstacle problem of clamped Kirchhoff plates
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- On a primal-dual Newton proximal method for convex quadratic programs
- 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 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
- Projection onto a polyhedron that exploits sparsity
- A node-addition model for symbolic factorization
- scientific article; zbMATH DE number 4109938 (Why is no real title available?)
- A factorization with update procedures for a KKT matrix arising in direct optimal control
- Modifying a Sparse Cholesky Factorization
- Cholesky Factor Updating Techniques for Rank 2 Matrix Modifications
- Row Modifications of a Sparse Cholesky Factorization
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- A survey of direct methods for sparse linear systems
- Dominant speed factors of active set methods for fast MPC
- 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
- Sparse linear least-squares problems
- Reanalysis-based fast solution algorithm for flexible multi-body system dynamic analysis with floating frame of reference formulation
- Irregular lattice models of fracture of multiphase particulate materials
- Locality of reference in sparse Cholesky factorization methods
This page was built for publication: Multiple-rank 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 Q2706302)
