Related papers: A 3D fast algorithm for computing Lagrangian coher…
In this paper, we propose a mass conservative semi-Lagrangian finite difference scheme for multi-dimensional problems without dimensional splitting. The semi-Lagrangian scheme, based on tracing characteristics backward in time from grid…
We consider the relationship between Eulerian modal decompositions and Lagrangian coherent structures (LCSs). The model sensitivity framework developed by Kasz\'as and Haller (2020) is used to express data-driven modal representations of…
High-accuracy and high-efficiency finite-time Lyapunov exponent (FTLE) calculation method has long been a research hot point, and adaptive refinement method is a kind of method in this field. The proposed objective-adaptive refinement (OAR)…
We introduce a new Lagrangian particle tracking algorithm that tracks particles in three dimensions to separations between trajectories approaching contact. The algorithm also detects low Weber number binary collisions that result in…
A cell-centered implicit-explicit updated Lagrangian finite volume scheme on unstructured grids is proposed for a unified first order hyperbolic formulation of continuum fluid and solid mechanics. The scheme provably respects the stiff…
A new algorithm for solving large-scale convex optimization problems with a separable objective function is proposed. The basic idea is to combine three techniques: Lagrangian dual decomposition, excessive gap and smoothing. The main…
This study proposes an extension of the high-order compact gas-kinetic scheme (CGKS) to compressible flow simulation in an arbitrary Lagrangian-Eulerian (ALE) formulation in unstructured mesh. The ALE method is achieved by subdividing…
For a moving hypersurface in the flow of a nonautonomous ordinary differential equation in $n$-dimensional Euclidean spaces, the fluxing index of a passively-advected Lagrangian particle is the total number of times it crosses the moving…
We propose a fast algorithm for computing the entire ridge regression regularization path in nearly linear time. Our method constructs a basis on which the solution of ridge regression can be computed instantly for any value of the…
We propose Lagrangian Descriptors (LDs) as a diagnostic framework for evaluating neural network models of Hamiltonian systems beyond conventional trajectory-based metrics. Standard error measures quantify short-term predictive accuracy but…
Accurately segmenting structural cracks at the pixel level remains a major hurdle, as existing methods fail to integrate local textures with pixel dependencies, often leading to fragmented and incomplete predictions. Moreover, their high…
We introduce Lagrangian Flow Networks (LFlows) for modeling fluid densities and velocities continuously in space and time. By construction, the proposed LFlows satisfy the continuity equation, a PDE describing mass conservation in its…
We developed fast direct solver for 3D Helmholtz and Maxwell equations in layered medium. The algorithm is based on the ideas of cyclic reduction for separable matrices. For the grids with major uniform part (within the survey domain in the…
We study the problem of self-supervised 3D scene flow estimation from real large-scale raw point cloud sequences, which is crucial to various tasks like trajectory prediction or instance segmentation. In the absence of ground truth scene…
We propose a defiltering method of turbulent flow fields for Lagrangian particle tracking using machine learning techniques. Numerical simulation of Lagrangian particle tracking is commonly used in various fields. In general, practical…
In this paper, we study the problem of computing the effective diffusivity for particles moving in chaotic flows. Instead of solving a convection-diffusion type cell problem in the Eulerian formulation (arising from homogenization theory…
In probability density function (PDF) methods of turbulent flows, the joint PDF of several flow variables is computed by numerically integrating a system of stochastic differential equations for Lagrangian particles. A mathematically exact…
We propose a variational functional and fast algorithms to reconstruct implicit surface from point cloud data with a curvature constraint. The minimizing functional balances the distance function from the point cloud and the mean curvature…
We present a class of fast subspace tracking algorithms based on orthogonal iterations for structured matrices/pencils that can be represented as small rank perturbations of unitary matrices. The algorithms rely upon an updated data sparse…
Reconstructing 3D fluid velocity fields from sparse 2D video observations is a highly ill-posed inverse problem, demanding both transport consistency with observed motion and physical validity under fluid laws. Existing methods typically…