Abstract
In (simple) Pál-type interpolation the problem consists of finding a polynomial of degree n+m-1 that has prescribed values at, say, n pairwise distinct points and prescribed values for the rth derivative r1 at (another) set of m distinct points.
The problem is named regular if it has a unique solution for any set of data; this is equivalent to the homogeneous problem (all prescribed values are 0) having the trivial solution only.
In this paper the effect of interchanging the value-nodes and the derivative-nodes on the regularity of the problem is studied for several sets of nodes.
Keywords: Pál-type interpolation; Regularity
| Original language | Undefined/Unknown |
|---|---|
| Pages (from-to) | 175-184 |
| Number of pages | 10 |
| Journal | Journal of Computational and Applied Mathematics |
| Volume | 179 |
| Issue number | 1-2 |
| DOIs | |
| Publication status | Published - 2005 |
Keywords
- academic journal papers
- ZX CWTS JFIS < 1.00