Results 21 to 30 of about 912,120 (337)
Broadband angle of arrival estimation methods in a polynomial matrix decomposition framework [PDF]
, 2013 A large family of broadband angle of arrival estimation algorithms are based on the coherent signal subspace (CSS) method, whereby focussing matrices appropriately align covariance matrices across narrowband frequency bins.
Weiss, Stephan +4 more
core +4 more sources
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 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
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 +3 more sources
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
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
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
Polynomial reconstruction of the matching polynomial
Electronic Journal of Graph Theory and Applications, 2015 The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex-deleted subgraphs of the same graph.
Xueliang Li, Yongtang Shi, Martin Trinks
openaire +5 more sources
Proposal New S-box for AES Algorithm Depend on A.I Bee Colony [PDF]
Engineering and Technology Journal, 2015 The AES algorithm, also called the Rijndael algorithm, is a symmetric block cipher, where the data are encrypted/ decrypted in blocks of 128 bits. Each data block is modified by several rounds of processing, where each round involves four steps.
Alaa Kadhim, Sura Khalaf
doaj +1 more source
SIAM Journal on Optimization, 2019 In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly convex, or equivalently, convex and positive definite.
Amir Ali Ahmadi +2 more
openaire +3 more sources