Modified Cholesky algorithms: A catalog with new approaches
DOI10.1007/s10107-007-0177-6zbMath1156.65023OpenAlexW2140918795MaRDI QIDQ948963
Dianne P. O'Leary, Haw-Ren Fang
Publication date: 16 October 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1903/3674
algorithmnumerical examplesCholesky factorizationquasi-Newton methodspositive definite matrixsymmetric perturbationdescent directionmultivariate optimization
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A New Modified Cholesky Factorization
- Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices
- Matrix Analysis
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- Newton-type methods for unconstrained and linearly constrained optimization
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- On the use of directions of negative curvature in a modified newton method
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- Accurate Symmetric Indefinite Linear Equation Solvers
- Computing Modified Newton Directions Using a Partial Cholesky Factorization
- A Revised Modified Cholesky Factorization Algorithm
- On the reduction of a symmetric matrix to tridiagonal form
This page was built for publication: Modified Cholesky algorithms: A catalog with new approaches