Computation of rational interpolants with prescribed poles (Q1824339)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computation of rational interpolants with prescribed poles |
scientific article; zbMATH DE number 4117727
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computation of rational interpolants with prescribed poles |
scientific article; zbMATH DE number 4117727 |
Statements
Computation of rational interpolants with prescribed poles (English)
0 references
1989
0 references
The paper deals with the rational interpolant \(R_{M,N}\), \(M\geq 0\), \(N\geq 0\), belonging to the set of rational functions \({\mathcal R}_{M,N}\) and having N prescribed poles. A constructive proof for the existence and uniqueness of \(R_{M,N}\) that interpolates \(M+1\) Hermite data is given. It is based on explicit computation of the Cauchy-Vandermonde determinant in terms of nodes and poles. The proof constitutes the basis for the derivation of an algorithm computing the interpolant numerically. The computation scheme is described.
0 references
rational interpolation
0 references
prescribed poles
0 references
Hermite data
0 references
Cauchy- Vandermonde determinant
0 references
algorithm
0 references