Searcharxiv⌕ Search

arXiv subjects

Qiqi Wang

Publications and source records attributed to Qiqi Wang.

At least 55 records · Page 3Linked to original sources

RANS Equations with Explicit Data-Driven Reynolds Stress Closure Can Be Ill-Conditioned

Reynolds-averaged Navier--Stokes (RANS) simulations with turbulence closure models continue to play important roles in industrial flow simulations. However, the commonly used linear eddy viscosity models are intrinsically unable to handle flows with non-equilibrium turbulence. Reynolds stress models, on the other hand, are plagued by their lack of robustness. Recent studies in plane channel flows found that even substituting Reynolds stresses with errors below 0.5% from direct numerical simulation (DNS) databases into RANS equations leads to velocities with large errors (up to 35%). While such an observation may have only marginal relevance to traditional Reynolds stress models, it is disturbing for the recently emerging data-driven models that treat the Reynolds stress as an explicit source term in the RANS equations, as it suggests that the RANS equations with such models can be ill-conditioned. So far, a rigorous analysis of the condition of such models is still lacking. As such, in this work we propose a metric based on local condition number function for a priori evaluation of the conditioning of the RANS equations. We further show that the ill-conditioning cannot be explained by the global matrix condition number of the discretized RANS equations. Comprehensive numerical tests are performed on turbulent channel flows at various Reynolds numbers and additionally on two complex flows, i.e., flow over periodic hills and flow in a square duct. Results suggest that the proposed metric can adequately explain observations in previous studies, i.e., deteriorated model conditioning with increasing Reynolds number and better conditioning of the implicit treatment of Reynolds stress compared to the explicit treatment. This metric can play critical roles in the future development of data-driven turbulence models by enforcing the conditioning as a requirement on these models.

physics.flu-dyn↗

Toward computing sensitivities of average quantities in turbulent flows

Chaotic dynamical systems such as turbulent flows are characterized by an exponential divergence of infinitesimal perturbations to initial conditions. Therefore, conventional adjoint/tangent sensitivity analysis methods that are successful with RANS simulations fail in the case of chaotic LES/DNS. In this work, we discuss the limitations of current approaches, including ensemble-based and shadowing-based sensitivity methods, that were proposed as alternatives to conventional sensitivity analysis. We propose a new alternative, called the space-split sensitivity (S3) algorithm, that is computationally efficient and addresses these limitations. In this work, the derivation of the S3 algorithm is presented in the special case where the system converges to a stationary distribution that can be expressed with a probability density function everywhere in phase-space. Numerical examples of low-dimensional chaotic maps are discussed where S3 computation shows good agreement with finite-difference results, indicating potential for the development of the method in more generality.

cs.CE↗

Least Squares Shadowing method for sensitivity analysis of differential equations

For a parameterized hyperbolic system $\frac{du}{dt}=f(u,s)$ the derivative of the ergodic average $\langle J \rangle = \lim_{T \to \infty}\frac{1}{T}\int_0^T J(u(t),s)$ to the parameter $s$ can be computed via the Least Squares Shadowing algorithm (LSS). We assume that the sytem is ergodic which means that $\langle J \rangle$ depends only on $s$ (not on the initial condition of the hyperbolic system). After discretizing this continuous system using a fixed timestep, the algorithm solves a constrained least squares problem and, from the solution to this problem, computes the desired derivative $\frac{d\langle J \rangle}{ds}$. The purpose of this paper is to prove that the value given by the LSS algorithm approaches the exact derivative when the discretization timestep goes to $0$ and the timespan used to formulate the least squares problem grows to infinity.

math.DS↗

Simplified Least Squares Shadowing sensitivity analysis for chaotic ODEs and PDEs

This paper develops a variant of the Least Squares Shadowing (LSS) method, which has successfully computed the derivative for several chaotic ODEs and PDEs. The development in this paper aims to simplify Least Squares Shadowing method by improving how time dilation is treated. Instead of adding an explicit time dilation term as in the original method, the new variant uses windowing, which can be simpler to implement, especially for PDEs.

