Abstract
The problem of polynomial interpolation with the Lagrange-type data when using the Bernstein basis instead of the monomial basis is addressed. The extension to the bivariate case, which leads to the use of a generalized Kronecker product, is also developed. In addition to the matricial description of the solution and the proof of unisolvence, algorithms for the computation of the coefficients of the interpolating polynomial are presented. Numerical experiments illustrating the advantage of computing with Bernstein-Vandermonde matrices instead of with Vandermonde matrices are included.
Similar content being viewed by others
References
Berrut, J.P., Trefethen, L.N.: Barycentric Lagrange interpolation. SIAM Rev. 46, 501–517 (2004)
Caliari, M., De Marchi, S., Vianello, M.: Algorithm 886: Padua2D-Lagrange interpolation at Padua points on bivariate domains. ACM Trans. Math. Softw. 35, Article 21 (2008)
Caliari, M., De Marchi, S., Sommariva, A., Vianello, M.: Padua2DM: fast interpolation and cubature at the Padua points in Matlab/Octave. Numer. Algor. 56, 45–60 (2011)
Corless, R.M., Fillion, N.: A graduate introduction to numerical methods: from the viewpoint of backward error analysis. Springer-Verlag (2013)
Corless, R.M., Watt, S.M.: Bernstein basis are optimal, but, sometimes, Lagrange basis are better. In: Proceedings of the 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp 141–153. Timisoara (2004)
Delgado, J., Peña, J. M.: Optimal conditioning of Bernstein collocation matrices. SIAM J. Matrix Anal. Appl. 31, 990–996 (2009)
Delgado, J., Peña, J. M.: Algorithm 960: POLYNOMIAL: An object-oriented Matlab library of fast and efficicent algorithms for polynomials. ACM Trans. Math. Softw. 42, Article 23 (2016)
Demmel, J., Koev, P.: The accurate and efficient solution of a totally positive generalized Vandermonde linear system. SIAM J. Matrix Anal. Appl. 27, 142–152 (2005)
Farouki, R.T.: On the stability of transformations between power and Bernstein polynomial forms. Comput. Aided Geom. Des. 8, 29–36 (1991)
Farouki, R.T.: The Bernstein polynomial basis: a centennial retrospective. Comput. Aided Geom. Des. 29, 379–419 (2012)
Farouki, R.T., Goodman, T.N.T.: On the optimal stability of the Bernstein basis. Math. Comp. 65, 1553–1566 (1996)
Farouki, R.T., Rajan, V.T.: On the numerical condition of polynomials of Bernstein form. Comput. Aided Geom. Des. 4, 191–216 (1987)
Farouki, R.T., Rajan, V.T.: Algorithms for polynomials in Bernstein form. Comput. Aided Geom. Des. 5, 1–26 (1988)
Gasca, M., Martínez J.-J.: On the solvability of bivariate Hermite-Birkhoff interpolation problems. J. Comput. Appl. Math. 32, 77–82 (1990)
Gasca, M., Sauer, T.: Polynomial interpolation in several variables. Adv. Comput. Math. 12, 377–410 (2000)
Higham, N.J.: The numerical stability of barycentric Lagrange interpolation. IMA J. Numer. Anal. 24, 547–556 (2004)
Koev, P.: http://www.math.sjsu.edu/~koev
Koev, P.: Accurate computations with totally nonnegative matrices. SIAM J. Matrix Anal. Appl. 29, 731–751 (2007)
Liesen, J., Mehrmann, V.: Linear Algebra, Springer Undergraduate Mathematics Series. Springer (2015)
Marco, A., Martínez, J.-J.: A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems. Linear Algebra Appl. 422, 616–628 (2007)
Marco, A., Martínez, J.-J.: Bernstein-Bezoutian matrices and curve implicitization. Theor. Comput. Sci. 377, 65–72 (2007)
Marco, A., Martínez, J.-J.: Unique solvability in bivariate Hermite interpolation. Electron. Trans. Numer. Anal. 34, 20–30 (2008/09)
Marco, A., Martínez, J.-J.: Polynomial least squares fitting in the Bernstein basis. Linear Algebra Appl. 433, 1254–1264 (2010)
Marco, A., Martínez J.-J.: Accurate computations with totally positive Bernstein-Vandermonde matrices. Electron. J. Linear Algebra 26, 357–380 (2013)
Martínez, J.-J.: A generalized Kronecker product and linear systems. Int. J. Math. Educ. Sci. Technol. 30, 137–141 (1999)
Trefethen, L.N., Bau, D. III: Numerical Linear Algebra. SIAM (1997)
Trefethen, L.N.: Approximation Theory and Approximation Practice. SIAM (2013)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Mariano Gasca and Günter Mühlbach
This research has been partially supported by the Spanish Research Grant MTM2015-65433-P (MINECO/FEDER) from the Spanish Ministerio de Economía y Competitividad.
Rights and permissions
About this article
Cite this article
Marco, A., Martínez, JJ. & Viana, R. Accurate polynomial interpolation by using the Bernstein basis. Numer Algor 75, 655–674 (2017). https://doi.org/10.1007/s11075-016-0215-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-016-0215-7
Keywords
- Interpolation
- Bernstein-Vandermonde matrix
- Totally positive matrix
- Generalized Kronecker product
- Padua points