Results 21 to 30 of about 827,412 (357)
Semilocal smoothihg S-splines [PDF]
Компьютерные исследования и моделирование, 2010 Semilocal smoothing splines or S-splines from class C p are considered. These splines consist of polynomials of a degree n, first p + 1 coefficients of each polynomial are determined by values of the previous polynomial and p its derivatives at the point
Dmitrii Alekseevich Silaev
doaj +1 more source
Bounds for the sums of zeros of solutions of $u^{(m)}=P(z)u$ where $P$ is a polynomial
Electronic Journal of Qualitative Theory of Differential Equations, 2011 The main purpose of this paper is to consider the differential equation $u^{(m)}=P(z)u$ $(m\geq 2)$ where $P$ is a polynomial with in general complex coefficients. Let $z_{k}(u),$ $k=1,2,\ldots$ be the zeros of a nonzero solution $u$ to that equation. We
Ting-Bin Cao, Kai Liu, Hong-Yan Xu
doaj +1 more source
A two-variable approach to solve the polynomial Lyapunov equation [PDF]
, 2001 A two-variable polynomial approach to solve the one-variable polynomial Lyapunov equation is proposed. Lifting the problem from the one-variable to the two-variable context allows to use Faddeev-type recursions in order to solve the polynomial Lyapunov ...
Peeters, Ralf +4 more
core +1 more source
A new polynomial-time algorithm for linear programming
Symposium on the Theory of Computing, 1984 We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input.
N. Karmarkar
semanticscholar +1 more source
Square-rich fixed point polynomial evaluation on FPGAs [PDF]
, 2014 Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
McLoughlin, Ian V. +5 more
core +1 more source
On Polynomial and Polynomial Matrix Interpolation [PDF]
, 2002 The classical algorithms for computations with polynomials and polynomial matrices use elementary operations with their coefficients. The relative accuracy of such algorithms is relatively small and for polynomials of higher order and polynomial matrices of higher dimension the executing time grows very quickly.
Petr Husek, Renata Pytelková
openaire +1 more source
Note on the smallest root of the independence polynomial [PDF]
, 2013 One can define the independence polynomial of a graph G as follows. Let i(k)(G) denote the number of independent sets of size k of G, where i(0)(G) = 1. Then the independence polynomial of G is I(G,x) = Sigma(n)(k=0)(-1)(k)i(k)(G)x(k).
Csíkvári, Péter
core +1 more source
Mathematics, 2019 In this paper, new refinements and improvements of Jordan’s and Kober’s inequalities are presented. We give new polynomial bounds for the s i n c ( x ) and cos ( x ) functions based on the interpolation and approximation ...
Lina Zhang, Xuesi Ma
doaj +1 more source
Polynomial asymptotic stability of damped stochastic differential equations. [PDF]
, 2004 The paper studies the polynomial convergence of solutions of a scalar nonlinear Itˆo stochastic differential equation dX(t) = −f(X(t)) dt + (t) dB(t) where it is known, a priori, that limt!1 X(t) = 0, a.s. The intensity of the stochastic perturbation
D. Mackey +3 more
core +1 more source
Computing the set of asymptotic critical values of polynomial mappings from smooth algebraic sets [PDF]
, 2022 Let $\mathbf{f} = (f_1, \dots, f_p) \in \mathbb{Q}[z_1, \dots, z_n]$ be a polynomial tuple. Define the polynomial mapping $\mathbf{f}: X \to \mathbb{C}^p$, where $X$ is a smooth algebraic set defined by the simultaneous vanishing of the reduced regular ...
Safey El Din, Mohab +2 more
core +2 more sources