Sciweavers

2766 search results - page 17 / 554
» Algorithms for trigonometric polynomials
Sort
View
JSC
2007
80views more  JSC 2007»
13 years 8 months ago
Improved dense multivariate polynomial factorization algorithms
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
Grégoire Lecerf
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 8 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
CDC
2010
IEEE
13 years 3 months ago
A "joint+marginal" algorithm for polynomial optimization
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
Jean B. Lasserre, Tung Phan Thanh
MOC
1998
92views more  MOC 1998»
13 years 8 months ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
CORR
2008
Springer
57views Education» more  CORR 2008»
13 years 8 months ago
Fast Conversion Algorithms for Orthogonal Polynomials
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduc...
Alin Bostan, Bruno Salvy, Éric Schost