54,678 research outputs found
A parallel Heap-Cell Method for Eikonal equations
Numerous applications of Eikonal equations prompted the development of many
efficient numerical algorithms. The Heap-Cell Method (HCM) is a recent serial
two-scale technique that has been shown to have advantages over other serial
state-of-the-art solvers for a wide range of problems. This paper presents a
parallelization of HCM for a shared memory architecture. The numerical
experiments in show that the parallel HCM exhibits good algorithmic
behavior and scales well, resulting in a very fast and practical solver.
We further explore the influence on performance and scaling of data
precision, early termination criteria, and the hardware architecture. A shorter
version of this manuscript (omitting these more detailed tests) has been
submitted to SIAM Journal on Scientific Computing in 2012.Comment: (a minor update to address the reviewers' comments) 31 pages; 15
figures; this is an expanded version of a paper accepted by SIAM Journal on
Scientific Computin
Can local single-pass methods solve any stationary Hamilton-Jacobi-Bellman equation?
The use of local single-pass methods (like, e.g., the Fast Marching method)
has become popular in the solution of some Hamilton-Jacobi equations. The
prototype of these equations is the eikonal equation, for which the methods can
be applied saving CPU time and possibly memory allocation. Then, some natural
questions arise: can local single-pass methods solve any Hamilton-Jacobi
equation? If not, where the limit should be set? This paper tries to answer
these questions. In order to give a complete picture, we present an overview of
some fast methods available in literature and we briefly analyze their main
features. We also introduce some numerical tools and provide several numerical
tests which are intended to exhibit the limitations of the methods. We show
that the construction of a local single-pass method for general Hamilton-Jacobi
equations is very hard, if not impossible. Nevertheless, some special classes
of problems can be actually solved, making local single-pass methods very
useful from the practical point of view.Comment: 19 page
Geodesics in Heat
We introduce the heat method for computing the shortest geodesic distance to
a specified subset (e.g., point or curve) of a given domain. The heat method is
robust, efficient, and simple to implement since it is based on solving a pair
of standard linear elliptic problems. The method represents a significant
breakthrough in the practical computation of distance on a wide variety of
geometric domains, since the resulting linear systems can be prefactored once
and subsequently solved in near-linear time. In practice, distance can be
updated via the heat method an order of magnitude faster than with
state-of-the-art methods while maintaining a comparable level of accuracy. We
provide numerical evidence that the method converges to the exact geodesic
distance in the limit of refinement; we also explore smoothed approximations of
distance suitable for applications where more regularity is required
- …