A fast algorithm for solving a Toeplitz system (Q606710)
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 5817279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for solving a Toeplitz system |
scientific article; zbMATH DE number 5817279 |
Statements
A fast algorithm for solving a Toeplitz system (English)
0 references
18 November 2010
0 references
The author derives a fast algorithm for solving symmetric penta-diagonal systems. The Toeplitz \(n \times n\) matrix \(A\) of the system of linear algebraic equations is decomposed. The Sherman-Morison-Woodbury formula is used to obtain conditions under which the matrix \(A\) is invertible. Quite complicated formulas lead to a fast algorithm for solving the original system. The author proves that for strictly diagonally dominant \(A\) the algorithm is stable and works well. Two numerical examples illustrate the theory.
0 references
symmetric penta-diagonal systems of linear algebraic equations
0 references
fast direct algorithm for finding a solution
0 references
stability analysis
0 references
Toeplitz system
0 references
diagonally dominant
0 references
factorization
0 references
0.9362679719924928
0 references
0.9090507626533508
0 references
0.8974236845970154
0 references
0.8665837645530701
0 references
