Guaranteed Global Deterministic Optimization and Constraint Programming for Complex Dynamic Problems
| Autor: | Joudrier, Hugo, Hadj-Hamou, Khaled |
|---|---|
| Přispěvatelé: | Joudrier, Hugo, Recherche Opérationnelle pour les Systèmes de Production (G-SCOP_ROSP), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS) |
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: |
Interval Arithmetic
Global Optimization Ordinary Differential Equation [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO] [INFO.INFO-NA] Computer Science [cs]/Numerical Analysis [cs.NA] [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS] [MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS] [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] [INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA] Tube Arithmetic Constraint Programming |
| Zdroj: | 21th International Conference on Principles and Practice of Constraint Programming 21th International Conference on Principles and Practice of Constraint Programming, Aug 2015, Cork, Ireland |
| Popis: | International audience; In this article we focus on particular multi-physics (mechanic, magnetic, electronic...) dynamic problems. These problems contain some differential constraints to model dynamic behaviors. The goal is to be able to solve it with guarantee, meaning to get a proof that all constraints are satisfied (without any approximation caused by binary representations or rounding modes from the unit core computing). The idea of getting guarantees on the arithmetic operations has been introduced via Interval Arithmetic. Computers become faster gradually, increasing the rate of operations number computable in one time unit. The results computed are often rounded to the nearest representable values, then the global errors are increasing gradually as well without any control over it. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|