An algorithm for computing a Padé approximant with minimal degree denominator (Q455889): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for computing a Padé approximant with minimal degree denominator |
scientific article |
Statements
An algorithm for computing a Padé approximant with minimal degree denominator (English)
0 references
22 October 2012
0 references
For using Padé-approximations it is particularly attractive to have denominators with small degree. In this paper, a method is studied by which the least degree can be achieved for the polynomial in the denominators of the approximants. This algorithm is presented in the article together with preliminary examples, with several examples where the method is used, and further applications.
0 references
minimal degree denominator
0 references
Padé approximant
0 references
Toeplitz matrix
0 references
Padé-Laplace method
0 references
Froissart doublets
0 references
numerical examples
0 references
