Vectorized algorithms for solving special tridiagonal systems (Q679289)
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: Vectorized algorithms for solving special tridiagonal systems |
scientific article; zbMATH DE number 1002354
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vectorized algorithms for solving special tridiagonal systems |
scientific article; zbMATH DE number 1002354 |
Statements
Vectorized algorithms for solving special tridiagonal systems (English)
0 references
19 October 1997
0 references
Two fast vectorized algorithms for solving a special tridiagonal system of the form \(A_nx=b\) are presented. Both new algorithms consist of three phases and only differ in the second phase. The first phase is a Toeplitz factorization of a slightly perturbed matrix of \(A_n\). The second phase is to solve the perturbed problem in a highly vectorized way, but only scale \(\times\) vector operations are involved. In the third phase, the solution to the original problem is recovered from the solution to the perturbed problem. Some error analyses are also given. In addition, some experimental results are illustrated on CRAY X-MP EA/116Se.
0 references
circular near-Toeplitz systems
0 references
diagonally dominant
0 references
error analysis
0 references
vectorized algorithms
0 references
tridiagonal system
0 references
Toeplitz factorization
0 references
CRAY X-MP
0 references
0 references