Pass-efficient methods for compression of high-dimensional turbulent flow data
From MaRDI portal
Publication:2123807
DOI10.1016/j.jcp.2020.109704OpenAlexW3003701822MaRDI QIDQ2123807
Alireza Doostan, Alec M. Dunton, Lluís Jofre, Gianluca Iaccarino
Publication date: 14 April 2022
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.13257
randomized algorithmlow-rank approximationparticle-laden turbulenceinterpolative decompositionbig-data compressionsingle-pass algorithm
Related Items (3)
Scalable \textit{in situ} compression of transient simulation data using time-dependent bases ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- CUR matrix decompositions for improved data analysis
- zfp
- A randomized algorithm for the decomposition of matrices
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
- A fast randomized algorithm for the approximation of matrices
- Sparse approximate solution of partial differential equations
- Stochastic model reduction for chaos representations
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems
- A scalable geometric multigrid solver for nonsymmetric elliptic systems with application to variable-density flows
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence
- Fast low-rank modifications of the thin singular value decomposition
- A Randomized Blocked Algorithm for Efficiently Computing Rank-revealing Factorizations of Matrices
- A Stochastic Collocation Algorithm with Multifidelity Models
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Computational Advertising: Techniques for Targeting Relevant Ads
- Inflow Turbulence Generation Methods
- Randomized algorithms for the low-rank approximation of matrices
- A fast randomized algorithm for overdetermined linear least-squares regression
- Equation of motion for a small rigid sphere in a nonuniform flow
- Extensions of Lipschitz mappings into a Hilbert space
- Direct numerical simulation of turbulent channel flow up to Reτ=590
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Turbulent Flows
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Geometric Subspace Updates with Applications to Online Adaptive Nonlinear Model Reduction
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- FPC: A High-Speed Compressor for Double-Precision Floating-Point Data
- Randomized methods for matrix computations
- Numerical linear algebra in the streaming model
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
- Model-Based Compressive Sensing
- On the Compression of Low Rank Matrices
- Optimal principal component analysis in distributed and streaming models
- A Method for the Construction of Minimum-Redundancy Codes
- Numerical Linear Algebra
This page was built for publication: Pass-efficient methods for compression of high-dimensional turbulent flow data
