This work introduces the first true end-to-end quantum-inspired computational fluid dynamics (QICFD) solver for direct numerical simulation of the compressible Navier-Stokes equations, and demonstrates the correctness of the new TT division and square-root algorithms, and that QICFD is capable of compressible flow simulations.
Abstract
Quantum-inspired algorithms are an emerging class of algorithms for computational fluid dynamics (CFD) with potentially favourable scaling for large problems compared to classical methods. However, their applications have been limited to incompressible flows due to arithmetic limitations, which are addressed in this work. This work introduces the first true end-to-end quantum-inspired computational fluid dynamics (QICFD) solver for direct numerical simulation of the compressible Navier-Stokes equations, that is, all arithmetic operations, as well as initialisation and post-processing, are undertaken in the tensor train (TT) format. Importantly, new division and square-root algorithms using TTs enable the use of Sutherland's law for viscosity, and leverages recent improvements in TT arithmetic algorithms for reduced runtime and memory cost. The new QICFD solver is validated by comparison with the classical CFD solver HiPSTAR and by way of a challenging fluid-flow test case, the low resolution Taylor-Green Vortex (TGV) at Mach numbers of 0.8 and 0.1. The TGV test case is a transient turbulent case that is very sensitive to accumulating errors, yet our QICFD solver achieves excellent agreement with the classical CFD reference. This work demonstrates the correctness of the new TT division and square-root algorithms, and that QICFD is capable of compressible flow simulations. The new QICFD solver is also able to perform simultaneous simulations, running multiple TGV-like cases initialised differently in parallel with reduced extra cost. Finally, the demonstrated TGV test case reveals additional challenges of QICFD as well as highlight the need for future advances to make TT methods viable for industrially-relevant conditions.
(English) This thesis presents the development and application of a high-fidelity computational framework for the direct numerical simulation (DNS) of high-pressure transcritical turbulent flows. These flows, characterized by strong thermophysical property variations in the vicinity of the pseudo-boiling region, exhibi...
We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD). We examine fully quantum approaches, including quantum linear system algorithms (QLSAs), ranging from the Harrow--Hassidim--Lloyd (HHL) algorithm to quantum singular v...
Mario Guillaume Cecile, Nis-Luca van Hulst, Tomohiro Hashizume et al.· 0 citations
In this work, a globally stiffly accurate Implicit-Explicit (IMEX) Runge-Kutta scheme is developed and implemented in the GBS code [Ricci et al., Plasma Phys. Control. Fusion, 2012], for two-fluid plasma turbulence simulations. The stiffest phenomena, governed by shear Alfv\'en waves and parallel diffusion, are treated...
Micol Bassanini, Simone Deparis, Paolo Ricci et al.· 0 citations
Direct numerical simulation (DNS) of compressible transitional and turbulent flows requires numerical methods that combine high-order accuracy, robustness, and computational efficiency to resolve a broad range of spatial and temporal scales. This paper presents a massively parallel hybridizable discontinuous Galerkin (...
A. Welter, Thea Collin, N. Nguyen et al.· 0 citations
(English) The computational cost of scale-resolving simulations of incompressible flows, such as Direct Numerical Simulation (DNS) and Large-Eddy Simulation (LES), is largely dictated by the temporal integration of the incompressible Navier-Stokes equations. Traditional timestepping strategies often rely on conservativ...
A solution framework with fast matrix-free operator evaluation for all ingredients, combined with multigrid solvers for the Poisson problem, and a robust mixed-precision algorithmic framework to generate accurate initial guesses for the iterative linear solvers are developed.
Ivan Prusak, Enes Mustafa Soydan, Ivan Pribec et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.