A strategy for speeding-up the computation of characteristic sets
In this note a strategy is presented that speeds up the computation of characteristic sets several times in many cases. We test the possibility of success for this strategy in the quasi-sense by 50 examples, where the strategy succeeds in 58 and fails in 23 of the 81 completed cases. The speed-up of the strategy, while successful, ranges from a few to hundred times, whereas in the failure case the computation may be slightly slowed down (not less than 0.6 times).
Unable to display preview. Download preview PDF.
- 3.D. M. Wang: A Generalization of Characteristic Sets Algorithm. RISC-Linz Series no. 89-51.0, Johannes Kepler University, Austria (1989).Google Scholar
- 4.D. M. Wang: Characteristic Sets and Zero Structure of Polynomial Sets. Lecture Notes, RISC-LINZ, Johannes Kepler University, Austria (1989).Google Scholar
- 5.D. M. Wang: An Implementation of the Characteristic Set Method in Maple. RISC-Linz Series no. 91-25.0, Johannes Kepler University, Austria (1991); Proc. DISCO '92 (Bath, England, April 13–15, 1992), to appear.Google Scholar
- 6.D. M. Wang: On Wu's Method for Solving Systems of Algebraic Equations. RISC-Linz Series no. 91-52.0, Johannes Kepler University, Austria (1991).Google Scholar
- 7.W. T. Wu: Basic Principles of Mechanical Theorem Proving in Elementary Geometries. J. Sys. Sci. & Math. Scis. 4, 207–235 (1984); J. Automated Reasoning 2, 221–252 (1986).Google Scholar
- 9.W. T. Wu: A Zero Structure Theorem for Polynomial Equations-Solving. MM Research Preprints No. 1, 2–12, Academia Sinica, China (1987).Google Scholar
- 10.W. T. Wu: Some Remarks on Characteristic-Set Formation. MM Research Preprints No. 3, 27–29, Academia Sinica, China (1989).Google Scholar