You are here: MIMS > EPrints
MIMS EPrints

2006.163: A modified Cholesky algorithm based on a symmetric indefinite factorization

2006.163: Sheung Hun Cheng and Nicholas J. Higham (1998) A modified Cholesky algorithm based on a symmetric indefinite factorization. SIAM Journal On Matrix Analysis And Applications, 19 (4). pp. 1097-1110. ISSN 1095-7162

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
349 Kb

DOI: 10.1137/S0895479896302898

Abstract

Given a symmetric and not necessarily positive definite matrix A, a modified Cholesky algorithm computes a Cholesky factorization P(A+E)PT = RT R, where P is a permutation matrix and E is a perturbation chosen to make A+E positive definite. The aims include producing a small-normed E and making A+E reasonably well conditioned. Modified Cholesky factorizations are widely used in optimization. We propose a new modified Cholesky algorithm based on a symmetric indefinite factorization computed using a new pivoting strategy of Ashcraft, Grimes, and Lewis. We analyze the effectiveness of the algorithm, both in theory and practice, showing that the algorithm is competitive with the existing algorithms of Gill, Murray, and Wright and Schnabel and Eskow. Attractive features of the new algorithm include easy-to-interpret inequalities that explain the extent to which it satisfies its design goals, and the fact that it can be implemented in terms of existing software.

Item Type:Article
Uncontrolled Keywords: modified Cholesky factorization, optimization, Newton's method, symmetric indefinite factorization
Subjects:MSC 2000 > 15 Linear and multilinear algebra; matrix theory
MSC 2000 > 65 Numerical analysis
MIMS number:2006.163
Deposited By:Miss Louise Stait
Deposited On:03 July 2006

Download Statistics: last 4 weeks
Repository Staff Only: edit this item