Automatic generation of numerical redundancies for nonlinear constraint solving

DOI10.1023/A:1009943413814zbMATH Open0889.65052MaRDI QIDQ1371177FDOQ1371177

Authors: Frédéric Benhamou, Laurent Granvilliers 

Publication date: 2 June 1998

Published in: Reliable Computing (Search for Journal in Brave)

Recommendations

• On the combination of interval constraint solvers
• scientific article; zbMATH DE number 2080334
• scientific article; zbMATH DE number 1975612
• Solving numerical constraints
• Algorithmic power from declarative use of redundant constraints

zbMATH Keywords

consistencysymbolic computationinterval algorithmsperformancesredundant constraintredundant polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)

Cited In (8)

• An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems
• Automatic Generation of Optimal Reductions of Distributions
• Title not available (Why is that?)
• Solving interval constraints by linearization in computer-aided design
• Algorithmic power from declarative use of redundant constraints
• Interval constraint propagation with application to bounded-error estimation
• Accelerating filtering techniques for numeric CSPs
• Automatic generation of redundant models for permutation constraint satisfaction problems

This page was built for publication: Automatic generation of numerical redundancies for nonlinear constraint solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371177)