arXiv subjects

Gianluca Iaccarino

Publications and source records attributed to Gianluca Iaccarino.

At least 37 records · Page 2Linked to original sources

arXiv2018

Turbulence Modeling in the Age of Data

Data from experiments and direct simulations of turbulence have historically been used to calibrate simple engineering models such as those based on the Reynolds-averaged Navier--Stokes (RANS) equations. In the past few years, with the availability of large and diverse datasets, researchers have begun to explore methods to systematically inform turbulence models with data, with the goal of quantifying and reducing model uncertainties. This review surveys recent developments in bounding uncertainties in RANS models via physical constraints, in adopting statistical inference to characterize model coefficients and estimate discrepancy, and in using machine learning to improve turbulence models. Key principles, achievements and challenges are discussed. A central perspective advocated in this review is that by exploiting foundational knowledge in turbulence modeling and physical constraints, data-driven approaches can yield useful predictive models.

physics.flu-dyn↗

arXiv2018

Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence

Efficiently performing predictive studies of irradiated particle-laden turbulent flows has the potential of providing significant contributions towards better understanding and optimizing, for example, concentrated solar power systems. As there are many uncertainties inherent in such flows, uncertainty quantification is fundamental to improve the predictive capabilities of the numerical simulations. For large-scale, multi-physics problems exhibiting high-dimensional uncertainty, characterizing the stochastic solution presents a significant computational challenge as many methods require a large number of high-fidelity solves. This requirement results in the need for a possibly infeasible number of simulations when a typical converged high-fidelity simulation requires intensive computational resources. To reduce the cost of quantifying high-dimensional uncertainties, we investigate the application of a non-intrusive, bi-fidelity approximation to estimate statistics of quantities of interest associated with an irradiated particle-laden turbulent flow. This method relies on exploiting the low-rank structure of the solution to accelerate the stochastic sampling and approximation processes by means of cheaper-to-run, lower fidelity representations. The application of this bi-fidelity approximation results in accurate estimates of the QoI statistics while requiring a small number of high-fidelity model evaluations.

physics.comp-ph↗

arXiv2018

Quadrature Strategies for Constructing Polynomial Approximations

Finding suitable points for multivariate polynomial interpolation and approximation is a challenging task. Yet, despite this challenge, there has been tremendous research dedicated to this singular cause. In this paper, we begin by reviewing classical methods for finding suitable quadrature points for polynomial approximation in both the univariate and multivariate setting. Then, we categorize recent advances into those that propose a new sampling approach and those centered on an optimization strategy. The sampling approaches yield a favorable discretization of the domain, while the optimization methods pick a subset of the discretized samples that minimize certain objectives. While not all strategies follow this two-stage approach, most do. Sampling techniques covered include subsampling quadratures, Christoffel, induced and Monte Carlo methods. Optimization methods discussed range from linear programming ideas and Newton's method to greedy procedures from numerical linear algebra. Our exposition is aided by examples that implement some of the aforementioned strategies.

math.NA↗

arXiv2018

An uncertainty estimation module for turbulence model predictions in SU2

With the advent of improved computational resources, aerospace design has testing-based process to a simulation-driven procedure, wherein uncertainties in design and operating conditions are explicitly accounted for in the design under uncertainty methodology. A key source of such uncertainties in design are the closure models used to account for fluid turbulence. In spite of their importance, no reliable and extensively tested modules are available to estimate this epistemic uncertainty. In this article, we outline the EQUiPS uncertainty estimation module developed for the SU2 CFD suite that focuses on uncertainty due to turbulence models. The theoretical foundations underlying this uncertainty estimation and its computational implementation are detailed. Thence, the performance of this module is presented for a range of test cases, including both benchmark problems and flows relevant to aerospace design. Across the range of test cases, the uncertainty estimates of the module were able to account for a significant portion of the discrepancy between RANS predictions and high fidelity data.

physics.flu-dyn↗

arXiv2018

Multi-fidelity uncertainty quantification of irradiated particle-laden turbulence

