Asymptotic convergence of degree-raising

DOI10.1023/A:1018913118047zbMath0953.41004OpenAlexW2155039215MaRDI QIDQ1968626

Michael S. Floater, Tom Lyche

Publication date: 21 March 2000

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018913118047

zbMATH Keywords

Bernstein polynomialscontrol polygondegree-raisingVoronovskaya estimates

Mathematics Subject Classification ID

Numerical interpolation (65D05) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (7)

Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights ⋮ Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients ⋮ Approximate implicitization using linear algebra ⋮ Interpolation and convergence of Bernstein-Bézier coefficients ⋮ On the degree elevation of Bernstein polynomial representation ⋮ On the smooth convergence of subdivision and degree elevation for Bézier curves ⋮ \(q\)-Bernstein polynomials and Bézier curves

This page was built for publication: Asymptotic convergence of degree-raising