# A static PDE Approach for MultiDimensional Extrapolation Using Fast Sweeping Methods

@article{Aslam2014ASP,
title={A static PDE Approach for MultiDimensional Extrapolation Using Fast Sweeping Methods},
author={Tariq Dennis Aslam and Songting Luo and Hongkai Zhao},
journal={SIAM J. Sci. Comput.},
year={2014},
volume={36}
}
• Published 10 December 2014
• Economics
• SIAM J. Sci. Comput.
A static partial differential equation (PDE) approach is presented for multidimensional extrapolation under the assumption that a level set function exists which separates the region of known value...

## Figures and Tables from this paper

A high‐order discontinuous Galerkin method for extension problems
• Computer Science, Mathematics
• 2018
A novel discretization using an upwind flux without any additional stabilization leads to a triangular matrix structure, which can be solved using a marching algorithm and high‐order accuracy, even in the presence of singularities.
PDE-Based Multidimensional Extrapolation of Scalar Fields over Interfaces with Kinks and High Curvatures
• Mathematics
SIAM J. Sci. Comput.
• 2020
The proposed approach is based on the extrapolation and weighting of Cartesian derivatives, and second- and third-order accurate extensions in the $L^\infty$ norm are obtained with linear and quadratic extrapolations, respectively, even in the presence of sharp geometric features.
Convergence analysis of the fast sweeping method for static convex Hamilton–Jacobi equations
• Mathematics
• 2016
In this work, we study the convergence of an efficient iterative method, the fast sweeping method (FSM), for numerically solving static convex Hamilton–Jacobi equations. First, we show the
On a marching level‐set method for extended discontinuous Galerkin methods for incompressible two‐phase flows: Application to two‐dimensional settings
• Computer Science
International Journal for Numerical Methods in Engineering
• 2021
In this work a solver for two‐dimensional, instationary two‐phase flows on the basis of the extended discontinuous Galerkin (extended DG/XDG) method is presented. The XDG method adapts the
Ghost Point Diffusion Maps for solving elliptic PDE's on Manifolds with Classical Boundary Conditions
• Mathematics
Communications on Pure and Applied Mathematics
• 2021
The Ghost Point Diffusion Maps (GPDM) estimator is introduced, and the proposed mesh-free PDE solver is validated with supporting numerical examples on various problems, defined on simple manifolds embedded in 2D to 5D Euclidean spaces as well as on an unknown manifold.

## References

SHOWING 1-10 OF 41 REFERENCES
A Fast Sweeping Method for Static Convex Hamilton–Jacobi Equations
• Computer Science
J. Sci. Comput.
• 2007
Numerical examples validate both the accuracy and the efficiency of the new fast sweeping method for static Hamilton–Jacobi equations with convex Hamiltonians.
Fast Sweeping Methods for Static Hamilton-Jacobi Equations
• Computer Science
SIAM J. Numer. Anal.
• 2005
We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula. This formula yields the numerical solution at a grid point using
Ordered upwind methods for static Hamilton–Jacobi equations
• Mathematics
Proceedings of the National Academy of Sciences of the United States of America
• 2001
We introduce a family of fast ordered upwind methods for approximating solutions to a wide class of static Hamilton–Jacobi equations with Dirichlet boundary conditions. Standard techniques often rely
Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms
• Mathematics, Computer Science
SIAM J. Numer. Anal.
• 2003
A family of fast ordered upwind methods for approximating solutions to a wide class of static Hamilton-Jacobi equations with Dirichlet boundary conditions with complexity O(M log M), where M is the total number of points in the domain.
High Resolution Sharp Computational Methods for Elliptic and Parabolic Problems in Complex Geometries
• Computer Science
J. Sci. Comput.
• 2013
A review of some of the state-of-the-art numerical methods for solving the Stefan problem and the Poisson and the diffusion equations on irregular domains using (i) the level-set method for representing the (possibly moving) irregular domain’s boundary and (ii) a quadtree/octree node-based adaptive mesh refinement for capturing small length scales while significantly reducing the memory and CPU footprint.
A viscosity solutions approach to shape-from-shading
• Mathematics
• 1992
The problem of recovering a Lambertian surface from a single two-dimensional image may be written as a first-order nonlinear equation which presents the disadvantage of having several continuous and
High Order Fast Sweeping Methods for Static Hamilton–Jacobi Equations
• Computer Science
J. Sci. Comput.
• 2006
A novel approach to incorporate high order approximations to derivatives into numerical Hamiltonians such that the resulting numerical schemes are formally high order accurate and inherit the fast convergence from the alternating sweeping strategy.