Skip to main content

Interpolation

  • Chapter
  • First Online:
Topology, Calculus and Approximation

Part of the book series: Springer Undergraduate Mathematics Series ((SUMS))

  • 3232 Accesses

Abstract

In order to shorten tedious astronomical computations, for centuries multiplication was transformed into addition by using the trigonometrical identity

$$\displaystyle{ 2\cos \alpha \cos \beta =\cos (\alpha +\beta ) +\cos (\alpha -\beta ). }$$

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 37.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We say that a is a root of multiplicity m of a function f if

    $$\displaystyle{ f^{(\,j)}(a) = 0\quad \text{for}\quad j = 0,\ldots,m - 1,\quad \text{and}\quad f^{(m)}(a)\neq 0. }$$
  2. 2.

    We recall that in this book the symbol ≡ means that equality holds for all points where both sides are defined.

  3. 3.

    In higher dimensions this equivalence holds only for domains having a sufficiently regular boundary. See, e.g., Grisvard [211].

  4. 4.

    The general case follows by an affine change of variable.

  5. 5.

    Observe that the main terms of p and ω eliminate each other.

  6. 6.

    More precisely, we take the coefficients of x k−2 in p, q and of x k−1 in r.

  7. 7.

    See the definition of multiplicity in the footnote of page p. 193.

  8. 8.

    The integrals of the odd powers of x vanish.

  9. 9.

    We recall that in this chapter the letter I denotes always a compact interval.

  10. 10.

    We use the expressions “almost all” and “almost every” in Lebesgue’s sense. See, e.g., Burkill [69], Halmos [220], Rudin [430], or [285].

  11. 11.

    Fejér used the expression step parabolas to emphasize that their graphs have horizontal tangents at the nodes.

  12. 12.

    We use the relations \(\arccos x_{k} = \frac{2k-1} {2n} \pi\).

  13. 13.

    See, e.g., Laurent [316] for a general exposition.

  14. 14.

    If (a_{ k}) is of order d, then for j > d the binomial coefficients vanish.

  15. 15.

    The result of this exercise is the starting point of the finite element method for the numerical solution of partial differential equations. See, e.g., Ciarlet [107], Raviart–Thomas [405].

Bibliography

  1. J.C. Burkill, The Lebesgue Integral, Cambridge Univ. Press, 1951.

    Google Scholar 

  2. P.G. Ciarlet, The Finite Element Method for Elliptic Problems, North-Holland, Amsterdam, 1978.

    Google Scholar 

  3. P. Grisvard, Elliptic Problems in Nonsmooth Domains, Pitman, Michigan, 1985.

    Google Scholar 

  4. P.R. Halmos, Measure Theory, D. Van Nostrand Co., Inc., Princeton, N.J., 1950.

    Google Scholar 

  5. V. Komornik, Lectures on Functional Analysis and the Lebesgue integral, Springer, Universitext, 2016.

    Google Scholar 

  6. P.-J. Laurent, Approximation et optimisation, Hermann, Paris, 1972.

    Google Scholar 

  7. P.A. Raviart, J.M. Thomas, Introduction à l’analyse numérique des équations aux dérivées partielles, Masson, Paris, 1983.

    Google Scholar 

  8. W. Rudin, Principles of Mathematical Analysis, Third edition, McGraw Hill, New York, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer-Verlag London Ltd.

About this chapter

Cite this chapter

Komornik, V. (2017). Interpolation. In: Topology, Calculus and Approximation. Springer Undergraduate Mathematics Series. Springer, London. https://doi.org/10.1007/978-1-4471-7316-8_8

Download citation

Publish with us

Policies and ethics