Numerische Mathematik

, Volume 140, Issue 4, pp 939–962 | Cite as

An iterative approach to barycentric rational Hermite interpolation

  • Emiliano Cirillo
  • Kai HormannEmail author


In this paper we study an iterative approach to the Hermite interpolation problem, which first constructs an interpolant of the function values at \(n+1\) nodes and then successively adds m correction terms to fit the data up to the mth derivatives. In the case of polynomial interpolation, this simply reproduces the classical Hermite interpolant, but the approach is general enough to be used in other settings. In particular, we focus on the family of rational Floater–Hormann interpolants, which are based on blending local polynomial interpolants of degree d with rational blending functions. For this family, the proposed method results in rational Hermite interpolants, which depend linearly on the data, with numerator and denominator of degree at most \((m+1)(n+1)-1\) and \((m+1)(n-d)\), respectively. They converge at the rate of \(O(h^{(m+1)(d+1)})\) as the mesh size h converges to 0. After deriving the barycentric form of these interpolants, we prove the convergence rate for \(m=1\) and \(m=2\), and show that the approximation results compare favourably with other constructions.

Mathematics Subject Classification

65D05 41A05 41A20 41A25 



This work was supported by the Swiss National Science Foundation (SNSF) under Project Number 200021_150053. We thank the anonymous reviewers for their insightful comments, which helped to improve this paper.


  1. 1.
    Berrut, J.P., Floater, M.S., Klein, G.: Convergence rates of derivatives of a family of barycentric rational interpolants. Appl. Numer. Math. 61(9), 989–1000 (2011)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Cirillo, E., Hormann, K., Sidon, J.: Convergence rates of derivatives of Floater–Hormann interpolants for well-spaced nodes. Appl. Numer. Math. 116, 108–118 (2017)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Floater, M.S., Hormann, K.: Barycentric rational interpolation with no poles and high rates of approximation. Numer. Math. 107(2), 315–331 (2007)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Floater, M.S., Schulz, C.: Rational Hermite interpolation without poles, chap. 9, pp. 117–139. In: [12] (2009)Google Scholar
  5. 5.
    Fousse, L., Hanrot, G., Lefèvre, V., Pélissier, P., Zimmermann, P.: MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33(2), Article 13 (2007)CrossRefGoogle Scholar
  6. 6.
    Gautschi, W.: Numerical Analysis: An Introduction. Birkhäuser, Boston (1997)zbMATHGoogle Scholar
  7. 7.
    Hormann, K., Schaefer, S.: Pyramid algorithms for barycentric rational interpolation. Comput. Aided Geom. Des. 42, 1–6 (2016)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Jing, K., Kang, N., Zhu, G.: Convergence rates of a family of barycentric osculatory rational interpolation. Appl. Math. Comput. 53(1), 169–181 (2015)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Klein, G., Berrut, J.P.: Linear rational finite differences from derivatives of barycentric rational interpolants. SIAM J. Numer. Anal. 50(2), 643–656 (2012)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Schneider, C., Werner, W.: Some new aspects of rational interpolation. Math. Comput. 47(175), 285–299 (1986)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Schneider, C., Werner, W.: Hermite interpolation: the barycentric approach. Computing 46(1), 35–51 (1991)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Schulz, C.: Topics in curve intersection and barycentric interpolation. Ph.D. thesis, University of Oslo (2009)Google Scholar
  13. 13.
    Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis, Texts in Applied Mathematics, 2nd edn. Springer, New York (1993)CrossRefGoogle Scholar
  14. 14.
    Zhao, Q., Hao, Y., Yin, Z., Zhang, Y.: Best barycentric rational Hermite interpolation. In: Proceedings of the 2010 International Conference on Intelligent System Design and Engineering Application (ISDEA 2010), vol. 1, pp. 417–419. IEEE Computer Society, Los Alamitos (2010)Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Faculty of InformaticsUniversità della Svizzera italianaLuganoSwitzerland

Personalised recommendations