Front tracking for gas dynamics
Journal of Computational Physics
GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Efficient implementation of essentially non-oscillatory shock-capturing schemes
Journal of Computational Physics
Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
A front-tracking method for viscous, incompressible, multi-fluid flows
Journal of Computational Physics
Computing minimal surfaces via level set curvature flow
Journal of Computational Physics
A level set approach for computing solutions to incompressible two-phase flow
Journal of Computational Physics
Efficient implementation of weighted ENO schemes
Journal of Computational Physics
A numerical method for solving incompressible viscous flow problems
Journal of Computational Physics - Special issue: commenoration of the 30th anniversary
Convergence Analysis of Pseudo-Transient Continuation
SIAM Journal on Numerical Analysis
Reconstructing volume tracking
Journal of Computational Physics
Three-Dimensional Front Tracking
SIAM Journal on Scientific Computing
An adaptive level set approach for incompressible two-phase flows
Journal of Computational Physics
SIAM Journal on Scientific Computing
A non-oscillatory Eulerian approach to interfaces in multimaterial flows (the ghost fluid method)
Journal of Computational Physics
A PDE-based fast local level set method
Journal of Computational Physics
Journal of Computational Physics
Weighted ENO Schemes for Hamilton--Jacobi Equations
SIAM Journal on Scientific Computing
The point-set method: front-tracking without connectivity
Journal of Computational Physics
Some Improvements of the Fast Marching Method
SIAM Journal on Scientific Computing
Journal of Computational Physics
A hybrid particle level set method for improved interface capturing
Journal of Computational Physics
PROST: a parabolic reconstruction of surface tension for the volume-of-fluid method
Journal of Computational Physics
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Jacobian-free Newton-Krylov methods: a survey of approaches and applications
Journal of Computational Physics
A Lagrangian particle level set method
Journal of Computational Physics
Fourth-Order Runge---Kutta Schemes for Fluid Mechanics Applications
Journal of Scientific Computing
Journal of Computational Physics
A sharp interface method for incompressible two-phase flows
Journal of Computational Physics
High-fidelity interface tracking in compressible flows: Unlimited anchored adaptive level set
Journal of Computational Physics
Numerical prediction of interfacial instabilities: Sharp interface method (SIM)
Journal of Computational Physics
Redistancing by flow of time dependent eikonal equation
Journal of Computational Physics
Hi-index | 0.01 |
A hybrid of the front tracking (FT) and the level set (LS) methods is introduced, combining advantages and removing drawbacks of both methods. The kinematics of the interface is treated in a Lagrangian (FT) manner, by tracking markers placed at the interface. The markers are not connected—instead, the interface topology is resolved in an Eulerian (LS) framework, by wrapping a signed distance function around Lagrangian markers each time the markers move. For accuracy and efficiency, we have developed a high-order “anchoring” algorithm and an implicit PDE-based redistancing. We have demonstrated that the method is 3rd-order accurate in space, near the markers, and therefore 1st-order convergent in curvature; this is in contrast to traditional PDE-based reinitialization algorithms, which tend to slightly relocate the zero level set and can be shown to be nonconvergent in curvature. The implicit pseudo-time discretization of the redistancing equation is implemented within the Jacobian-free Newton-Krylov (JFNK) framework combined with ILU(k) preconditioning. Due to the LS localization, the bandwidth of the Jacobian matrix is nearly constant, and the ILU preconditioning scales as $\sim N\log(\sqrt{N})$ in two dimensions, which implies efficiency and good scalability of the overall algorithm. We have demonstrated that the steady-state solutions in pseudo-time can be achieved very efficiently, with $\approx10$ iterations ($\mathrm{CFL}\approx10^4$), in contrast to the explicit redistancing which requires hundreds of iterations with $\mathrm{CFL}\leq1$.