Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials
From MaRDI portal
(Redirected from Publication:669356)
Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials
Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials
Recommendations
- Polynomial degree reduction in the discrete L₂-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₂-norm equals best Euclidean approximation of Bézier coefficients
Cites work
- scientific article; zbMATH DE number 194092 (Why is no real title available?)
- scientific article; zbMATH DE number 3592088 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- A note on iterative process for \(G^2\)-multi degree reduction of Bézier curves
- A survey of results on the \(q\)-Bernstein polynomials
- 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
- 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 Bernstein bases and Hahn polynomials
- Distance for Bézier curves and degree reduction
- Formulae relating littleq-Jacobi,q-Hahn andq-Bernstein polynomials: application toq-Bézier curve evaluation
- Generalized Bernstein polynomials
- Generating functions for the \(q\)-Bernstein bases
- Hypergeometric orthogonal polynomials and their \(q\)-analogues. With a foreword by Tom H. Koornwinder
- Least squares approximation of Bézier coefficients provides best degree reduction in the \(L_2\)-norm
- Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials
- Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints
- Polynomial degree reduction in the L₂-norm equals best Euclidean approximation of Bézier coefficients
- Polynomial degree reduction in the discrete L₂-norm equals best Euclidean approximation of h-Bézier coefficients
- The geometry of optimal degree reduction of Bézier curves
- Two essential properties of \((q, h)\)-Bernstein-Bézier curves
- \(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves
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)