A memory and computation efficient sparse level-set method

DOI10.1007/s10915-010-9399-5zbMath1225.65086OpenAlexW2113063229MaRDI QIDQ639404

Andrei C. Jalba, Wladimir J. van der Laan, Jos B. T. M. Roerdink

Publication date: 20 September 2011

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-010-9399-5

zbMATH Keywords

algorithmsfinite difference methodHamilton-Jacobi equationnumerical examplesparallel computationmoving interfaceslevel setssparse-grid methodtile management

Mathematics Subject Classification ID

Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Parallel numerical computation (65Y05) Hamilton-Jacobi equations (35F21)

Related Items (1)

High resolution sharp computational methods for elliptic and parabolic problems in complex geometries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient implementation of essentially nonoscillatory shock-capturing schemes
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Tree methods for moving interfaces
• Weighted essentially non-oscillatory schemes
• A PDE-based fast local level set method
• Level set methods and dynamic implicit surfaces
• A hybrid particle level set method for improved interface capturing
• Local level set method in high dimension and codimension
• A fast level set method for propagating interfaces
• Computing minimal surfaces via level set curvature flow
• Dynamic tubular grid: an efficient data structure and algorithms for high resolution level sets
• Level set methods and their applications in image science
• Level set methods: An overview and some recent results

This page was built for publication: A memory and computation efficient sparse level-set method