نتایج جستجو برای: the bernstein polynomials and series
تعداد نتایج: 21176540 فیلتر نتایج به سال:
In many applications of interval computations, it turned out to be beneficial to represent polynomials on a given interval [x, x] as linear combinations of Bernstein polynomials (x − x) · (x − x)n−k. In this paper, we provide a theoretical explanation for this empirical success: namely, we show that under reasonable optimality criteria, Bernstein polynomials can be uniquely determined from the ...
and Applied Analysis 3 see 8 . For 0 ≤ k ≤ n, derivatives of the nth degree modified q-Bernstein polynomials are polynomials of degree n − 1: d dx Bk,n ( x, q ) n ( qBk−1,n−1 ( x, q ) − q1−xBk,n−1 ( x, q )) ln q q − 1 1.9 see 8 . The Bernstein polynomials can also be defined in many different ways. Thus, recently, many applications of these polynomials have been looked for by many authors. In t...
Let Bm(f) be the Bernstein polynomial of degree m. The Generalized Bernstein polynomials
The present paper is about Bernstein-type estimates for Jacobi polynomials and their applications to various branches in mathematics. This is an old topic but we want to add a new wrinkle by establishing some intriguing connections with dispersive estimates for a certain class of Schrödinger equations whose Hamiltonian is given by the generalized Laguerre operator. More precisely, we show that ...
In this paper we propose using planar and spherical Bernstein polynomials over triangular domain for radiative transfer computations. In the planar domain, we propose using piecewise Bernstein basis functions and symmetric Gaussian quadrature formulas over triangular elements for high quality radiosity solution. In the spherical domain, we propose using piecewise Bernstein basis functions over ...
Construction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains
A scheme for constructing orthogonal systems of bivariate polynomials in the Bernstein–Bézier form over triangular domains is formulated. The orthogonal basis functions have a hierarchical ordering by degree, facilitating computation of least-squares approximations of increasing degree (with permanence of coefficients) until the approximation error is subdued below a prescribed tolerance. The o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید