Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods (Q1371672): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:10, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods |
scientific article |
Statements
Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods (English)
0 references
14 December 1997
0 references
[For part I see Pitman Res. Notes Math. Ser. 303, 105-156 (1994; Zbl 0795.65019).] Consider the equation \(Ax= b\) and let \(r= b-A\widetilde x\) be the residue for an approximate solution \(\widetilde x\). The energy norm of the error or equivalently the quadratic form \(r^T A^{-1}r\) is to be determined. More generally \(u^Tf(A)u\) is expressed as a Stieltjes integral (with the spectral decomposition of \(A\)) and computed via a quadrature formula. The latter is constructed via orthogonal polynomials, more precisely via a Lanczos procedure which in turn is equivalent to a conjugate gradient method. Reviewer's remark. It would be interesting to see whether (say) \(k\) steps of the computation of the error are related to the improvement of the approximate solution \(\widetilde x\) by \(k\) steps of the conjugate gradient algorithm.
0 references
moments
0 references
quadrature
0 references
matrix functions
0 references
orthogonal polynomials
0 references
Lanczos method
0 references
Stieltjes integral
0 references
quadrature formula
0 references