Results 21 to 30 of about 43,913 (238)
Division algorithms for Bernstein polynomials [PDF]
Computer Aided Geometric Design, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Busé, Laurent, Goldman, Ron
openaire +1 more source
An approximation method for numerical solution of multi-dimensional feedback delay fractional optimal control problems by Bernstein polynomials [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2014 In this paper we present a new method for solving fractional optimal control problems with delays in state and control. This method is based upon Bernstein polynomial basis and using feedback control.
Elahe Safaie, Mohammadhadi Farahi
doaj +1 more source
An Enhanced Adaptive Bernstein Collocation Method for Solving Systems of ODEs
Mathematics, 2021 In this paper, we introduce two new methods to solve systems of ordinary differential equations. The first method is constituted of the generalized Bernstein functions, which are obtained by Bernstein polynomials, and operational matrix of ...
Ahmad Sami Bataineh +3 more
doaj +1 more source
Mathematics, 2019 In this paper, the change of bases transformations between the Bernstein polynomial basis and the Chebyshev polynomial basis of the fourth kind are studied and the matrices of transformation among these bases are constructed. Some examples are given.
Abedallah Rababah, Esraa Hijazi
doaj +1 more source
Point-wise estimates for the derivative of algebraic polynomials
Математичні Студії, 2021 We give a sufficient condition on coefficients $a_k$ of an algebraic polynomial $P(z)=\sum\limits_{k=0}^{n}a_kz^k$, $a_n\not=0,$ such that the pointwise Bernstein inequality $|P'(z)|\le n|P(z)|$ is true for all $z,\ |z|\le 1$.
A. V. Savchuk
doaj +1 more source
$D$-modules, Bernstein-Sato polynomials and $F$-invariants of direct summands [PDF]
, 2016 We study the structure of $D$-modules over a ring $R$ which is a direct summand of a polynomial or a power series ring $S$ with coefficients over a field. We relate properties of $D$-modules over $R$ to $D$-modules over $S$. We show that the localization
Huneke, Craig +2 more
core +3 more sources
Linear Optimization of Polynomial Rational Functions: Applications for Positivity Analysis
Mathematics, 2020 In this paper, we provide tight linear lower bounding functions for multivariate polynomials given over boxes. These functions are obtained by the expansion of polynomials into Bernstein basis and using the linear least squares function.
Tareq Hamadneh +2 more
doaj +1 more source
The Monodromy Conjecture for hyperplane arrangements [PDF]
, 2009 The Monodromy Conjecture asserts that if c is a pole of the local topological zeta function of a hypersurface, then exp(2\pi i c) is an eigenvalue of the monodromy on the cohomology of the Milnor fiber.
Budur, Nero +2 more
core +5 more sources
Sparse polynomial interpolation with Bernstein polynomials
TURKISH JOURNAL OF MATHEMATICS, 2021 Summary: We present an algorithm for interpolating an unknown univariate polynomial \(f\) that has a \(t\) sparse representation (\(t\ll\deg(f)\)) using Bernstein polynomials as term basis from \(2t\) evaluations. Our method is based on manipulating given black box polynomial for \(f\) so that we can make use of Prony's algorithm.
openaire +4 more sources
The Bernstein-Sato b-Function of the Space of Cyclic Pairs [PDF]
, 2015 We compute the Bernstein-Sato polynomial of $f$, a function which given a pair $(M,v)$ in $X = M_n(\mathbf{C}) \times \mathbf{C}^n$ tests whether $v$ is a cyclic vector for $M$.
Walters, Robin
core +1 more source