Modified Gram-Schmidt-based methods for block downdating the Cholesky factorization (Q629427)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modified Gram-Schmidt-based methods for block downdating the Cholesky factorization |
scientific article |
Statements
Modified Gram-Schmidt-based methods for block downdating the Cholesky factorization (English)
0 references
9 March 2011
0 references
Let \(A\) be an \(n\times n\) symmetric positive definite matrix and \(A = R^T R\) its Cholesky factorization, that is, \(R\) is upper triangular and has positive diagonal entries. Consider the modified matrix \(\tilde A = A - X^T X = R^T R - X^T X\), where \(X\) is an \(t\times n\) matrix, and assume that \(\tilde A\) remains positive definite. The paper is concerned with computing the Cholesky factorization of \(\tilde A\) by appropriately downdating the Cholesky factorization of \(A\) rather than computing the factorization of \(\tilde A\) explicitly from scratch. A hyperbolic modified Gram-Schmidt method is proposed for this purpose. Several numerical experiments with random matrices and an academic example illustrate the accuracy properties of the newly proposed method.
0 references
block downdating
0 references
Cholesky factorization
0 references
hyperbolic modified Gram-Schmidt method
0 references
numerical stability
0 references
symmetric positive definite matrix
0 references
numerical experiments
0 references
random matrices
0 references
0 references