Eikonal Equation
Mostrando 1-5 de 5 artigos, teses e dissertações.
-
1. Asymptotic seismic modeling using finite-differences / Modelamento sismico assintotico utilizando diferenças finitas
Não informado.
Publicado em: 2005
-
2. Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. The scheme relies on an upwind finite difference approximation to the gradient and a resulting causality relationship that lends itself to a Dijkstra-like programming approach. In
The National Academy of Sciences.
-
3. Fast-phase space computation of multiple arrivals
We present a fast, general computational technique for computing the phase-space solution of static Hamilton–Jacobi equations. Starting with the Liouville formulation of the characteristic equations, we derive “Escape Equations” which are static, time-independent Eulerian PDEs. They represent all arrivals to the given boundary from all possible startin
The National Academy of Sciences.
-
4. Computing geodesic paths on manifolds
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. In this paper we extend the Fast Marching Method to triangulated domains with the same computational complexity. As an application, we provide an optimal time algorithm for comput
The National Academy of Sciences.
-
5. A fast marching level set method for monotonically advancing fronts.
A fast marching level set method is presented for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques for computing the position of propagating fronts. They rely on an initial value partial differential equation for a propagating level set function and use techni