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 $R^3$ 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

Causal Domain Restriction for Eikonal Equations

Many applications require efficient methods for solving continuous shortest path problems. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations. Several fast numerical algorithms have been developed to solve such equations on the whole domain. In this paper we consider a somewhat different problem, where the solution is needed at one specific point, so we restrict the computations to a neighborhood of the characteristic. We explain how heuristic under/over-estimate functions can be used to obtain a causal domain restriction, significantly decreasing the computational work without sacrificing convergence under mesh refinement. The discussed techniques are inspired by an alternative version of the classical A* algorithm on graphs. We illustrate the advantages of our approach on continuous isotropic examples in 2D and 3D. We compare its efficiency and accuracy to previous domain restriction techniques. We also analyze the behavior of errors under the grid refinement and show how Lagrangian (Pontryagin's Maximum Principle-based) computations can be used to enhance our method.Comment: 27 pages; 17 figures; accepted for publication in SIAM J. on Sci. Comp; (a minor update to address the reviewers' comments

Composition Operators on the Dirichlet Space and Related Problems

In this paper we investigate the following problem: when a bounded analytic function $\phi$ on the unit disk $\mathbb{D}$, fixing 0, is such that $\{\phi^n : n = 0, 1, 2, . . . \}$ is orthogonal in $\mathbb{D}$?, and consider the problem of characterizing the univalent, full self-maps of $\mathbb{D}$ in terms of the norm of the composition operator induced. The first problem is analogous to a celebrated question asked by W. Rudin on the Hardy space setting that was answered recently ([3] and [15]). The second problem is analogous to a problem investigated by J. Shapiro in [14] about characterization of inner functions in the setting of $H^2$.Comment: 8 pages, 1 figure. See also http://webdelprofesor.ula.ve/nucleotachira/gchacon or http://webdelprofesor.ula.ve/humanidades/grchaco