Modified Cholesky Factorizations for Sparse Preconditioners
DOI10.1137/0914026zbMATH Open0771.65031OpenAlexW2062393471WikidataQ114074360 ScholiaQ114074360MaRDI QIDQ5286358FDOQ5286358
Authors: Tamar Schlick 
Publication date: 29 June 1993
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0914026
Recommendations
Cholesky factorizationconvergence accelerationlarge scale unconstrained optimizationpreconditioned conjugate gradient techniquesparse preconditionerstruncated Newton minimization method
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Iterative numerical methods for linear systems (65F10)
Cited In (13)
- A survey of truncated-Newton methods
- Accuracy of preconditioned CG-type methods for least squares problems.
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- Locality of reference in sparse Cholesky factorization methods
- A chordal preconditioner for large-scale optimization
- Title not available (Why is that?)
- Analysis of preconditioners for conjugate gradients through distribution of eigenvalues
- Multiple-rank modifications of a sparse Cholesky factorization
- Nonmonotone curvilinear line search methods for unconstrained optimization
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
Uses Software
This page was built for publication: Modified Cholesky Factorizations for Sparse Preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286358)
