Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients (Q285260)

From MaRDI portal





scientific article; zbMATH DE number 6582309
Language Label Description Also known as
default for all languages
No label defined
    English
    Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients
    scientific article; zbMATH DE number 6582309

      Statements

      Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients (English)
      0 references
      0 references
      0 references
      19 May 2016
      0 references
      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.
      0 references
      0 references
      degree reduction
      0 references
      discrete least squares
      0 references
      \(h\)-Bézier curves
      0 references
      discrete orthogonal polynomials
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references