Stabilization by perturbation of ILL-conditioned cyclic reduction<sup>∗</sup> (Q3838262)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1185361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stabilization by perturbation of ILL-conditioned cyclic reduction<sup>∗</sup> |
scientific article; zbMATH DE number 1185361 |
Statements
Stabilization by perturbation of ILL-conditioned cyclic reduction<sup>∗</sup> (English)
0 references
3 January 1999
0 references
numerical examples
0 references
iterative refinement
0 references
tridiagonal matrices
0 references
ill-conditioned systems
0 references
stabilization
0 references
cyclic reduction algorithm
0 references
tridiagonal system
0 references
fast algorithm
0 references
0.8120010495185852
0 references
A method for the stabilization of the cyclic reduction algorithm for solving a tridiagonal system of linear equations is presented. This requires a modification of the cyclic reduction algorithm that does not involve back substitution and iterative refinement. In the proposed method, when it is necessary to divide by numbers less than a prechosen tolerance, then the number is replaced by the tolerance. Iterative refinement is used to get very accurate solutions to compensate for this perturbation. It is shown that only one or two iterative refinement steps are necessary. A fast algorithm for multiple right hand sides is given. Computational results are presented showing the efficiency of the proposed method.
0 references