math.DS↗

Multiple Shooting Shadowing for Sensitivity Analysis of Chaotic Dynamical Systems

Sensitivity analysis methods are important tools for research and design with simulations. Many important simulations exhibit chaotic dynamics, including scale-resolving turbulent fluid flow simulations. Unfortunately, conventional sensitivity analysis methods are unable to compute useful gradient information for long-time-averaged quantities in chaotic dynamical systems. Sensitivity analysis with least squares shadowing (LSS) can compute useful gradient information for a number of chaotic systems, including simulations of chaotic vortex shedding and homogeneous isotropic turbulence. However, this gradient information comes at a very high computational cost. This paper presents multiple shooting shadowing (MSS), a more computationally efficient shadowing approach than the original LSS approach. Through an analysis of the convergence rate of MSS, it is shown that MSS can have lower memory usage and run time than LSS.

nlin.CD↗

Decomposition of stencil update formula into atomic stages

In parallel solution of partial differential equations, a complex stencil update formula that accesses multiple layers of neighboring grid points sometimes must be decomposed into atomic stages, ones that access only immediately neighboring grid points. This paper shows that this requirement can be formulated as constraints of an optimization problem, which is equivalent to the dual of a minimum-cost network flow problem. An optimized decomposition of a single stencil on one set of grid points can thereby be computed efficiently.

math.NA↗

Toward a chaotic adjoint for LES

Adjoint-based sensitivity analysis methods are powerful tools for engineers who use flow simulations for design. However, the conventional adjoint method breaks down for scale-resolving simulations like large-eddy simulation (LES) or direct numerical simulation (DNS), which exhibit the chaotic dynamics inherent in turbulent flows. Sensitivity analysis based on least-squares shadowing (LSS) avoids the issues encountered by conventional methods, but has a high computational cost. The following report outlines a new, more computationally efficient formulation of LSS, non-intrusive LSS, and estimates its cost for several canonical flows using Lyapunov analysis.

physics.flu-dyn↗

Lyapunov spectrum of separated flows and its dependence on numerical discretization

We investigate the Lyapunov spectrum of separated flows and their dependence on the numerical discretization. The chaotic flow around the NACA 0012 airfoil at low Reynolds number and large angle of attack is considered to that end, and t-, h- and p-refinement studies are performed to examine each effect separately. Numerical results show that the time discretization has a small impact on the dynamics of the system, whereas the spatial discretization can dramatically change them. In particular, the asymptotic Lyapunov spectrum for time refinement is achieved for CFL numbers as large as $\mathcal{O}(10^1-10^2)$, whereas the system continues to become more and more chaotic even for meshes that are much finer than the best practice for this type of flows.

physics.flu-dyn↗

Toward real-time high-fidelity simulation using integral boundary layer modeling

One of the greatest challenges to using large-eddy simulations (LES) in engineering applications is the large number of grid points required near walls. To mitigate this issue, researchers often couple LES with a simplified model of the flow close to the wall, known as the wall model. One feature common to most wall models is that the first few (about 3) grid points must be located below the inviscid log-layer, and the grid must have near-isotropic resolution near the wall. Hence, wall-modeled LES may still require a large number of grid points in both the wall-normal and span-wise directions. Because of these requirements, wall-modeled LES is still unfeasible in many applications. We present a new formulation of wall-modeled LES that is being developed to address this issue. In this formulation, LES is used to solve only for the features of the velocity field that can be adequately represented on the LES grid. The effects of the unresolved features are captured by imposing an integral balance of kinetic energy in the near-wall region. This integral energy balance translates into a dynamic partial differential equation defined on the walls, which is coupled to the LES equations. We discuss details of the new formulation and present results obtained in laminar channel flows.

physics.flu-dyn↗

