2766 search results - page 51 / 554 » Algorithms for trigonometric polynomials |
96
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
109
click to vote
TCS
2008
15 years 18 days ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
JC
2007
15 years 18 days ago
2007
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
97
Voted
JMLR
2006
15 years 20 days ago
2006
We describe polynomial
101
Voted
FPL
2010
Springer
14 years 10 months ago
2010
Springer
Abstract--Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computing-oriented FPGAs ...