### Abstract

Polynomial interpolation between large numbers of arbitrary nodes does notoriously not, in general, yield useful approximations of continuous functions. Following [1], we suggest to determine for each set of n + 1 nodes another denominator of degree n, and then to interpolate every continuous function by a rational function with that same denominator, so that the resulting interpolation process remains a linear projection. The optimal denominator is chosen so as to minimize the Lebesgue constant for the given nodes. It has to be computed numerically. For that purpose, the barycentric representation of rational interpolants, which displays the linearity of the interpolation and reduces the determination of the denominator to that of the barycentric weights, is used. The optimal weights can then be computed by solving an optimization problem with simple bounds which could not be solved accurately by the first author in [1]. We show here how to do so, and we present numerical results.

Original language | English (US) |
---|---|

Pages (from-to) | 77-86 |

Number of pages | 10 |

Journal | Computers and Mathematics with Applications |

Volume | 33 |

Issue number | 6 |

DOIs | |

State | Published - Mar 1997 |

### Keywords

- Interpolation
- Lebesgue constant
- Linear interpolation
- Rational interpolation

### ASJC Scopus subject areas

- Modeling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics