Fast matrix factorizations via discrete transmission lines (Q1082033)
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 3972061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast matrix factorizations via discrete transmission lines |
scientific article; zbMATH DE number 3972061 |
Statements
Fast matrix factorizations via discrete transmission lines (English)
0 references
1986
0 references
It is shown that simple arguments, related to the so called discrete transmission lines, can be used to derive the fast Cholesky algorithm for triangular factorization of symmetric positive definite Toeplitz matrices and their inverses. The transmission-line derivation provides clear physical interpretation of the classical Schur and Levinson algorithms and the Toeplitz inversion formula of Gohberg and Semencul.
0 references
Schur algorithm
0 references
discrete transmission lines
0 references
fast Cholesky algorithm
0 references
triangular factorization
0 references
symmetric positive definite Toeplitz matrices
0 references
inverses
0 references
Levinson algorithms
0 references
Toeplitz inversion formula
0 references
0.7933509349822998
0 references
0.783598780632019
0 references
0.7686251401901245
0 references
0.7675412893295288
0 references
