Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials

DOI10.1016/j.amc.2015.05.068zbMath1410.65043OpenAlexW659232692MaRDI QIDQ669356

Rachid Ait-Haddou, Ronald N. Goldman

Publication date: 15 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.05.068

zbMATH Keywords

degree reductiondiscrete least squares\((\omega|q)\)-Bernstein bases\(q\)-Bernstein bases\(q\)-Hahn polynomialslittle \(q\)-Legendre polynomials

Mathematics Subject Classification ID

Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.) (33D45) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (5)

Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights ⋮ Constrained multi-degree reduction with respect to Jacobi norms ⋮ \(q\)-blossoming and Hermite-Padé approximants to the \(q\)-exponential function ⋮ Blossoming and Hermite-Padé approximation for hypergeometric series ⋮ Quantum Lorentz degrees of polynomials and a Pólya theorem for polynomials positive on \(q\)-lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A note on iterative process for \(G^{2}\)-multi degree reduction of Bézier curves
• Two essential properties of \((q, h)\)-Bernstein-Bézier curves
• Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints
• Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials
• \(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves
• The geometry of optimal degree reduction of Bézier curves
• Discrete Bernstein bases and Hahn polynomials
• Degree reduction of Bézier curves by \(L^ 1\)-approximation with endpoint interpolation
• Least squares approximation of Bézier coefficients provides best degree reduction in the \(L_2\)-norm
• Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients
• Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
• Generating Functions for the $q$-Bernstein Bases
• Hypergeometric Orthogonal Polynomials and Their q-Analogues
• Distance for Bézier curves and degree reduction
• Formulae relating littleq-Jacobi,q-Hahn andq-Bernstein polynomials: application toq-Bézier curve evaluation
• A survey of results on the q-Bernstein polynomials
• Degree reduction of Bézier curves
• Degree reduction of Bézier curves
• Generalized Bernstein polynomials

This page was built for publication: Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials