Results 51 to 60 of about 3,011 (212)
Generalized Bernstein-Chlodowsky Polynomials
Rocky Mountain Journal of Mathematics, 1998 For given positive integers \(n\) and \(m\), the generalization of Bernstein-Chlodowsky polynomials is defined by \[ B_{n,m}(f,x)= \Biggl( 1+(m-1) \frac{x}{b_n} \Biggr) \sum_{k=0}^{[n/m]} f\Biggl( \frac{b_nk} {n-(m-1)k}\Biggr) C_{n-(m-1)k}^k \Biggl( \frac{x}{b_n} \Biggr)^k \Biggl(1- \frac{x}{b_n} \Biggr)^{n-mk}, \] where \(b_n\) is a sequence of ...
Gadjiev, A.D. +2 more
openaire +3 more sources
A new family of q-Bernstein polynomials: probabilistic viewpoint
Arab Journal of Basic and Applied SciencesIn this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming [Formula: see text] is a random variable satisfying moment conditions, we use the generating function of ...
Ayse Karagenc +2 more
doaj +1 more source
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Computer Graphics Forum, EarlyView.Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley +1 more source
The approximation of localized Bernstein polynomials
Computers & Mathematics with Applications, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linsen Xie, Tingfan Xie
openaire +2 more sources
Consistency of Approximation of Bernstein Polynomial-Based Direct Methods for Optimal Control
Machines, 2022 Bernstein polynomial approximation of continuous function has a slower rate of convergence compared to other approximation methods. “The fact seems to have precluded any numerical application of Bernstein polynomials from having been made.
Venanzio Cichella +4 more
doaj +1 more source
Parallel Vectors Extraction using Bézier Clipping
Computer Graphics Forum, EarlyView.Abstract In this paper, we propose a novel local feature extraction algorithm for the parallel vectors (PV) operator. Our method is based on Bézier clipping, which is a bracketing‐based root finding method that is commonly‐used in computer‐aided geometric design.
Nico Daßler, Tobias Günther
wiley +1 more source
q-Bernstein polynomials and Bézier curves
, 2003 We define q-Bernstein polynomials, which generalize the classical Bernstein polynomials, and show that the difference of two consecutive q-Bernstein polynomials of a function f can be expressed in terms of second-order divided differences of f.
Oruç, H +4 more
core +1 more source
Goodness‐of‐Fit Tests for Positive Quadrant Dependence
International Statistical Review, EarlyView.Summary When two random variables are positive quadrant dependent (PQD), they are more likely to assume small (or large) values simultaneously compared with when the random variables are independent. This dependence structure is of interest in many areas, including finance, actuarial science and engineering.
Chuan‐Fa Tang, Joshua M. Tebbs
wiley +1 more source
Journal of Applied Mathematics, 2013 Using bosonic -adic -integral on , we give some interesting relationships between -Bernoulli numbers with weight (,) and -Bernstein polynomials with weight .
H. Y. Lee, C. S. Ryoo
doaj +1 more source
Journal of Child Psychology and Psychiatry, EarlyView.Background Support for violent and non‐violent radicalization co‐exists in some, but not all, adolescents. Yet, little is known about how adolescents transition towards or away from violent and/or non‐violent radicalization over time. Within a socio‐ecological framework, this study investigates how Canadian adolescents move from profiles that support ...
Diana Miconi +3 more
wiley +1 more source