Sciweavers

5510 search results - page 211 / 1102
» Mathematics
Sort
View
ISSAC
1999
Springer
116views Mathematics» more  ISSAC 1999»
15 years 8 months ago
On the Genericity of the Modular Polynomial GCD Algorithm
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
Erich Kaltofen, Michael B. Monagan
ISSAC
1999
Springer
86views Mathematics» more  ISSAC 1999»
15 years 8 months ago
How Fast Can We Compute Products?
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
V. Kislenkov, V. Mitrofanov, Eugene V. Zima
ADG
1998
Springer
138views Mathematics» more  ADG 1998»
15 years 8 months ago
Automated Geometry Diagram Construction and Engineering Geometry
This paper reviews and evaluates three main techniques for automated geometry diagram construction: synthetic methods, numerical computation methods, and symbolic computation metho...
Xiao-Shan Gao
ADG
1998
Springer
127views Mathematics» more  ADG 1998»
15 years 8 months ago
Decomposing Algebraic Varieties
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
Dongming Wang
ICFEM
1998
Springer
15 years 8 months ago
Defining Differentiation and Integration in Z
We show how familiar mathematical concepts from differential and integral calculus can be represented in the Z specification language. Digital computer systems involve hardware de...
Colin J. Fidge, Ian J. Hayes, Brendan P. Mahony