Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials
type: Item
instance of: scholarly article
title: Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials
zbMATH Open document ID: 1410.65043
author: Rachid Ait-Haddou
author: Ron Goldman
published in: Applied Mathematics and Computation
publication date: 2019-03-15T00:00:00Z
Mathematics Subject Classification ID: 65D17
Mathematics Subject Classification ID: 33D45
zbMATH DE Number: 7036705
zbMATH Keywords: degree reduction
zbMATH Keywords: \(q\)-Bernstein bases
zbMATH Keywords: \((\omega|q)\)-Bernstein bases
zbMATH Keywords: discrete least squares
zbMATH Keywords: little \(q\)-Legendre polynomials
zbMATH Keywords: \(q\)-Hahn polynomials
MaRDI profile type: Publication
full work available at URL: j.amc.2015.05.068
OpenAlex ID: W659232692
cites work: Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
cites work: Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients
cites work: Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights
cites work: Q4159122
cites work: Formulae relating littleq-Jacobi,q-Hahn andq-Bernstein polynomials: application toq-Bézier curve evaluation
cites work: The geometry of optimal degree reduction of Bézier curves
cites work: Q5543516
cites work: Degree reduction of Bézier curves
cites work: Q4040884
cites work: Two essential properties of \((q, h)\)-Bernstein-Bézier curves
cites work: Generating Functions for the $q$-Bernstein Bases
cites work: Degree reduction of Bézier curves by \(L^ 1\)-approximation with endpoint interpolation
cites work: Hypergeometric Orthogonal Polynomials and Their q-Analogues
cites work: Distance for Bézier curves and degree reduction
cites work: Generalized Bernstein polynomials
cites work: Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints
cites work: A note on iterative process for \(G^2\)-multi degree reduction of Bézier curves
cites work: Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients
cites work: Least squares approximation of Bézier coefficients provides best degree reduction in the \(L_2\)-norm
cites work: A survey of results on the q-Bernstein polynomials
cites work: Discrete Bernstein bases and Hahn polynomials
cites work: \(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves
cites work: Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials
DOI: 10.1016/J.AMC.2015.05.068
description: scientific article; zbMATH DE number 7036705