Eulerian algorithms for computing the forward finite time Lyapunov exponent without finite difference upon the flow map
From MaRDI portal
Publication:5077708
Recommendations
- An Eulerian approach for computing the finite time Lyapunov exponent
- An improved Eulerian approach for the finite time Lyapunov exponent
- Estimating the finite time Lyapunov exponent from sparse Lagrangian trajectories
- Fast computation of finite-time Lyapunov exponent fields for unsteady flows
- DG-FTLE: Lagrangian coherent structures with high-order discontinuous-Galerkin methods
Cites work
- An Eulerian approach for computing the finite time Lyapunov exponent
- An Eulerian method for computing the coherent ergodic partition of continuous dynamical systems
- An improved Eulerian approach for the finite time Lyapunov exponent
- Definition and properties of Lagrangian coherent structures from finite-time Lyapunov exponents in two-dimensional aperiodic flows
- Distinguished material surfaces and coherent structures in three-dimensional fluid flows
- Eulerian based interpolation schemes for flow map construction and line integral computation with applications to Lagrangian coherent structures extraction
- Eulerian Methods for Visualizing Continuous Dynamical Systems using Lyapunov Exponents
- Fast construction of forward flow maps using Eulerian based interpolation schemes
- Lagrangian coherent structures and mixing in two-dimensional turbulence
- Lagrangian coherent structures in n-dimensional systems
- Lagrangian structures and the rate of strain in a partition of two-dimensional turbulence
- The backward phase flow method for the Eulerian finite time Lyapunov exponent computations
Cited in
(9)- An improved Eulerian approach for the finite time Lyapunov exponent
- Computing the finite time Lyapunov exponent for flows with uncertainties
- Eulerian algorithms for computing some Lagrangian flow network quantities
- Uncertainty in finite-time Lyapunov exponent computations
- The backward phase flow method for the Eulerian finite time Lyapunov exponent computations
- GPU and APU computations of finite time Lyapunov exponent fields
- Fast computation of finite-time Lyapunov exponent fields for unsteady flows
- An Eulerian approach for computing the finite time Lyapunov exponent
- Sparse subsampling of flow measurements for finite-time Lyapunov exponent in domains with obstacles
This page was built for publication: Eulerian algorithms for computing the forward finite time Lyapunov exponent without finite difference upon the flow map
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077708)