Pass-efficient methods for compression of high-dimensional turbulent flow data
From MaRDI portal
Recommendations
- Scalable \textit{in situ} compression of transient simulation data using time-dependent bases
- Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
- TuckerMPI: a parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition
- Efficient representation of turbulent flows using data-enriched finite elements
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
Cites work
- scientific article; zbMATH DE number 3599198 (Why is no real title available?)
- A Method for the Construction of Minimum-Redundancy Codes
- A fast randomized algorithm for overdetermined linear least-squares regression
- A fast randomized algorithm for the approximation of matrices
- A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems
- A new truncation strategy for the higher-order singular value decomposition
- A randomized algorithm for the decomposition of matrices
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- A scalable geometric multigrid solver for nonsymmetric elliptic systems with application to variable-density flows
- A stochastic collocation algorithm with multifidelity models
- A universal algorithm for sequential data compression
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence
- CUR matrix decompositions for improved data analysis
- Compression of individual sequences via variable-rate coding
- Direct numerical simulation of turbulent channel flow up to Reτ=590
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Equation of motion for a small rigid sphere in a nonuniform flow
- Extensions of Lipschitz mappings into a Hilbert space
- FPC: A High-Speed Compressor for Double-Precision Floating-Point Data
- Fast low-rank modifications of the thin singular value decomposition
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Geometric subspace updates with applications to online adaptive nonlinear model reduction
- Inflow turbulence generation methods
- Model-Based Compressive Sensing
- Numerical Linear Algebra
- Numerical linear algebra in the streaming model
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the Compression of Low Rank Matrices
- Optimal principal component analysis in distributed and streaming models
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
- Practical sketching algorithms for low-rank matrix approximation
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- Randomized algorithms for the low-rank approximation of matrices
- Randomized methods for matrix computations
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Sketching as a tool for numerical linear algebra
- Sparse approximate solution of partial differential equations
- Stochastic model reduction for chaos representations
- Streaming low-rank matrix approximation with an application to scientific simulation
- Turbulent Flows
- Wavelets and filter banks
- zfp
Cited in
(6)- Kinetic-energy- and pressure-equilibrium-preserving schemes for real-gas turbulence in the transcritical regime
- QuadConv: quadrature-based convolutions with applications to non-uniform PDE data compression
- Scalable \textit{in situ} compression of transient simulation data using time-dependent bases
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
This page was built for publication: Pass-efficient methods for compression of high-dimensional turbulent flow data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2123807)
