The solution of periodic tridiagonal linear systems by the stride of 3 reduction algorithm (Q4934823)
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 1394603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The solution of periodic tridiagonal linear systems by the stride of 3 reduction algorithm |
scientific article; zbMATH DE number 1394603 |
Statements
The solution of periodic tridiagonal linear systems by the stride of 3 reduction algorithm (English)
0 references
21 November 2000
0 references
odd/even reduction
0 references
stride of 3 cyclic reduction
0 references
periodic tridiagonal system
0 references
numerical example
0 references
boundary value problem
0 references
0.9411339
0 references
0.9108445
0 references
0.9086102
0 references
0.9045807
0 references
0.89868915
0 references
0.89831144
0 references
0.8905961
0 references
0.8819493
0 references
The matrix arising from one simple discretization of the boundary-value problem for an ordinary differential equation is tridiagonal except for two extra non-zero entries at the extreme top right and bottom left corners. Such periodic tridiagonal systems can be solved by an odd-even cyclic reduction technique. In this note, the author discusses a similar cyclic reduction technique but with a stride of three rather than a stride of two. The discussion takes the form of a worked example with a symmetric \(3^m\times 3^m\) matrix with unit off-diagonal entries and constant diagonal entries.
0 references
