Pith. sign in

REVIEW 1 cited by

Tensor networks enable the calculation of turbulence probability distributions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.09169 v2 pith:4GEYGSGR submitted 2024-07-12 physics.flu-dyn nlin.CDphysics.comp-phquant-ph

classification physics.flu-dynnlin.CDphysics.comp-phquant-ph
keywords pdfsturbulenceturbulentchaoticdimensionalitydirectlyevenflow
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Predicting the dynamics of turbulent fluid flows has long been a central goal of science and engineering. Yet, even with modern computing technology, accurate simulation of all but the simplest turbulent flow-fields remains impossible: the fields are too chaotic and multi-scaled to directly store them in memory and perform time-evolution. An alternative is to treat turbulence $\textit{probabilistically}$, viewing flow properties as random variables distributed according to joint probability density functions (PDFs). Turbulence PDFs are neither chaotic nor multi-scale, but are still challenging to simulate due to their high dimensionality. Here we show how to overcome the dimensionality problem by parameterising turbulence PDFs into an extremely compressed format known as a "tensor network" (TN). The TN paradigm enables simulations on single CPU cores that would otherwise be impractical even with supercomputers: for a $5+1$ dimensional PDF of a chemically reactive turbulent flow, we achieve reductions in memory and computational costs by factors of $\mathcal{O}(10^6)$ and $\mathcal{O}(10^3)$, respectively, compared to standard finite difference algorithms. A future path is opened towards something heretofore regarded as infeasible: directly simulating high-dimensional PDFs of both turbulent flows and other chaotic systems that are useful to describe probabilistically.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Tensor network methods for the Gross-Pitaevskii equation on fine grids

    cond-mat.quant-gas 2025-07 conditional novelty 6.0 of 10

    Tensor network compression, especially with a matrix product operator quantum Fourier transform, simulates Gross-Pitaevskii dynamics on grids up to 128^3 with bond dimensions under 100, enabling finer spatial resoluti...

Pith tools