A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
type: Item
instance of: scholarly article
title: A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
zbMATH Open document ID: 1203.65086
author: Alexandre Goldsztejn
author: Laurent Granvilliers
published in: Constraints
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65G30
zbMATH DE Number: 5703902
zbMATH Keywords: interval analysis
zbMATH Keywords: branch and prune algorithm
zbMATH Keywords: preconditioned interval Newton
zbMATH Keywords: global constraint for under-constrained systems of equations
zbMATH Keywords: numerical examples
zbMATH Keywords: CSP
describes a project that uses: RealPaver
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s10601-009-9082-3
OpenAlex ID: W2129041497
cites work: Applying interval arithmetic to real, integer, and boolean constraints
cites work: Q4251330
cites work: Q4949361
cites work: A right-preconditioning process for the formal-algebraic approach to inner and outer estimation of AE-solution sets.
cites work: Algorithm 852
cites work: Q2713275
cites work: An Interval Step Control for Continuation Methods
cites work: Parallel robots
cites work: Q5566070
cites work: Testing Unconstrained Optimization Software
cites work: Validated solutions of initial value problems for ordinary differential equations
cites work: Overestimation in Linear Interval Equations
cites work: Interval Methods for Systems of Equations
cites work: Iterative Solution of Nonlinear Equations in Several Variables
cites work: Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations
cites work: Solving Polynomial Systems Using a Branch and Prune Approach
DOI: 10.1007/S10601-009-9082-3
description: scientific article; zbMATH DE number 5703902