Perturbation analysis for block downdating of a Cholesky decomposition (Q1338816)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Perturbation analysis for block downdating of a Cholesky decomposition |
scientific article |
Statements
Perturbation analysis for block downdating of a Cholesky decomposition (English)
0 references
21 November 1994
0 references
Let the Cholesky decomposition of \(X^ T X\) be \(X^ T X = R^ T R\), where \(R\) is upper triangular. The Cholesky block downdating problem is to determine \(\widetilde{R}\) such that \(\widetilde{R}^ T \widetilde{R} = R^ T R - Z^ T Z\), where \(Z\) is a block of rows from the data matrix \(X\). This paper analyzes the sensitivity of this block downdating problem of the Cholesky factorization. A measure of conditioning for the Cholesky block downdating is presented and compared to the single row downdating case.
0 references
Cholesky decomposition
0 references
block downdating problem
0 references
sensitivity
0 references
Cholesky factorization
0 references
conditioning
0 references