Speeding up Polyhedral Analysis by Identifying Common Constraints
نویسندگان
چکیده
منابع مشابه
Speeding up Polyhedral Analysis by Identifying Common Constraints
Sets of linear inequalities are an expressive reasoning tool for approximating the reachable states of a program. However, the most precise way to join two states is to calculate the convex hull of the two polyhedra that are represented by the inequality sets, an operation that is exponential in the dimension of the polyhedra. We investigate how similarities in the two input polyhedra can be ex...
متن کاملSpeeding up Multibody Analysis by Parallel Computing
The paper describes the application of parallel techniques to a multibody multidisciplinary formulation in order to speed up the solution of complex nonlinear analyses. The problem is stated in terms of a system of nonlinear Differential-Algebraic Equations (DAE). The parallel solution is obtained by means of a coarse-scale substructuring domain decomposition method, which is able to exploit th...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملSpeeding up Static Probabilistic Timing Analysis
Probabilistic Timing Analysis (PTA) has emerged recently to derive trustworthy and tight WCET estimates. Computational costs due to the use of the mathematical operator called convolution used by SPTA – the static variant of PTA – and also deployed in many domains including signal and image processing, jeopardize the scalability of SPTA to real-size programs. We evaluate, qualitatively and quan...
متن کاملSpeeding Up Enumeration Algorithms with Amortized Analysis
In this paper, we characterize a class of fast enumeration algorithms and propose a method for constructing algorithms belonging to the class. The characterization is obtained from a new method of amortized analysis. We propose fast algorithms for enumerating matroid bases, directed spanning trees, and bipartite perfect matchings. These are our results in recent four years. Studies on speeding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2010
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2010.09.011