2766 search results - page 18 / 554 » Algorithms for trigonometric polynomials |
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
ASCM
2007
Springer
14 years 2 months ago
2007
Springer
Division algorithms for univariate polynomials represented with respect to Lagrange and Bernstein basis are developed. These algore obtained by abstracting from the classical polyn...
GIAE
2004
Springer
14 years 1 months ago
2004
Springer
For a first order autonomous ODE, we give a polynomial time algorithm to decide whether it has a polynomial general solution and to compute one if it exists. Experiments show that...
EMO
2005
Springer
14 years 2 months ago
2005
Springer
We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the...
ORL
2010
13 years 6 months ago
2010
Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial ([3]) removes unnecessary monomials for a...