Displaying similar documents to “Derivation of physically motivated constraints for efficient interval simulations applied to the analysis of uncertain dynamical systems”

Uses of new sensitivity and DAE solving methods in SmartMOBILE for verified analysis of mechanical systems

Ekaterina Auer, Wolfram Luther (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

Software for modeling and simulation (MSS) of mechanical systems helps to reduce production costs for industry. Usually, such software relies on (possibly erroneous) finite precision arithmetic and does not take into account uncertainty in the input data. The program SmartMOBILE enhances the existing MSS MOBILE with verified techniques to provide a guarantee that the obtained results are correct and measure the influence of data uncertainty. In this paper, we outline the main features...

Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain

Yves Caseau (2006)

RAIRO - Operations Research

Similarity:

This paper presents the approach that we developed to solve the ROADEF 2003 challenge problem. This work is part of a research program whose aim is to study the benefits and the computer-aided generation of hybrid solutions that mix constraint programming and meta-heuristics, such as large neighborhood search (LNS). This paper focuses on three contributions that were obtained during this project: an improved method for propagating Hamiltonian chain constraints, a fresh look at...

Hybrid approach to design optimisation: preserve accuracy, reduce dimensionality

Mariusz Kamola (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper proposes a design procedure for the creation of a robust and effective hybrid algorithm, tailored to and capable of carrying out a given design optimisation task. In the course of algorithm creation, a small set of simple optimisation methods is chosen, out of which those performing best will constitute the hybrid algorithm. The simplicity of the method allows implementing ad-hoc modifications if unexpected adverse features of the optimisation problem are found. It is postulated...

Interval analysis for certified numerical solution of problems in robotics

Jean-Pierre Merlet (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

Interval analysis is a relatively new mathematical tool that allows one to deal with problems that may have to be solved numerically with a computer. Examples of such problems are system solving and global optimization, but numerous other problems may be addressed as well. This approach has the following general advantages: (a) it allows to find solutions of a problem only within some finite domain which make sense as soon as the unknowns in the problem are physical parameters; (b) numerical...

Molecular Simulation in the Canonical Ensemble and Beyond

Zhidong Jia, Ben Leimkuhler (2007)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this paper, we discuss advanced thermostatting techniques for sampling molecular systems in the canonical ensemble. We first survey work on dynamical thermostatting methods, including the Nosé-Poincaré method, and generalized bath methods which introduce a more complicated extended model to obtain better ergodicity. We describe a general controlled temperature model, () and demonstrate that it flexibly accommodates existing alternative thermostatting methods, such as Nosé-Poincaré,...

Consistency checking within local search applied to the frequency assignment with polarization problem

Michel Vasquez, Audrey Dupont, Djamal Habet (2003)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We present a hybrid approach for the Frequency Assignment Problem with Polarization. This problem, viewed as Max-CSP, is treated as a sequence of decision problems, CSP like. The proposed approach combines the Arc-Consistency techniques with a performed Tabu Search heuristic. The resulting algorithm gives some high quality solutions and has proved its robustness on instances with approximately a thousand variables and nearly ten thousand constraints.

Periodic coordination in hierarchical air defence systems

Piotr Arabas, Krzysztof Malinowski (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

The subject of this work is the defence planning of a point target against an air attack. The defence system is decomposed into a number of sectors. A direct method of coordination is used at the upper level, while the sectors use a discrete-time event-based model and the description of uncertainty by multiple scenarios of an attack. The resulting problems are solved using linear programming. A comparison of two coordination strategies for realistic attack scenarios and an analysis of...

A novel interval arithmetic approach for solving differential-algebraic equations with VALENCIA-IVP

Andreas Rauh, Michael Brill, Clemens Günther (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

The theoretical background and the implementation of a new interval arithmetic approach for solving sets of differentialalgebraic equations (DAEs) are presented. The proposed approach computes guaranteed enclosures of all reachable states of dynamical systems described by sets of DAEs with uncertainties in both initial conditions and system parameters. The algorithm is based on VALENCIA-IVP, which has been developed recently for the computation of verified enclosures of the solution...