A lookahead algorithm for the solution of block Toeplitz systems (Q1372977)
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: A lookahead algorithm for the solution of block Toeplitz systems |
scientific article; zbMATH DE number 1083223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lookahead algorithm for the solution of block Toeplitz systems |
scientific article; zbMATH DE number 1083223 |
Statements
A lookahead algorithm for the solution of block Toeplitz systems (English)
0 references
2 April 1998
0 references
A weakly stable but efficient algorithm is given for computing basis matrices for some left and right interpolation problems, where the data comes from a block Toeplitz matrix. It is shown that the use of an inversion formula, in most cases, leads to results that are not as good as an updating formula. It is recommended that the best choice is to use the updating formula to compute the initial guess for the solution and then execute one or more iterative refinements using the inversion formula. Examples are given showing cases for which the proposed algorithm does, and does not, work.
0 references
linear equations
0 references
Toeplitz systems
0 references
lookahead algorithm
0 references
algorithm
0 references
interpolation
0 references
inversion formula
0 references
updating formula
0 references
iterative refinements
0 references
0 references
0 references
0 references
0 references
0 references
0 references