The swept rule for breaking the latency barrier in time advancing two-dimensional PDEs

This article describes a method to accelerate parallel, explicit time integration of two-dimensional unsteady PDEs. The method is motivated by our observation that latency, not bandwidth, often limits how fast PDEs can be solved in parallel. The method is called the swept rule of space-time domain decomposition. Compared to conventional, space-only domain decomposition, it communicates similar amount of data, but in fewer messages. The swept rule achieves this by decomposing space and time among computing nodes in ways that exploit the domains of influence and the domain of dependency, making it possible to communicate once per many time steps with no redundant computation. By communicating less often, the swept rule effectively breaks the latency barrier, advancing on average more than one time step per ping-pong latency of the network. The article presents simple theoretical analysis to the performance of the swept rule in two spatial dimensions, and supports the analysis with numerical experiments.

math.NA↗

Adjoint-based Gradient Estimation Using the Space-time Solutions of Unknown Conservation Law Simulations

Many control applications can be formulated as optimization constrained by conservation laws. Such optimization can be efficiently solved by gradient-based methods, where the gradient is obtained through the adjoint method. Traditionally, the adjoint method has not been able to be implemented in "gray-box" conservation law simulations. In gray-box simulations, the analytical and numerical form of the conservation law is unknown, but the space-time solution of relevant flow quantities is available. Without the adjoint gradient, optimization can be challenging for problems with many control variables. However, much information about the gray-box simulation is contained in its space-time solution, which motivates us to estimate the adjoint gradient by leveraging the space-time solution. This article considers a type of gray-box simulations where the flux function is partially unknown. A method is introduced to estimate the adjoint gradient at a cost independent of the number of control variables. The method firstly infers a conservation law, named the twin model, from the space-time solution, and then applies the adjoint method to the inferred twin model to estimate the gradient. The method is demonstrated to achieve good gradient estimation accuracies in several numerical examples. The main contributions of this paper are: a twin model method that enables the adjoint gradient computation for gray-box conservation law simulations; and an adaptive basis construction scheme that fully exploits the information of gray-box solutions.

math.OC↗

Adjoint-based gradient estimation from gray-box solutions of unknown conservation laws

Many engineering applications can be formulated as optimizations constrained by conservation laws. Such optimizations can be efficiently solved by the adjoint method, which computes the gradient of the objective to the design variables. Traditionally, the adjoint method has not been able to be implemented in many "gray-box" conservation law simulators. In gray-box simulators, the analytical and numerical form of the conservation law is unknown, but the full solution of relevant flow quantities is available. In this paper, we consider the case where the flux function is unknown. This article introduces a method to estimate the gradient by inferring the flux function from the solution, and then solving the adjoint equation of the inferred conservation law. This method is demonstrated in the sensitivity analysis of two flow problems.

math.OC↗

Unsteady adjoint of pressure loss for a fundamental transonic turbine vane

High fidelity simulations, e.g., large eddy simulation are often needed for accurately predicting pressure losses due to wake mixing in turbomachinery applications. An unsteady adjoint of such high fidelity simulations is useful for design optimization in these aerodynamic applications. In this paper we present unsteady adjoint solutions using a large eddy simulation model for a vane from VKI using aerothermal objectives. The unsteady adjoint method is effective in capturing the gradient for a short time interval aerothermal objective, whereas the method provides diverging gradients for long time-averaged thermal objectives. As the boundary layer on the suction side near the trailing edge of the vane is turbulent, it poses a challenge for the adjoint solver. The chaotic dynamics cause the adjoint solution to diverge exponentially from the trailing edge region when solved backwards in time. This results in the corruption of the sensitivities obtained from the adjoint solutions. An energy analysis of the unsteady compressible Navier-Stokes adjoint equations indicates that adding artificial viscosity to the adjoint equations can potentially dissipate the adjoint energy while potentially maintain the accuracy of the adjoint sensitivities. Analyzing the growth term of the adjoint energy provides a metric for identifying the regions in the flow where the adjoint term is diverging. Results for the vane from simulations performed on the Titan supercomputer are demonstrated.

