A superfast algorithm for multi-dimensional Padé systems (Q1192651): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q588817 |
||
| Property / reviewed by | |||
| Property / reviewed by: Heiner Mühlig / rank | |||
Revision as of 04:42, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A superfast algorithm for multi-dimensional Padé systems |
scientific article |
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
