A superfast algorithm for multi-dimensional Padé systems (Q1192651)
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 superfast algorithm for multi-dimensional Padé systems |
scientific article; zbMATH DE number 61260
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A superfast algorithm for multi-dimensional Padé systems |
scientific article; zbMATH DE number 61260 |
Statements
A superfast algorithm for multi-dimensional Padé systems (English)
0 references
27 September 1992
0 references
The definitions of the following approximants are given: matrix Padé, matrix Hermite-Padé and matrix simultaneous Padé. There exists a number of fast algorithms for computing these approximants, but in this paper a new superfast algorithm is presented. This algorithm is reliable and can also compute the matrix Padé approximants in the so called non- normal and non-perfect case with only a slight increase in complexity. The algorithm can be used for computing inverses of block Toeplitz and block Toeplitz-like matrices along with their Hankel counterparts.
0 references
matrix Padé approximants
0 references
Hermite-Padé approximants
0 references
rational approximation
0 references
block Hankel matrix
0 references
fast algorithms
0 references
block Toeplitz-like matrices
0 references
