Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials
DOI10.1016/J.AMC.2015.05.068zbMATH Open1410.65043OpenAlexW659232692MaRDI QIDQ669356FDOQ669356
Authors: Rachid Ait-Haddou, Ron 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
Recommendations
- Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients
- Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights
- Least squares approximation of Bézier coefficients provides best degree reduction in the \(L_2\)-norm
- Perturbing Béziercoefficients for best constrained degree reduction in the L2-norm
- Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients
degree reductiondiscrete least squares\((\omega|q)\)-Bernstein bases\(q\)-Bernstein bases\(q\)-Hahn polynomialslittle \(q\)-Legendre polynomials
Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.) (33D45) Computer-aided design (modeling of curves and surfaces) (65D17)
Cites Work
- Hypergeometric orthogonal polynomials and their \(q\)-analogues. With a foreword by Tom H. Koornwinder
- Title not available (Why is that?)
- A note on iterative process for \(G^2\)-multi degree reduction of Bézier curves
- A survey of results on the \(q\)-Bernstein polynomials
- The geometry of optimal degree reduction of Bézier curves
- Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials
- 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
- 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
- Distance for Bézier curves and degree reduction
- Two essential properties of \((q, h)\)-Bernstein-Bézier curves
- Title not available (Why is that?)
- Degree reduction of Bézier curves
- Degree reduction of Bézier curves
- Generalized Bernstein polynomials
- Title not available (Why is that?)
- \(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves
- Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints
- Generating Functions for the $q$-Bernstein Bases
- Formulae relating littleq-Jacobi,q-Hahn andq-Bernstein polynomials: application toq-Bézier curve evaluation
Cited In (5)
- Blossoming and Hermite-Padé approximation for hypergeometric series
- Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights
- Quantum Lorentz degrees of polynomials and a Pólya theorem for polynomials positive on \(q\)-lattices
- \(q\)-blossoming and Hermite-Padé approximants to the \(q\)-exponential function
- Constrained multi-degree reduction with respect to Jacobi norms
This page was built for publication: Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669356)
