Results 91 to 100 of about 564,269 (235)

From Lagrange to Bernstein: Generalized Transfinite Elements with Arbitrary Nodes

Mathematics
This paper presents a unified framework for constructing transfinite finite elements with arbitrary node distributions, using either Lagrange or Bernstein polynomial bases. Three distinct classes of elements are considered.
Christopher Provatidis
doaj   +1 more source

A new approach for solving Bratu’s problem

Demonstratio Mathematica, 2019
A numerical technique for one-dimensional Bratu’s problem is displayed in this work. The technique depends on Bernstein polynomial approximation. Numerical examples are exhibited to verify the efficiency and accuracy of the proposed technique.
Ghomanjani Fateme, Shateyi Stanford
doaj   +1 more source

Bernstein polynomials and Milnor algebras [PDF]

Proceedings of the National Academy of Sciences, 1976
Let f be an analytic germ on C n +1 . Then there is an analytic linear partial differential operator P with polynomial dependence on s , and a polynomial b ( s
openaire   +2 more sources

A semi-parametric model for circular data based on mixtures of beta distributions [PDF]

This paper introduces a new, semi-parametric model for circular data, based on mixtures of shifted, scaled, beta (SSB) densities. This model is more general than the Bernstein polynomial density model which is well known to provide good approximations to
Jose Antonio Carnicero, Michael P. Wiper
core  

Transformation of Chebyshev–Bernstein Polynomial Basis

, 2003
In this paper, we derive a matrix of transformation of Chebyshev polynomials of the first kind into Bernstein polynomials and vice versa. We also study the stability of these linear maps and show that the Chebyshev–Bernstein basis conversion is ...
A. Rababah
semanticscholar   +1 more source

Weighted A-Statistical Convergence for Sequences of Positive Linear Operators

The Scientific World Journal, 2014
We introduce the notion of weighted A-statistical convergence of a sequence, where A represents the nonnegative regular matrix. We also prove the Korovkin approximation theorem by using the notion of weighted A-statistical convergence. Further, we give a
S. A. Mohiuddine, Abdullah Alotaibi, Bipan Hazarika   +2 more
doaj   +1 more source

Rational B\'ezier Curves Approximated by Bernstein-Jacobi Hybrid Polynomial Curves

, 2019
In this paper, we propose a linear method for $C^{(r,s)}$ approximation of rational B\'{e}zier curve with arbitrary degree polynomial curve. Based on weighted least-squares, the problem be converted to an approximation between two polynomial curves. Then
Shi, Mao
core  

q-Bernstein polynomials and Bézier curves

Journal of Computational and Applied Mathematics, 2003
Bézier curve techniques are extended by using a generalization of the Bernstein basis, called the \(q\)-Bernstein basis. A one-parameter family of generalized Bernstein polynomial is defined. It is proved that the approximation to a convex function by its \(q\)-Bernstein polynomials is one sided. It is shown also that the difference of two consecutive \
Oruc, Halil, Phillips, Gm
openaire   +3 more sources

Direct Estimate for Bernstein Polynomials

Journal of Approximation Theory, 1994
The following pointwise approximation for the Bernstein polynomials \(B_ n (f,x)= \sum_{k=0}^ n {\binom nk} x^ k (1-x)^{n -k} f(k/n)\) are proved: \[ | B_ n (f,x)- f(x)|\leq C\omega^ 2_{\varphi^ \lambda} (f, n^{-1/2} \varphi (x)^{1- \lambda}), \qquad 0\leq \lambda\leq 1, \quad \varphi(x)^ 2= x(1-x).
openaire   +1 more source

A Fast Single-Key Two-Level Universal Hash Function

IACR Transactions on Symmetric Cryptology, 2017
Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block is one ...
Debrup Chakraborty, Sebati Ghosh, Palash Sarkar   +2 more
doaj   +1 more source