Add to ORKGAbstract. The fast sweeping method is an efficient iterative method for hyperbolic problems. It combines Gauss-Seidel iteration with alternating sweeping ordering. In this paper several parallel implementations of the fast sweeping method are presented. These parallel algorithms are simple and efficient due to the causality of the underlying partial different equations. Numerical examples are used to verify our algorithms. AMS subject classifications. 65N06, 65N12, 65N15, 35L60. Keywords. Hamilton-Jacobi equation, Eikonal equation, characteristics, viscosity solution
We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamilt...
This is a library of algorithms for the eikonal equation solution. It includes implementations of pr...
technical reportIn this paper we propose a novel computational technique, which we call the Fast It...
Abstract. A computational study of the fast marching and the fast sweeping methods for the eikonal e...
The main goal of this work is to construct a high-order fast sweeping method for the Eikonal equatio...
We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and o...
We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and t...
AbstractThe fast marching method is widely used to solve the eikonal equation. By introducing a new ...
We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and t...
Fast sweeping methods utilize the Gauss-Seidel iterations and alternating sweeping strat-egy to achi...
Hamilton-Jacobi equations arise in a number of seemingly disparate applications, from front propagat...
High order fast sweeping methods have been developed recently in the literature to solve static Hami...
We propose a simple, fast sweeping method based on the Lax-Friedrichs monotone numerical Hamiltonian...
We present an adaptive domain decomposition strategy to introduce distributed memory parallelism int...
We present a fast sweeping method for a class of Hamilton-Jacobi equations that arise from time-inde...
We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamilt...
This is a library of algorithms for the eikonal equation solution. It includes implementations of pr...
technical reportIn this paper we propose a novel computational technique, which we call the Fast It...
Abstract. A computational study of the fast marching and the fast sweeping methods for the eikonal e...
The main goal of this work is to construct a high-order fast sweeping method for the Eikonal equatio...
We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and o...
We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and t...
AbstractThe fast marching method is widely used to solve the eikonal equation. By introducing a new ...
We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and t...
Fast sweeping methods utilize the Gauss-Seidel iterations and alternating sweeping strat-egy to achi...
Hamilton-Jacobi equations arise in a number of seemingly disparate applications, from front propagat...
High order fast sweeping methods have been developed recently in the literature to solve static Hami...
We propose a simple, fast sweeping method based on the Lax-Friedrichs monotone numerical Hamiltonian...
We present an adaptive domain decomposition strategy to introduce distributed memory parallelism int...
We present a fast sweeping method for a class of Hamilton-Jacobi equations that arise from time-inde...
We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamilt...
This is a library of algorithms for the eikonal equation solution. It includes implementations of pr...
technical reportIn this paper we propose a novel computational technique, which we call the Fast It...