Pyramid algorithms for barycentric rational interpolation Academic Article

abstract

• 2015 Elsevier B.V. All rights reserved. We present a new perspective on the Floater-Hormann interpolant. This interpolant is rational of degree (n,d), reproduces polynomials of degree d, and has no real poles. By casting the evaluation of this interpolant as a pyramid algorithm, we first demonstrate a close relation to Neville's algorithm. We then derive an O(nd) algorithm for computing the barycentric weights of the Floater-Hormann interpolant, which improves upon the original O(nd2) construction.

authors

• Schaefer, Scott

published proceedings

• Computer Aided Geometric Design

author list (cited authors)

• Hormann, K., & Schaefer, S.

citation count

• 6

complete list of authors

• Hormann, Kai||Schaefer, Scott

publication date

• February 2016

publisher

• Elsevier  Publisher

published in

• Computer Aided Geometric Design  Journal

Digital Object Identifier (DOI)

• 10.1016/j.cagd.2015.12.004

start page

• 1

end page

• 6

volume

• 42

URL

• http://dx.doi.org/10.1016/j.cagd.2015.12.004