Sciweavers

ISSAC
1998
Springer
106views Mathematics» more  ISSAC 1998»
14 years 3 months ago
Computing Normal Subgroups
This note presents a new algorithm for the computation of the set of normal subgroups of a finite group. It is based on lifting via homomorphic images.
Alexander Hulpke
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
14 years 3 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
ISSAC
1998
Springer
117views Mathematics» more  ISSAC 1998»
14 years 3 months ago
Lightweight Formal Methods for Computer Algebra Systems
In this paper we demonstrate the use of formal methods tools to provide a semantics for the type hierarchy of the AXIOM computer algebra system, and a methodology for Aldor progra...
Martin Dunstan, Tom Kelsey, Steve Linton, Ursula M...
ADG
1998
Springer
127views Mathematics» more  ADG 1998»
14 years 3 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
ADG
1998
Springer
138views Mathematics» more  ADG 1998»
14 years 3 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
ISSAC
1999
Springer
136views Mathematics» more  ISSAC 1999»
14 years 3 months ago
Design and Protocol for Internet Accessible Mathematical Computation
Mathematical computing can become easily accessible and conveniently usable on the Internet. The distributed Internet Accessible Mathematical Computation (IAMC) system can supply ...
Paul S. Wang
ISSAC
1999
Springer
86views Mathematics» more  ISSAC 1999»
14 years 3 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
ISSAC
1999
Springer
116views Mathematics» more  ISSAC 1999»
14 years 3 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