The study of complex systems is often based on computationally intensive, high-fidelity, simulations. To build confidence in the prediction accuracy of such simulations, the impact of uncertainties in model inputs on the quantities of interest must be measured. This, however, requires a computational budget that is a possibly large multiple of the cost of a single simulation, and thus may become infeasible for expensive simulation models featuring a large number of uncertain inputs and highly nonlinear behavior. Therefore, this work explores multi-fidelity strategies to accelerate the estimation of the effect of uncertainties. The main idea behind multi-fidelity models is to utilize cheaper, lower-fidelity models - than the intended high-fidelity, expensive model of the problem - to generate a baseline solution that together, with relatively small number of high-fidelity simulations can lead to accurate predictions. The methods are briefly presented, and their performance assessed on an irradiated particle-laden turbulent flow case related to Stanford's PSAAP II particle-based solar energy receiver.

physics.comp-ph↗

arXiv2018

Lurking Variable Detection via Dimensional Analysis

Lurking variables represent hidden information, and preclude a full understanding of phenomena of interest. Detection is usually based on serendipity -- visual detection of unexplained, systematic variation. However, these approaches are doomed to fail if the lurking variables do not vary. In this article, we address these challenges by introducing formal hypothesis tests for the presence of lurking variables, based on Dimensional Analysis. These procedures utilize a modified form of the Buckingham Pi theorem to provide structure for a suitable null hypothesis. We present analytic tools for reasoning about lurking variables in physical phenomena, construct procedures to handle cases of increasing complexity, and present examples of their application to engineering problems. The results of this work enable algorithm-driven lurking variable detection, complementing a traditionally inspection-based approach.

stat.ME↗

arXiv2017

Data-driven dimensional analysis: algorithms for unique and relevant dimensionless groups

Classical dimensional analysis has two limitations: (i) the computed dimensionless groups are not unique, and (ii) the analysis does not measure relative importance of the dimensionless groups. We propose two algorithms for estimating unique and relevant dimensionless groups assuming the experimenter can control the system's independent variables and evaluate the corresponding dependent variable; e.g., computer experiments provide such a setting. The first algorithm is based on a response surface constructed from a set of experiments. The second algorithm uses many experiments to estimate finite differences over a range of the independent variables. Both algorithms are semi-empirical because they use experimental data to complement the dimensional analysis. We derive the algorithms by combining classical semi-empirical modeling with active subspaces, which---given a probability density on the independent variables---yield unique and relevant dimensionless groups. The connection between active subspaces and dimensional analysis also reveals that all empirical models are ridge functions, which are functions that are constant along low-dimensional subspaces in its domain. We demonstrate the proposed algorithms on the well-studied example of viscous pipe flow---both turbulent and laminar cases. The results include a new set of two dimensionless groups for turbulent pipe flow that are ordered by relevance to the system; the precise notion of relevance is closely tied to the derivative based global sensitivity metric from Sobol' and Kucherenko.

math.NA↗

arXiv2016

A Low-rank Control Variate for Multilevel Monte Carlo Simulation of High-dimensional Uncertain Systems

Multilevel Monte Carlo (MLMC) is a recently proposed variation of Monte Carlo (MC) simulation that achieves variance reduction by simulating the governing equations on a series of spatial (or temporal) grids with increasing resolution. Instead of directly employing the fine grid solutions, MLMC estimates the expectation of the quantity of interest from the coarsest grid solutions as well as differences between each two consecutive grid solutions. When the differences corresponding to finer grids become smaller, hence less variable, fewer MC realizations of finer grid solutions are needed to compute the difference expectations, thus leading to a reduction in the overall work. This paper presents an extension of MLMC, referred to as multilevel control variates (MLCV), where a low-rank approximation to the solution on each grid, obtained primarily based on coarser grid solutions, is used as a control variate for estimating the expectations involved in MLMC. Cost estimates as well as numerical examples are presented to demonstrate the advantage of this new MLCV approach over the standard MLMC when the solution of interest admits a low-rank approximation and the cost of simulating finer grids grows fast.

stat.CO↗

arXiv2016

Many physical laws are ridge functions

