On considering an interval constraint solving algorithm as a free-steering nonlinear Gauss-Seidel procedure

Authors:
Frédéric Goualard
Affiliations:
Laboratoire d'Informatique de Nantes-Atlantique, FRE CNRS, Nantes Cedex
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 3
Cited 2

Algorithm 681: INTBIS, a portable interval Newton/bisection package

ACM Transactions on Mathematical Software (TOMS)
CLP(intervals) revisited

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Iterative solution of nonlinear equations in several variables

Iterative solution of nonlinear equations in several variables

A Reinforcement Learning Approach to Interval Constraint Propagation

Constraints
On the selection of a transversal to solve nonlinear systems with interval arithmetic

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a classical interval constraint propagation algorithm enforcing box consistency may be interpreted as a free-steering nonlinear Gauss-Seidel procedure. This suggests that the choice of a transversal in the incidence matrix associated with the problem to solve is paramount to the efficiency of the algorithm. We present experimental evidences that it is indeed so, and we suggest an heuristics to compute good transversals. The improved interval constraint algorithm is compared with a classical one and with standard methods such as Hansen-Sengupta on some well-known benchmarks.