Automatic generation of numerical redundancies for nonlinear constraint solving
type: Item
instance of: scholarly article
title: Automatic generation of numerical redundancies for nonlinear constraint solving
zbMATH Open document ID: 0889.65052
DOI: 10.1023/A:1009943413814
author: Frédéric Benhamou
author: Laurent Granvilliers
published in: Reliable Computing
publication date: 1998-06-02T00:00:00Z
review text: The authors present a framework for cooperation of symbolic and propagation-based numerical solvers over the real numbers. The basic technique used in the paper consists of fixed points theorems for closure operators over a complete lattice of constraint systems. The second part contains a particular cooperation scheme, where propagation is associated to pruning operators implementing interval algorithms enclosing the possible solutions of constraint systems, whereas symbolic methods are mainly devoted to generating redundant constraints. When carefully chosen, it is well known that the addition of redundant constraints drastically improves the performances of systems based on local consistency. The authors propose here a method, which computes sets of redundant polynomials and show on some benchmarks the advantages of such computations.
Mathematics Subject Classification ID: 65G30
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 65H10
zbMATH DE Number: 1080438
zbMATH Keywords: redundant constraint
zbMATH Keywords: redundant polynomials
zbMATH Keywords: symbolic computation
zbMATH Keywords: interval algorithms
zbMATH Keywords: performances
zbMATH Keywords: consistency
reviewed by: Angel B. Dishliev
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1080438