A ridge function is a function of several variables that is constant along certain directions in its domain. Using classical dimensional analysis, we show that many physical laws are ridge functions; this fact yields insight into the structure of physical laws and motivates further study into ridge functions and their properties. We also connect dimensional analysis to modern subspace-based techniques for dimension reduction, including active subspaces in deterministic approximation and sufficient dimension reduction in statistical regression.

math.NA↗

arXiv2015

A density-matching approach for optimization under uncertainty

Modern computers enable methods for design optimization that account for uncertainty in the system---so-called optimization under uncertainty. We propose a metric for OUU that measures the distance between a designer-specified probability density function of the system response the target and system response's density function at a given design. We study an OUU formulation that minimizes this distance metric over all designs. We discretize the objective function with numerical quadrature and approximate the response density function with a Gaussian kernel density estimate. We offer heuristics for addressing issues that arise in this formulation, and we apply the approach to a CFD-based airfoil shape optimization problem. We qualitatively compare the density-matching approach to a multi-objective robust design optimization to gain insight into the method.

math.OC↗

arXiv2015

Exploiting Active Subspaces to Quantify Uncertainty in the Numerical Simulation of the HyShot II Scramjet

We present a computational analysis of the reactive flow in a hypersonic scramjet engine with focus on effects of uncertainties in the operating conditions. We employ a novel methodology based on active subspaces to characterize the effects of the input uncertainty on the scramjet performance. The active subspace identifies one-dimensional structure in the map from simulation inputs to quantity of interest that allows us to reparameterize the operating conditions; instead of seven physical parameters, we can use a single derived active variable. This dimension reduction enables otherwise infeasible uncertainty quantification, considering the simulation cost of roughly 9500 CPU-hours per run. For two values of the fuel injection rate, we use a total of 68 simulations to (i) identify the parameters that contribute the most to the variation in the output quantity of interest, (ii) estimate upper and lower bounds on the quantity of interest, (iii) classify sets of operating conditions as safe or unsafe corresponding to a threshold on the output quantity of interest, and (iv) estimate a cumulative distribution function for the quantity of interest.

math.NA↗

arXiv2014

An Efficient Intrusive Uncertainty Propagation Method For Multi-Physics System With Random Inputs

Coupled partial differential equation (PDE) systems, which often represent multi-physics models, are naturally suited for modular numerical solution methods. However, several challenges yet remain in extending the benefits of modularization practices to the task of uncertainty propagation. Since the cost of each deterministic PDE solve can be usually expected to be quite significant, statistical sampling based methods like Monte-Carlo (MC) are inefficient because they do not take advantage of the mathematical structure of the problem, and suffer for poor convergence properties. On the other hand, even if each module contains a moderate number of uncertain parameters, implementing spectral methods on the combined high-dimensional parameter space can be prohibitively expensive due to the curse of dimensionality. In this work, we present a module-based and efficient intrusive spectral projection (ISP) method for uncertainty propagation. In our proposed method, each subproblem is separated and modularized via block Gauss-Seidel (BGS) techniques, such that each module only needs to tackle the local stochastic parameter space. Moreover, the computational costs are significantly mitigated by constructing reduced chaos approximations of the input data that enter each module. We demonstrate implementations of our proposed method and its computational gains over the standard ISP method using numerical examples.

math.NA↗

arXiv2014

A Flexible Uncertainty Quantification Framework for General Multi-Physics Systems

We present a "module-based hybrid" Uncertainty Quantification (UQ) framework for general nonlinear multi-physics simulation. The proposed methodology, introduced in [\hyperlink{ref1}{1}], supports the independent development of each \emph{stochastic} linear or nonlinear physics module equipped with the most suitable probabilistic UQ method: non-intrusive, semi-intrusive or intrusive; and provides a generic framework to couple these stochastic simulation components. Moreover, the methodology is illustrated using a common "global" uncertainty representation scheme based on generalized polynomial chaos (gPC) expansions of inputs and outputs. By using thermally-driven cavity flow as the multi-physics model problem, we demonstrate the utility of our framework and report the computational gains achieved.

physics.comp-ph↗

arXiv2014

