Equilong invariants and convergence proofs
نویسندگان
چکیده
منابع مشابه
Maximal and Compositional Pattern-Based Loop Invariants Definitions and Proofs
We present a novel approach for the automatic generation of inductive loop invariants over non nested loops manipulating arrays. It is based in the detection of simple but frequent code patterns within loops and on the instantiation of corresponding invariants, which have beeen previously proved as correct. In this technical report we give definitions and some of the proofs associated with the ...
متن کاملTopological Invariants, Mulitvalued Maps and Computer Assisted Proofs in Dynamics
We introduce the concept of inheritable properties of multivalued maps and show how this concept, when combined with interval arithmetic and repre-sentable multivalued approximations, may be used in adapting topological methods to computer assisted proofs in dynamics. As our rst example we propose a simple geometric criterion for chaos. A more sophisticated example is the Conley index theory. W...
متن کاملConvergence Proofs for Numerical Ivp Software
The study of the running times of algorithms in computer science can be broken down into two broad types: worst-case and average-case analyses. For many problems this distinction is very important as the orders of magnitude (in terms of some measure of the problem size) of the running times may diier signiicantly in each case, providing useful information about the merits of the algorithm. Hist...
متن کاملOptimized Overlapping Domain Decomposition: Convergence Proofs
During the last two decades many domain decomposition algorithms have been constructed and lot of techniques have been developed to prove the convergence of the algorithms at the continuous level. Among the techniques used to prove the convergence of classical Schwarz algorithms, the first technique is the maximum principle used by Schwarz. Adopting this technique M. Gander and H. Zhao proved a...
متن کاملSoft Dynamic Programming Algorithms: Convergence Proofs
Algorithms based on dynamic programming (DP) nd optimal solutions to nite-state optimal control tasks by iterating a \backup" operator that only considers the consequences of executing the \best" action in a state. In many problem domains, the optimal solution may be \brittle" and it may be desirable to nd robust, if suboptimal, solutions that prefer states that have many \good" actions to choo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1917
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1917-02954-0