A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach (Q1263247)
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 4126590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach |
scientific article; zbMATH DE number 4126590 |
Statements
A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach (English)
0 references
1989
0 references
Gegeben sei eine formale Potenzreihe \(S(x)=\sum^{\infty}_{i=0}s_ ix^ i\) mit \(n\times n\)-Matrizen \(s_ i\) als Koeffizienten. Zur Berechnung von (Matrix-) Padé-Approximationen von S(x) wird ein rekursiver Algorithmus explizit angegeben, der auch dann arbeitet, wenn die Potenzreihe nicht normal ist.
0 references
recursive algorithm
0 references
matrix Padé approximants
0 references
matrix polynomial
0 references
remainder sequence
0 references
divide-and-conquer
0 references
Euclidean algorithm
0 references
power series
0 references
0.8509517312049866
0 references
0.8492392301559448
0 references
0.8183646202087402
0 references
0.8135185241699219
0 references
