Related papers: A 3D fast algorithm for computing Lagrangian coher…
In high dimensional regression, feature clustering by their effects on outcomes is often as important as feature selection. For that purpose, clustered Lasso and octagonal shrinkage and clustering algorithm for regression (OSCAR) are used…
Parallel transport is a fundamental tool to perform statistics on Rie-mannian manifolds. Since closed formulae don't exist in general, practitioners often have to resort to numerical schemes. Ladder methods are a popular class of algorithms…
Analysis of Lagrangian Coherent Structures (LCSs) has been showed to be a valid mathematical approach to explain the formation of transport barriers in magnetized plasmas. Such LCSs, borrowed from fluid dynamics theory, can be considered as…
We analyze large-scale patterns in three-dimensional turbulent convection in a horizontally extended square convection cell by Lagrangian particle trajectories calculated in direct numerical simulations. A simulation run at a Prandtl number…
We develop a methodology to identify finite-time Lagrangian structures from data and models using an extension of the Koopman operator-theoretic methods developed for velocity fields with simple (periodic, quasi-periodic) time-dependence.…
A finite difference algorithm based on the integral Laguerre transform in time for solving a three-dimensional one-way wave equation is proposed. This allows achieving high accuracy of calculation results. In contrast to the Fourier method,…
Hybrid Reynolds-averaged Navier Stokes large eddy simulation (RANS LES) methods have become popular for simulation of massively separated flows at high Reynolds numbers due to their reduced computational cost and good accuracy. The current…
We propose a new stochastic L-BFGS algorithm and prove a linear convergence rate for strongly convex and smooth functions. Our algorithm draws heavily from a recent stochastic variant of L-BFGS proposed in Byrd et al. (2014) as well as a…
Currently, Eulerian flow solvers are very efficient in accurately resolving flow structures near solid boundaries. On the other hand, they tend to be diffusive and to dampen high-intensity vortical structures after a short distance away…
This paper develops a robust three-level time split high-order Leapfrog/Crank-Nicolson technique for solving the two-dimensional unsteady sobolev and regularized long wave equations arising in fluid mechanics. A deep analysis of the…
A new algorithm for simulating compact U(1) lattice gauge theory in three dimensions is presented which is based on global changes in the configuration space. We show that this algorithm provides an effective way to extract partition…
A fast multigrid solver is presented for high-order accurate Stokes problems discretised by local discontinuous Galerkin (LDG) methods. The multigrid algorithm consists of a simple V-cycle, using an element-wise block Gauss-Seidel smoother.…
Existing salient object detection methods often adopt deeper and wider networks for better performance, resulting in heavy computational burden and slow inference speed. This inspires us to rethink saliency detection to achieve a favorable…
Coherent structures in two-dimensional Navier-Stokes turbulence are ubiquitously observed in nature, experiments and numerical simulations. The present study conducts a comparison between several structure detection schemes based on the…
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to…
Time-varying vector fields produced by computational fluid dynamics simulations are often prohibitively large and pose challenges for accurate interactive analysis and exploration. To address these challenges, reduced Lagrangian…
We propose a family of high-order local discontinuous Galerkin (LDG) methods, built on a parametric representation and coupled with a semi-implicit backward Euler time discretization, for isotropic and anisotropic curve-shortening flows.…
A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster…
Computational fluid dynamics (CFD) is a specialised branch of fluid mechanics that utilises numerical methods and algorithms to solve and analyze fluid-flow problems. One promising avenue to enhance CFD is the use of quantum computing,…
We present FastLSQ, a framework for PDE solving and inverse problems built on trigonometric random Fourier features with exact analytical derivatives. Trigonometric features admit closed-form derivatives of any order in $\mathcal{O}(1)$,…