84 search results - page 3 / 17 » Fast algorithms for polynomial solutions of linear different... |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
FOCS
2002
IEEE
14 years 10 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
CASC
2007
Springer
13 years 11 months ago
2007
Springer
We consider summation of consecutive values (v), (v +1), . . . , (w) of a meromorphic function (z) where v, w ZZ. We assume that (z) satisfies a linear difference equation L(y) = ...
COLT
1999
Springer
13 years 11 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
EUROPAR
2001
Springer
13 years 12 months ago
2001
Springer
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of...