Iterative refinement using splitting methods (Q1381280)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterative refinement using splitting methods |
scientific article; zbMATH DE number 1129386
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative refinement using splitting methods |
scientific article; zbMATH DE number 1129386 |
Statements
Iterative refinement using splitting methods (English)
0 references
28 September 1998
0 references
The author shows how a splitting \(A=M-N\) can be obtained where the iteration matrix \(M^{-1}N\) adopt prescribed eigenvalues and even \(M\) may assume e.g. triangular form. Based on this fact an algorithm is given for iterative refinement that works without computing the residual in double precision.
0 references
iterative refinement
0 references
direct methods for linear systems
0 references
matrix conditioning
0 references
matrix splitting
0 references
algorithm
0 references