An Efficient Non-Intrusive Uncertainty Propagation Method for Stochastic Multi-Physics Models

Multi-physics models governed by coupled partial differential equation (PDE) systems, are naturally suited for partitioned, or modular numerical solution strategies. Although widely used in tackling deterministic coupled models, several challenges arise in extending the benefits of modularization to uncertainty propagation. On one hand, Monte-Carlo (MC) based methods are prohibitively expensive as the cost of each deterministic PDE solve is usually quite large, while on the other hand, even if each module contains a moderate number of uncertain parameters, implementing spectral methods on the combined high-dimensional parameter space can be prohibitively expensive. In this work, we present a reduced non-intrusive spectral projection (NISP) based uncertainty propagation method which separates and modularizes the uncertainty propagation task in each subproblem using block Gauss-Seidel (BGS) techniques. The overall computational costs in the proposed method are also mitigated by constructing reduced approximations of the input data entering each module. These reduced approximations and the corresponding quadrature rules are constructed via simple linear algebra transformations. We describe these components of the proposed algorithm assuming a generalized polynomial chaos (gPC) model of the stochastic solutions. We demonstrate our proposed method and its computational gains over the standard NISP method using numerical examples.

math.NA↗

arXiv2014

Factorizing the Stochastic Galerkin System

Recent work has explored solver strategies for the linear system of equations arising from a spectral Galerkin approximation of the solution of PDEs with parameterized (or stochastic) inputs. We consider the related problem of a matrix equation whose matrix and right hand side depend on a set of parameters (e.g. a PDE with stochastic inputs semidiscretized in space) and examine the linear system arising from a similar Galerkin approximation of the solution. We derive a useful factorization of this system of equations, which yields bounds on the eigenvalues, clues to preconditioning, and a flexible implementation method for a wide array of problems. We complement this analysis with (i) a numerical study of preconditioners on a standard elliptic PDE test problem and (ii) a fluids application using existing CFD codes; the MATLAB codes used in the numerical studies are available online.

math.NA↗

arXiv2014

Optimization Under Uncertainty Using the Generalized Inverse Distribution Function

A framework for robust optimization under uncertainty based on the use of the generalized inverse distribution function (GIDF), also called quantile function, is here proposed. Compared to more classical approaches that rely on the usage of statistical moments as deterministic attributes that define the objectives of the optimization process, the inverse cumulative distribution function allows for the use of all the possible information available in the probabilistic domain. Furthermore, the use of a quantile based approach leads naturally to a multi-objective methodology which allows an a-posteriori selection of the candidate design based on risk/opportunity criteria defined by the designer. Finally, the error on the estimation of the objectives due to the resolution of the GIDF will be proven to be quantifiable

math.OC↗

arXiv2012

Non-intrusive Low-Rank Separated Approximation of High-Dimensional Stochastic Models

This work proposes a sampling-based (non-intrusive) approach within the context of low-rank separated representations to tackle the issue of curse-of-dimensionality associated with the solution of models, e.g., PDEs/ODEs, with high-dimensional random inputs. Under some conditions discussed in details, the number of random realizations of the solution, required for a successful approximation, grows linearly with respect to the number of random inputs. The construction of the separated representation is achieved via a regularized alternating least-squares regression, together with an error indicator to estimate model parameters. The computational complexity of such a construction is quadratic in the number of random inputs. The performance of the method is investigated through its application to three numerical examples including two ODE problems with high-dimensional random inputs.

math-ph↗

arXiv2009

Spectral Methods for Parameterized Matrix Equations

We apply polynomial approximation methods -- known in the numerical PDEs context as spectral methods -- to approximate the vector-valued function that satisfies a linear system of equations where the matrix and the right hand side depend on a parameter. We derive both an interpolatory pseudospectral method and a residual-minimizing Galerkin method, and we show how each can be interpreted as solving a truncated infinite system of equations; the difference between the two methods lies in where the truncation occurs. Using classical theory, we derive asymptotic error estimates related to the region of analyticity of the solution, and we present a practical residual error estimate. We verify the results with two numerical examples.

math.NA↗