Advertisement

Interpolation

  • Walter Gander
  • Martin J. Gander
  • Felix Kwok
Chapter
  • 7.2k Downloads
Part of the Texts in Computational Science and Engineering book series (TCSE, volume 11)

Abstract

Interpolation means inserting or blending in a missing value. It is the art of reading between the entries of a tabulated function (see first quote above). We start this chapter with several introductory examples in Section 4.1, through which we explain the interpolation principle. The most common interpolation technique is to use polynomials, and we show in Section 4.2 four classical techniques: using monomials, Lagrange polynomials, Newton polynomials, and orthogonal polynomials.

Keywords

Orthogonal Polynomial Discrete Fourier Transform Spline Function Interpolation Polynomial Interpolation Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Walter Gander
    • 1
  • Martin J. Gander
    • 2
  • Felix Kwok
    • 2
  1. 1.Departement InformatikETH ZürichZürichSwitzerland
  2. 2.Section de MathématiquesUniversité de GenèveGenèveSwitzerland

Personalised recommendations