Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applied numerical linear algebra
Applied numerical linear algebra
Fast tree-based redistancing for level set computations
Journal of Computational Physics
A multigrid tutorial (2nd ed.)
A multigrid tutorial (2nd ed.)
Gerris: a tree-based adaptive solver for the incompressible Euler equations in complex geometries
Journal of Computational Physics
Local level set method in high dimension and codimension
Journal of Computational Physics
Journal of Computational Physics
Journal of Computational Physics
Journal of Computational Physics
A second order accurate level set method on non-graded adaptive cartesian grids
Journal of Computational Physics
Journal of Computational Physics
A Parallel Geometric Multigrid Method for Finite Elements on Octree Meshes
SIAM Journal on Scientific Computing
Journal of Scientific Computing
Hi-index | 0.00 |
In order to develop efficient numerical methods for solving elliptic and parabolic problems where Dirichlet boundary conditions are imposed on irregular domains, Chen et al. (J. Sci. Comput. 31(1):19---60, 2007) presented a methodology that produces second-order accurate solutions with second-order gradients on non-graded quadtree and octree data structures. These data structures significantly reduce the number of computational nodes while still allowing for the resolution of small length scales. In this paper, we present a multigrid solver for this framework and present numerical results in two and three spatial dimensions that demonstrate that the computational time scales linearly with the number of nodes, producing a very efficient solver for elliptic and parabolic problems with multiple length scales.