Abstract. We present a relation between the orthogonality of the constrained Le-gendre polynomials over the triangular domain and the BB (Bézier-Bernstein) coef-ficients of the polynomials using the equivalence of orthogonal complements. Using it we also show that the best constrained degree reduction of polynomials in BB form equals the best approximation of weighted Euclidean norm of coefficients of given polynomial in BB form from the coefficients of polynomials of lower degree in BB form. 1
Problems of the function best approximation in L2 infinity 1 - norm by polynomyals according to GT-s...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
AbstractIn this paper we show that the orthogonal complement of a subspace in the polynomial space o...
AbstractIn the paper [H.S. Kim, Y.J. Ahn, Constrained degree reduction of polynomials in Bernstein–B...
AbstractThe Bernstein form of a polynomial offers valuable insight into its geometrical behavior, an...
AbstractGiven a polynomial p in d variables and of degree n we want to find the best L2-approximatio...
AbstractIn this paper, we develop an analytic solution for the best one-sided approximation of polyn...
In Farouki et al, 2003, Legendre-weighted orthogonal polynomials P n , r ( u , v , w ) , r...
In Farouki et al, 2003, Legendre-weighted orthogonal polynomials P n , r ( u , v , w ) , r...
In this paper, we propose a method to obtain a constrained approximation of a rational Bézier curve...
International audienceWe define sets of orthogonal polynomials satisfying the additional constraint ...
International audienceWe define sets of orthogonal polynomials satisfying the additional constraint ...
AbstractWe prove necessary and sufficient conditions for linear combinations of given functions Kk ϵ...
Copyright c © 2014 Mohammad A. AlQudah. This is an open access article distributed under the Creativ...
Problems of the function best approximation in L2 infinity 1 - norm by polynomyals according to GT-s...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
AbstractIn this paper we show that the orthogonal complement of a subspace in the polynomial space o...
AbstractIn the paper [H.S. Kim, Y.J. Ahn, Constrained degree reduction of polynomials in Bernstein–B...
AbstractThe Bernstein form of a polynomial offers valuable insight into its geometrical behavior, an...
AbstractGiven a polynomial p in d variables and of degree n we want to find the best L2-approximatio...
AbstractIn this paper, we develop an analytic solution for the best one-sided approximation of polyn...
In Farouki et al, 2003, Legendre-weighted orthogonal polynomials P n , r ( u , v , w ) , r...
In Farouki et al, 2003, Legendre-weighted orthogonal polynomials P n , r ( u , v , w ) , r...
In this paper, we propose a method to obtain a constrained approximation of a rational Bézier curve...
International audienceWe define sets of orthogonal polynomials satisfying the additional constraint ...
International audienceWe define sets of orthogonal polynomials satisfying the additional constraint ...
AbstractWe prove necessary and sufficient conditions for linear combinations of given functions Kk ϵ...
Copyright c © 2014 Mohammad A. AlQudah. This is an open access article distributed under the Creativ...
Problems of the function best approximation in L2 infinity 1 - norm by polynomyals according to GT-s...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...