A note on rounding-error analysis of Cholesky factorization (Q1822196): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(87)90121-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014789697 / rank | |||
Normal rank | |||
Revision as of 19:24, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on rounding-error analysis of Cholesky factorization |
scientific article |
Statements
A note on rounding-error analysis of Cholesky factorization (English)
0 references
1987
0 references
The computed Cholesky factor \(L\) of a given symmetric positive definite \(n\times n\) matrix \(A\) fulfills \(LL^ T=A+E\). \textit{J. H. Wilkinson} [Tr. Mezhdunarod. Kongr. Mat., Moskva 1966, 629--640 (1968; Zbl 0197.13301)] has given a bound for \(\| E\|_ 2\). In this paper a sharper bound is given for \(\| E\|_ F\). In the first part of the paper, the author gives an exact analysis of the Cholesky factorization. Part two deals with the numerical process.
0 references
error analysis
0 references
Cholesky factorization
0 references
