An algorithm for computing a Padé approximant with minimal degree denominator (Q455889): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Victor M. Adukov / rank | |||
| Property / author | |||
| Property / author: Victor M. Adukov / rank | |||
Normal rank | |||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Martin D. Buhmann / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65D15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 41A21 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6097325 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimal degree denominator | |||
| Property / zbMATH Keywords: minimal degree denominator / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Padé approximant | |||
| Property / zbMATH Keywords: Padé approximant / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Toeplitz matrix | |||
| Property / zbMATH Keywords: Toeplitz matrix / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Padé-Laplace method | |||
| Property / zbMATH Keywords: Padé-Laplace method / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Froissart doublets | |||
| Property / zbMATH Keywords: Froissart doublets / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
numerical examples | |||
| Property / zbMATH Keywords: numerical examples / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cam.2012.06.022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010595748 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:01, 19 March 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
