Precise numerical computation
نویسندگان
چکیده
منابع مشابه
Precise numerical computation
Arithmetic systems such as those based on IEEE standards currently make no attempt to track the propagation of errors. However a formal error analysis can be complicated and is often confined to the realm of experts in numerical analysis. In recent years there has been a resurgence in interest in automated methods for accurately tracking the propagation of errors. In this article we will descri...
متن کاملSound Bit-Precise Numerical Domains
This paper tackles the challenge of creating a numerical abstract domain that can identify affine-inequality invariants while handling overflow in arithmetic operations over bit-vector data-types. The paper describes the design and implementation of a class of new abstract domains, called the Bit-Vector-Sound, Finite-Disjunctive (BVSFD) domains. We introduce a framework that takes an abstract d...
متن کاملBeyond the thin-wall approximation : precise numerical computation of prefactors in false vacuum decay
Abstract We present a general numerical method for computing precisely the false vacuum decay rate, including the prefactor due to quantum fluctuations about the classical bounce solution, in a selfinteracting scalar field theory modeling the process of nucleation in four dimensional spacetime. This technique does not rely on the thin-wall approximation. The method is based on the GelfandYaglom...
متن کاملPrecise Fixpoint Computation Through Strategy Iteration
We present a practical algorithm for computing least solutions of systems of equations over the integers with addition, multiplication with positive constants, maximum and minimum. The algorithm is based on strategy iteration. Its run-time (w.r.t. the uniform cost measure) is independent of the sizes of occurring numbers. We apply our technique to solve systems of interval equations. In particu...
متن کاملPrecise Hausdorff distance computation between polygonal meshes
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events where the Hausdorff distance may occur, is fully classified. These events include simple cases where foot points of vertices are examined as well as more complicated cases where extreme distance evaluation is needed on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2005
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2004.07.007