Bernsteinpolynomials on simplices provide a powerful framework for approximation, geometric modeling, and numerical analysis. A fundamental structural feature of their coefficients is the inclusion–isotone property: under subdivision of the domain ...
Tareq Hamadneh +2 more
doaj +1 more source
Subspace Acceleration for Efficient Nonlinear Water Wave Simulation
We introduce an exponentially weighted subspace acceleration technique to reduce GMRES iterations for solving the Poisson equation with time‐dependent coefficients in nonlinear, dispersive free‐surface flows governed by the incompressible Navier‐Stokes equations. The method significantly reduces memory requirements and computational complexity compared
Rasmus Kleist Hørlyck Sørensen +3 more
wiley +1 more source
Multivariate Bernstein inequalities for entire functions of exponential type in Lp(Rn) $L^{p}(\mathbb{R}^{n})$ (0 Journal of Inequalities and Applications, 2019
In (Rahman and Schmeisser in Trans. Amer. Math. Soc.
Ha Huy Bang, Vu Nhat Huy, Kyung Soo Rim
doaj +1 more source
Sense of Coherence in the Perinatal Period: A Longitudinal Growth Mixture Modeling Analysis
ABSTRACT Objectives Previous studies have established that higher Sense of Coherence (SoC) predicts lower pregnancy‐specific distress, fewer delivery complications, and increased birth satisfaction. However, less is known about how SoC typically changes over pregnancy, birth, and postnatally and the risk factors and protective factors contributing to ...
Kelsey Perrykkad +4 more
wiley +1 more source
Exploring Asymptotic Normality in Multinomial Models
ABSTRACT Among the methods for analyzing categorical outcomes, the multinomial model offers a robust framework for examining the dependence between a multi‐category response variable and a set of explanatory variables. Its flexibility, versatility, and broad applicability across diverse fields make it a valuable tool, as it does not impose strict ...
Célia Nunes +3 more
wiley +1 more source
Boundedness of a Kantorovich type of the Szász-Mirakjan Operator [PDF]
Let Bn f represent the n-th Bernstein polynomial for f for each n ϵ ℕ and f ϵ C ([0, 1]) . Then for any f ϵ C ([0, 1]), the sequence {Bn f} converges uniformly to f.
Neswan Oki +3 more
doaj +1 more source
Generalized Bernstein-Chlodowsky Polynomials
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
Basis Networks: Learning basis functions for free‐form triangulations
Abstract We present a framework for learning compactly supported basis functions that define tangent continuous surfaces based on coarse irregular triangle meshes. The basis functions are represented as MLPs. Smoothness of the basis functions is achieved by using the values of Loop basis functions as the parameterization of the surface.
T. Djuren, M. Alexa
wiley +1 more source
The approximation of localized Bernstein polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linsen Xie, Tingfan Xie
openaire +2 more sources
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
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

