The computation of non-perfect Padé-Hermite approximants (Q1187057): Difference between revisions
From MaRDI portal
Latest revision as of 16:17, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computation of non-perfect Padé-Hermite approximants |
scientific article |
Statements
The computation of non-perfect Padé-Hermite approximants (English)
0 references
28 June 1992
0 references
A simple and efficient algorithm to generate a number of polynomial vectors is described which can be used to describe all possible solutions for a type 1 Padé-Hermite problem. If \(\sigma\) denotes the order of approximation, which is a measure for the size of the Padé-Hermite problem, it uses only order \(n^ 2\) operations, even if the given system is not perfect. To this end, the problem is considered as a special case of a generalized Padé-Hermite problem which is also defined and analyzed.
0 references
Padé-Hermite approximants
0 references
Padé-Hermite forms
0 references
Latin polynomial problem
0 references
non-perfect system
0 references
non-normal Padé-Hermite table
0 references
algorithm
0 references
polynomial vectors
0 references
