Polynomial degree reduction in the discrete L₂-norm equals best Euclidean approximation of h-Bézier coefficients
Polynomial degree reduction in the discrete \(L 2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients
Considering the classical \(L_2\)-inner product and the Euclidean inner product of the Bézier coefficients on the linear space \(\mathbb P_n\) of polynomials of degree at most \(n\), \textit{D. Lutterkort} et al. [Comput. Aided Geom. Des. 16, No. 7, 607--612 (1999; Zbl 0993.41016)] proved that the best degree reduction of a given polynomial \(P\) from degree \(n\) to \(m\) with respect to the norms induced by the two inner products are equivalent (cf. [\textit{Y. J. Ahn} et al., Comput. Aided Geom. Des. 21, No. 2, 181--191 (2004; Zbl 1069.41504)]). Introducing a sample parameter \(h\), the author provides a discrete analogue to the foregoing result. As \(h\) tends to zero, the above result of Lutterkort et al. [loc. cit.] is recovered. Adequacy of using the \(h\)-Bernstein bases to approach the problem of polynomial degree reduction with respect to weighted discrete norms is also highlighted.
- Polynomial degree reduction in the L₂-norm equals best Euclidean approximation of Bézier coefficients
- Constrained multi-degree reduction with respect to Jacobi norms
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights
- A note on the paper ``Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients.
- \(h\)-blossoming: A new approach to algorithms and identities for \(h\)-Bernstein bases and \(h\)-Bézier curves
- A Müntz type theorem for a family of corner cutting schemes
- Asymptotic convergence of degree-raising
- Chebyshev blossoming in Müntz spaces: toward shaping with Young diagrams
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Degree reduction of Bézier curves
- Degree reduction of Bézier curves
- Degree reduction of Bézier curves by \(L^ 1\)-approximation with endpoint interpolation
- Discrete (Legendre) orthogonal polynomials-a survey
- Discrete Bernstein bases and Hahn polynomials
- Distance for Bézier curves and degree reduction
- Explicit Formula Relating the Jacobi, Hahn and Bernstein Polynomials
- Gelfond-Bézier curves
- scientific article; zbMATH DE number 491264 (Why is no real title available?)
- Least squares approximation of Bézier coefficients provides best degree reduction in the \(L_2\)-norm
- Legendre-Bernstein basis transformations
- Polynomial degree reduction in the L₂-norm equals best Euclidean approximation of Bézier coefficients
- The geometry of optimal degree reduction of Bézier curves
- Two essential properties of \((q, h)\)-Bernstein-Bézier curves
- Least squares approximation of Bézier coefficients provides best degree reduction in the \(L_2\)-norm
- Polynomial degree reduction in the L₂-norm equals best Euclidean approximation of Bézier coefficients
- Constrained multi-degree reduction with respect to Jacobi norms
- Polynomial degree reduction in the \(\mathcal{L}^2\)-norm on a symmetric interval for the canonical basis
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- A note on the paper ``Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients.
- Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights
- Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials
This page was built for publication: Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285260)
