Sciweavers

ISSAC
1998
Springer
111views Mathematics» more  ISSAC 1998»
13 years 11 months ago
A Subresultant Theory for Ore Polynomials with Applications
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
Ziming Li
ISSAC
1998
Springer
88views Mathematics» more  ISSAC 1998»
13 years 11 months ago
Multidimensional Chains of Recurrences
A technique to expedite iterative computations which is based on multidimensional chains of recurrences MCR is presented. Algorithms for MCR construction, interpretation and MCR-b...
V. Kislenkov, V. Mitrofanov, Eugene V. Zima
ISSAC
1998
Springer
106views Mathematics» more  ISSAC 1998»
13 years 11 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»
13 years 11 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»
13 years 11 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...