Out-of-core computations of high-resolution level sets by means of code transformation
From MaRDI portal
Publication:421330
DOI10.1007/s10915-011-9488-0zbMath1242.65030OpenAlexW1972558449WikidataQ122925267 ScholiaQ122925267MaRDI QIDQ421330
Ken Museth, Brian B. Christensen, Michael B. Nielsen
Publication date: 23 May 2012
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-011-9488-0
parallelismlevel set methodscode transformationgraphical examplesstreamingloop skewingloop tilingout-of-core
Parallel numerical computation (65Y05) Computer-aided design (modeling of curves and surfaces) (65D17)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniformly high order accurate essentially non-oscillatory schemes. III. (Reprint)
- Geometric optics in a phase-space-based level set and Eulerian framework
- Achieving scalable locality with time skewing
- Spatially adaptive techniques for level set methods and incompressible flow
- Efficient implementation of essentially nonoscillatory shock-capturing schemes
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- An adaptive level set approach for incompressible two-phase flows
- Tree methods for moving interfaces
- A level set approach for computing solutions to incompressible two-phase flow
- Weighted essentially non-oscillatory schemes
- Back and forth error compensation and correction methods for removing errors induced by uneven gradients of the level set function
- A level set approach for the numerical simulation of dendritic growth
- An I/O-conscious tiling strategy for disk-resident data sets
- A PDE-based fast local level set method
- A hybrid particle level set method for improved interface capturing
- A level set formulation for Willmore flow
- Local level set method in high dimension and codimension
- A fast level set method for propagating interfaces
- Efficient implementation of weighted ENO schemes
- Computing minimal surfaces via level set curvature flow
- Dynamic tubular grid: an efficient data structure and algorithms for high resolution level sets
- A Lagrangian particle level set method
- Cache-Oblivious Algorithms
- A Fast Iterative Method for Eikonal Equations
- Finite Element Methods on Very Large, Dynamic Tubular Grid Encoded Implicit Surfaces
- Weighted ENO Schemes for Hamilton--Jacobi Equations
- Efficient algorithms for globally optimal trajectories
- High-Resolution Conservative Algorithms for Advection in Incompressible Flow
- A fast marching level set method for monotonically advancing fronts.
- Languages and Compilers for Parallel Computing
- Variational problems and partial differential equations on implicit surfaces
This page was built for publication: Out-of-core computations of high-resolution level sets by means of code transformation