Sciweavers

2766 search results - page 48 / 554
» Algorithms for trigonometric polynomials
Sort
View

Presentation
439views
13 years 6 months ago
Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Al...
89
Voted
ISSAC
2007
Springer
93views Mathematics» more  ISSAC 2007»
15 years 6 months ago
Approximate bivariate factorization: a geometric viewpoint
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in   [x, y]. Given a composite polyno...
André Galligo, Mark van Hoeij
CORR
2010
Springer
118views Education» more  CORR 2010»
15 years 23 days ago
alphaCertified: certifying solutions to polynomial systems
Smale's -theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to ...
Jonathan D. Hauenstein, Frank Sottile
111
Voted
ANTS
2008
Springer
110views Algorithms» more  ANTS 2008»
15 years 2 months ago
Computing Hilbert Class Polynomials
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
Juliana Belding, Reinier Bröker, Andreas Enge...
65
Voted
STOC
1999
ACM
75views Algorithms» more  STOC 1999»
15 years 5 months ago
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes
Samuel R. Buss, Dima Grigoriev, Russell Impagliazz...