Results 61 to 70 of about 189,197 (211)
Investigations in the Geometry of Polynomials [PDF]
Because polynomial functions are completely determined by their roots, every property of a polynomial is affected when these roots change. Our research aims to further our understanding of how the distribution of a polynomial\u27s roots affects specjfic ...
Biegalle, Neil
core
t‐Regina: Data‐driven Authoring of Free‐form Registration for Cartoon Character Sprites
Abstract This paper proposes t‐Regina, a novel iterative scheme that automates the manipulation of grid handles in free‐form deformation (FFD) for deformable registrations of cartoon character sprites. First, we build a data‐driven FFD (dFFD) that enables users to handle locations of FFD handles from lower‐dimensional parameters.
Tsukasa Fukusato, Akinobu Maejima
wiley +1 more source
Generalized Bernstein polynomials and total positivity [PDF]
"This thesis submitted for Ph.D. degree deals mainly with geometric properties of generalized Bernstein polynomials which replace the single Bernstein polynomial by a one-parameter family of polynomials.
Oruç, Halil
core +2 more sources
The Truncated q-Bernstein Polynomials in the Case q>1
The truncated q-Bernstein polynomials Bn,m,qf;x, n∈ℕ, and m∈ℕ0 emerge naturally when the q-Bernstein polynomials of functions vanishing in some neighbourhood of 0 are considered.
Mehmet Turan
doaj +1 more source
In this paper, we use Bernstein polynomials to seek the numerical solution of a class of nonlinear variable order fractional differential equation. The fractional derivative is described in the Caputo sense.
Yi-ming Chen +3 more
doaj +1 more source
In this current study, we introduce a new operator called the P-Bernstein operator derived through the utilization of ?P-factorial? (Pell factorial) and ?Pellnomial? (Pell binomial). Subsequently, we investigate the fundamental properties of the P-Bernstein basis polynomials.
openaire +2 more sources
Abstract We present a fast, robust method for continuous collision detection (CCD) directly between pairs of complex signed distance fields (SDFs). By casting CCD as an alternating spatio‐temporal optimization and driving a small set of smartly sampled surface points along SDF tangent spaces, our approach avoids dense sampling or triangle meshes ...
Rasmus Gabelgaard Nielsen, Kenny Erleben
wiley +1 more source
Linearizations of Matrix Polynomials in Bernstein Bases [PDF]
We discuss matrix polynomials expressed in a Bernstein basis, and the associated polynomial eigenvalue problems. Using Mobius transformations of matrix polynomials, large new families of strong linearizations are generated.
Perovic, Vasilije, Mackey, D. Steven
core +2 more sources
Goodness‐of‐Fit Tests for Positive Quadrant Dependence
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
q-Bernstein polynomials and their iterates
\(q\)-Bernstein polynomials have been introduced by \textit{G. M. Phillips} [in Numerical Analysis: A. R. Mitchell 75th Birthday Volume, World Scientific, Singapore, 263--269 (1996)]. For \(q=1\) they reduce to the classical Bernstein polynomials. When \(q\) is in \((0,1)\), the corresponding linear operators are positive; several papers deal with this
openaire +2 more sources

