By S. A. Abramov, M. Petkovšek (auth.), Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov (eds.)

This ebook constitutes the refereed complaints of the tenth foreign Workshop on computing device Algebra in clinical Computing, CASC 2007, held in Bonn, Germany, in September 2007. the quantity is devoted to Professor Vladimir P. Gerdt at the celebration of his sixtieth birthday.

The 35 revised complete papers provided have been conscientiously reviewed and chosen from various submissions for inclusion within the booklet. The papers conceal not just quite a few increasing purposes of laptop algebra to medical computing but additionally the pc algebra structures themselves and the CA algorithms. themes addressed are reports in polynomial and matrix algebra, quantifier removing, and Gr?bner bases, in addition to balance research of either differential equations and distinction tools for them. numerous papers are dedicated to the applying of laptop algebra tools and algorithms to the derivation of recent mathematical versions in biology and in mathematical physics.

Show description

Read Online or Download Computer Algebra in Scientific Computing: 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007. Proceedings PDF

Similar algebra books

Structure and Representation of Jordan Algebras

###############################################################################################################################################################################################################################################################

Extra info for Computer Algebra in Scientific Computing: 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007. Proceedings

Sample text

The goal is to reduce the number of expensive operations, such as multiplications or operations involving the long integer arithmetic. To accomplish this goal, we either use the far more efficient machine-type integer operations (assuming the respective values fit within the limits of machine-type integers) or we make use of the specialized and more efficient functions for combined operations like mpz addmul instead of a = a + b · c [7]. Buffered Matrix Transformations. The basic idea of this new technique is to reduce the overhead due to the amount of long integer operations by using machine-type integers to buffer the lattice basis transformations until the limit of the machine-type integer (typically 32 or 64 bit) is reached.

Theorem 2. Let p(x) p(x) = αn xn + αn−1 xn−1 + . . + α0 , (αn > 0) (1) be a polynomial with real coefficients and let d(p) and t(p) denote the degree and the number of its terms, respectively. Moreover, assume that p(x) can be written as p(x) = q1 (x) − q2 (x) + q3 (x) − q4 (x) + . . + q2m−1 (x) − q2m (x) + g(x), (2) where all the polynomials qi (x), i = 1, 2, . . , 2m and g(x) have only positive coefficients. In addition, assume that for i = 1, 2, . . , m we have q2i−1 (x) = c2i−1,1 xe2i−1,1 + .

Acknowledgments We would like to thank Jared Cordasco for his valuable comments that helped us improve this paper. This work was partially supported by the Sun Microsystems Academic Excellence Grant Program. References 1. : Heuristics on Lattice Basis Reduction in Practice. ACM Journal on Experimental Algorithms 7 (2002) 2. : New Attacks on RSA with Small Secret CRTExponents. G. ) PKC 2006. LNCS, vol. 3958, pp. 1–13. Springer, Heidelberg (2006) 3. : A Course in Computational Algebraic Number Theory.

Download PDF sample

Rated 4.61 of 5 – based on 17 votes