Location of Repository

Improving the Efficiency of a Polynomial System Solver Via a Reordering Technique

By D. G. Sotiropoulos, J. A. Nikas and T. N. Grapsa

Abstract

Methods of interval arithmetic can be used to reliably find with certainty all solutions to nonlinear systems of equations. In such methods, the system is transformed into a linear interval system and a preconditioned interval Gauss-Seidel method may then be used to compute such solution bounds. In this work, a new heuristic for solving polynomial systems is presented, called reordering technique. The proposed technique constitutes a preprocessing step to interval Gauss-Seidel method to improve the overall e#ciency of an interval Newton method. The key idea is to exploit some properties of the original polynomial system, expressed by two suitable permutation matrices, by reordering the resulted linearized system. Numerical experiments have been shown that the permuted system can be solved e#ciently when it is combined with an interval Newton method, like Hansen's algorithm

Topics: nonlinear polynomial systems, reordering technique, interval methods, interval Gauss-Seidel
Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.7299
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.upatras.gr/~dg... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.