No label defined (Q3690950)
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 3915503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3915503 |
Statements
1982
0 references
complexity
0 references
block Toeplitz systems
0 references
Padé-approximation method
0 references
0.8031272292137146
0 references
0.7897884845733643
0 references
[For the entire collection see Zbl 0536.00008.] The author studies the complexity of some methods for an asymptotically fast solution of block Toeplitz systems \(Ax=b\). He proposes a new algorithm with the complexity \(O(p^ 2N \log^ 2_ 2N+p^ 3N)\) where N is the order of the matrix A and p is the Toeplitz rank of A. Further he suggests a new block variant of the Padé-approximation method and discusses its complexity.
0 references