Matrix Interpretations on Polyhedral Domains
نویسنده
چکیده
We refine matrix interpretations for proving termination and complexity bounds of term rewrite systems we restricting them to domains that satisfy a system of linear inequalities. Admissibility of such a restriction is shown by certificates whose validity can be expressed as a constraint program. This refinement is orthogonal to other features of matrix interpretations (complexity bounds, dependency pairs), but can be used to improve complexity bounds, and we discuss its relation with the usable rules criterion. We present an implementation and experiments. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs
منابع مشابه
Extension Of The Alpha Language To Recurrences On Sparse Periodic Domains
Alpha is a functional language based on systems of aane recurrence equations over polyhedral domains. We present an extension of Alpha to deal with sparse polyhedral domains. Such domains are modeled by Z-polyhedra, namely the intersection of lattices and polyhedra. We summarize the mathematical closure properties of Z-polyhedra, and we show how the important features of Alpha, namely normaliza...
متن کاملA two-scale approach for efficient on-the-fly operator assembly in massively parallel high performance multigrid codes
Matrix-free finite element implementations of massively parallel geometric multigrid save memory and are often significantly faster than implementations using classical sparse matrix techniques. They are especially well suited for hierarchical hybrid grids on polyhedral domains. In the case of constant coefficients all fine grid node stencils in the interior of a coarse macro element are equal....
متن کاملPointwise a Posteriori Error Estimates for the Stokes Equations in Polyhedral Domains
Abstract. We derive pointwise a posteriori residual-based error estimates for finite element solutions to the Stokes equations in polyhedral domains. The estimates relies on the regularity of the of Stokes equations and provide an upper bound for the pointwise error in the velocity field on polyhedral domains. Whereas the estimates provide upper bounds for the pointwise error in the gradient of...
متن کاملGround Energy of the Magnetic Laplacian in Polyhedral Bodies
The asymptotic behavior of the first eigenvalues of magnetic Laplacian operators with large magnetic fields in polyhedral domains is characterized by a hierarchy of model problems. We investigate properties of the model problems (continuity, semi-continuity, existence of generalized eigenfunctions). We prove estimates for the remainders of our asymptotic formula. Lower bounds are obtained with ...
متن کاملPolyhedral Object Recognition with Sparse Data - Validation of Interpretations
simple geometric constraints applied to sparse data independently of the coordinate frame of reference, the possibilities can generally be whittled down to just a few, frequently only one, feasible interpretation. This is done without resort to a detailed solution of the surface equations. Nevertheless, in sequential form, the algorithms are not generally fast enough to offer a practical soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015