4,371 research outputs found

    Solving composed quantified constraints from discrete-time robust control

    No full text
    International audienceThis paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a (fictitious) constraint logic programming language with explicit quantifier notation. This allows us to clarify the special structure of the problem, and to extend an algorithm for computing approximate solution sets of first-order constraints over the real to exploit this structure. As a result we can deal with inputs that are clearly out of reach for current symbolic solvers

    On the computation of invariant sets for constrained nonlinear systems: An interval arithmetic approach

    Get PDF
    This paper deals with the computation of control invariant sets for constrained nonlinear systems. The proposed approach is based on the computation of an inner approximation of the one step set, that is, the set of states that can be steered to a given target set by an admissible control action. Based on this procedure, control invariant sets can be computed by recursion. We present a method for the computation of the one-step set using interval arithmetic. The proposed specialized branch and bound algorithm provides an inner approximation with a given bound of the error; this makes it possible to achieve a trade off between accuracy of the computed set and computational burden. Furthermore an algorithm to approximate the one step set by an inner bounded polyhedron is also presented; this allows us to relax the complexity of the obtained set, and to make easier the recursion and storage of the sets.Ministerio de Ciencia y TecnologĂ­a DPI2004-07444-c04-01Ministerio de Ciencia y TecnologĂ­a DPI2003-04375-c03-01Ministerio de Ciencia y TecnologĂ­a DPI2003-07146-c02-0

    Immersed Boundary Smooth Extension: A high-order method for solving PDE on arbitrary smooth domains using Fourier spectral methods

    Full text link
    The Immersed Boundary method is a simple, efficient, and robust numerical scheme for solving PDE in general domains, yet it only achieves first-order spatial accuracy near embedded boundaries. In this paper, we introduce a new high-order numerical method which we call the Immersed Boundary Smooth Extension (IBSE) method. The IBSE method achieves high-order accuracy by smoothly extending the unknown solution of the PDE from a given smooth domain to a larger computational domain, enabling the use of simple Cartesian-grid discretizations (e.g. Fourier spectral methods). The method preserves much of the flexibility and robustness of the original IB method. In particular, it requires minimal geometric information to describe the boundary and relies only on convolution with regularized delta-functions to communicate information between the computational grid and the boundary. We present a fast algorithm for solving elliptic equations, which forms the basis for simple, high-order implicit-time methods for parabolic PDE and implicit-explicit methods for related nonlinear PDE. We apply the IBSE method to solve the Poisson, heat, Burgers', and Fitzhugh-Nagumo equations, and demonstrate fourth-order pointwise convergence for Dirichlet problems and third-order pointwise convergence for Neumann problems

    Branch-and-Prune Search Strategies for Numerical Constraint Solving

    Get PDF
    When solving numerical constraints such as nonlinear equations and inequalities, solvers often exploit pruning techniques, which remove redundant value combinations from the domains of variables, at pruning steps. To find the complete solution set, most of these solvers alternate the pruning steps with branching steps, which split each problem into subproblems. This forms the so-called branch-and-prune framework, well known among the approaches for solving numerical constraints. The basic branch-and-prune search strategy that uses domain bisections in place of the branching steps is called the bisection search. In general, the bisection search works well in case (i) the solutions are isolated, but it can be improved further in case (ii) there are continuums of solutions (this often occurs when inequalities are involved). In this paper, we propose a new branch-and-prune search strategy along with several variants, which not only allow yielding better branching decisions in the latter case, but also work as well as the bisection search does in the former case. These new search algorithms enable us to employ various pruning techniques in the construction of inner and outer approximations of the solution set. Our experiments show that these algorithms speed up the solving process often by one order of magnitude or more when solving problems with continuums of solutions, while keeping the same performance as the bisection search when the solutions are isolated.Comment: 43 pages, 11 figure

    Wave Solutions of Evolution Equations and Hamiltonian Flows on Nonlinear Subvarieties of Generalized Jacobians

    Full text link
    The algebraic-geometric approach is extended to study solutions of N-component systems associated with the energy dependent Schrodinger operators having potentials with poles in the spectral parameter, in connection with Hamiltonian flows on nonlinear subvariaties of Jacobi varieties. The systems under study include the shallow water equation and Dym type equation. The classes of solutions are described in terms of theta-functions and their singular limits by using new parameterizations. A qualitative description of real valued solutions is provided
    • …
    corecore