A parallel implementation of the cylindrical algebraic decomposition algorithm

Authors:
B. D. Saunders;H. R. Lee;S. K. Abdali
Affiliations:
Department of Computer & Information Sciences, University of Delaware, Newark, Delaware;Department of Computer & Information Sciences, University of Delaware, Newark, Delaware;Division of Computer & Computation Research, National Science Foundation, Washington, DC
Venue:
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Year:
1989

Citing 7
Cited 6

Cylindrical algebraic decomposition I: the basic algorithm

SIAM Journal on Computing
The complexity of elementary algebra and geometry

Journal of Computer and System Sciences
A cluster-based cylindrical algebraic decomposition algorithm

Journal of Symbolic Computation
On mechanical quantifier elimination for elementary algebra and geometry

Journal of Symbolic Computation
A bibliography of quantifier elimination for real closed fields

Journal of Symbolic Computation
Some algebraic and geometric computations in PSPACE

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Topologically reliable display of algebraic curves

SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques

Progress report on a system for general-purpose parallel symbolic algebraic computation

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Parallel univariate polynomial factorization on shared-memory multiprocessors

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
On the multi-threaded computation of integral polynomial greatest common divisors

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
DSC: a system for distributed symbolic computation

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Approaches to parallel quantifier elimination

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Testing Positiveness of Polynomials

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a parallelization scheme for Collins' cylindrical algebraic decomposition algorithm for quantifier elimination in the theory of real closed fields. We first discuss a parallel implementation of the computer algebra system SAC2 in which a complete sequential implementation of Collins' algorithm already exists. We report some initial results on the speedup obtained, drawing on a suite of examples previously given by Arnon.