physics.flu-dyn↗

The swept rule for breaking the latency barrier in time advancing PDEs

This article investigates the swept rule of space-time domain decomposition, an idea to break the latency barrier via communicating less often when explicitly solving time-dependent PDEs. The swept rule decomposes space and time among computing nodes in ways that exploit the domains of influence and the domain of dependency, making it possible to communicate once per many timesteps without redundant computation. The article presents simple theoretical analysis to the performance of the swept rule which then was shown to be accurate by conducting numerical experiments.

cs.CE↗

Simultaneous Single-Step One-Shot Optimization with Unsteady PDEs

The single-step one-shot method has proven to be very efficient for PDE-constrained optimization where the partial differential equation (PDE) is solved by an iterative fixed point solver. In this approach, the simulation and optimization tasks are performed simultaneously in a single iteration. If the PDE is unsteady, finding an appropriate fixed point iteration is non-trivial. In this paper, we provide a framework that makes the single-step one-shot method applicable for unsteady PDEs that are solved by classical time-marching schemes. The One-shot method is applied to an optimal control problem with unsteady incompressible Navier-Stokes equations that are solved by an industry standard simulation code. With the Van-der-Pol oscillator as a generic model problem, the modified simulation scheme is further improved using adaptive time scales. Finally, numerical results for the advection-diffusion equation are presented.

math.OC↗

Parallel optimization for large eddy simulations

We developed a parallel Bayesian optimization algorithm for large eddy simulations. These simulations challenge optimization methods because they take hours or days to compute, and their objective function contains noise as turbulent statistics that are averaged over a finite time. Surrogate based optimization methods, including Bayesian optimization, have shown promise for noisy and expensive objective functions. Here we adapt Bayesian optimization to minimize drag in a turbulent channel flow and to design the trailing edge of a turbine blade to reduce turbulent heat transfer and pressure loss. Our optimization simultaneously runs several simulations, each parallelized to thousands of cores, in order to utilize additional concurrency offered by today's supercomputers.

physics.flu-dyn↗

The Implications of Tolerance Optimization on Compressor Blade Design

Geometric variability increases performance variability and degrades the mean performance of turbomachinery compressor blades. These detrimental effects can be reduced by using robust optimization to design the blade geometry or by imposing stricter manufacturing tolerances. This paper presents a novel computational framework for optimizing compressor blade manufacturing tolerances, and incorporates this framework into existing robust geometry design frameworks. Optimizations of an exit guide vane geometry are conducted. The single-point optimal geometry is found to depend on the manufacturing tolerances due to a switch in the dominant loss mechanism. Multi-point geometry optimization avoids this switch so that the geometry and tolerance optimization problems are decoupled.

math.OC↗

Input Subspace Detection for Dimension Reduction in High Dimensional Approximation

This manuscript is superseded by Constantine, Dow, and Wang's "Active Subspaces in Theory and Practice: Applications to Kriging Surfaces" [SIAM J. of Sci. Comput., 36 (2014), pp. A1500-A1524]. Many multivariate functions encountered in practice vary primarily along a few directions in the space of input parameters. When these directions correspond with coordinate directions, one may apply global sensitivity measures to determine the parameters with the greatest contribution to the function's variability. However, these methods perform poorly when the directions of variability are not aligned with the natural coordinates of the input space. We present a method for detecting the directions of variability of a function using evaluations of its derivative with respect to the input parameters. We demonstrate how to exploit these directions to construct a surrogate function that depends on fewer variables than the original function, thus reducing the dimension of the original problem. We apply this procedure to an exercise in uncertainty quantification using an elliptic PDE with a model for the coefficients that depends on 250 independent parameters. The dimension reduction procedure identifies a 5-dimensional subspace suitable for constructing surrogates.

math.NA↗