2766 search results - page 51 / 554 » Algorithms for trigonometric polynomials |
119
Voted
CORR
2006
Springer
15 years 3 months 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...
132
Voted
TCS
2008
15 years 3 months 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 ...
113
Voted
JC
2007
15 years 3 months 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...
122
Voted
JMLR
2006
15 years 3 months ago
2006
We describe polynomial
124
click to vote
FPL
2010
Springer
15 years 1 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 ...