Automatic generation of numerical redundancies for nonlinear constraint solving
From MaRDI portal
Publication:1371177
DOI10.1023/A:1009943413814zbMath0889.65052MaRDI QIDQ1371177
Laurent Granvilliers, Frédéric Benhamou
Publication date: 2 June 1998
Published in: Reliable Computing (Search for Journal in Brave)
consistencysymbolic computationredundant constraintperformancesinterval algorithmsredundant polynomials
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)
Related Items (4)
Solving interval constraints by linearization in computer-aided design ⋮ Interval constraint propagation with application to bounded-error estimation ⋮ An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems ⋮ Accelerating filtering techniques for numeric CSPs
This page was built for publication: Automatic generation of numerical redundancies for nonlinear constraint solving
