Approximants de Padé-Hermite. II.: Programmation (Q792732): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Padé table, the Frobenius identities, and the qd algorithm / rank | |||
Normal rank | |||
Latest revision as of 12:40, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximants de Padé-Hermite. II.: Programmation |
scientific article |
Statements
Approximants de Padé-Hermite. II.: Programmation (English)
0 references
1984
0 references
The authors present a generalization of Padé-approximation which refers to the approximation of systems of functions. If, for example, the system consists of f and \(f^ 2\) or of f and f', then one gets cases already studied by Shafer and by Baker, resp. In the first part [ibid. 23-29 (1984; reviewed above)], the general theory and the basic determinantal relations are derived. The second paper is concerned with recursion relations for the construction of the table and the discussion of 7 numerical examples.
0 references
Padé-Hermite tables
0 references
systems of functions
0 references
determinantal relations
0 references
recursion relations
0 references
numerical examples
0 references
