On the forward stability of a modified `stride of 3' reduction method (Q1334540)
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: On the forward stability of a modified `stride of 3' reduction method |
scientific article; zbMATH DE number 641413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the forward stability of a modified `stride of 3' reduction method |
scientific article; zbMATH DE number 641413 |
Statements
On the forward stability of a modified `stride of 3' reduction method (English)
0 references
25 September 1994
0 references
An extension of cyclic reduction for tridiagonal systems is presented. While in cyclic reduction in each step the unknowns with odd numbers are eliminated and the remaining unknowns have ``stride 2'', the authors propose a similar elimination scheme that eliminates 2 out of 3 consecutive unknowns and produce a reduced system of stride 3. The error analysis shows that for diagonally dominant matrices the off diagonal elements decrease fast in each reduction step so that in this case (as also in cyclic reduction) the method can be viewed as an iterative method.
0 references
parallel computing
0 references
cyclic reduction
0 references
tridiagonal systems
0 references
elimination scheme
0 references
diagonally dominant matrices
0 references
iterative method
0 references
0.8754152655601501
0 references
0.8754152655601501
0 references
0.8517841100692749
0 references
0.8503336310386658
0 references