Nonlinear Model Reduction for Uncertainty Quantification in Large-Scale Inverse Problems

We present a model reduction approach to the solution of large-scale statistical inverse problems in a Bayesian inference setting. A key to the model reduction is an efficient representation of the non-linear terms in the reduced model. To achieve this, we present a formulation that employs masked projection of the discrete equations; that is, we compute an approximation of the non-linear term using a select subset of interpolation points. Further, through this formulation we show similarities among the existing techniques of gappy proper orthogonal decomposition, missing point estimation, and empirical interpolation via coefficient-function approximation. The resulting model reduction methodology is applied to a highly non-linear combustion problem governed by an advection–diffusion-reaction partial differential equation (PDE). Our reduced model is used as a surrogate for a finite element discretization of the non-linear PDE within the Markov chain Monte Carlo sampling employed by the Bayesian inference approach. In two spatial dimensions, we show that this approach yields accurate results while reducing the computational cost by several orders of magnitude. For the full three-dimensional problem, a forward solve using a reduced model that has high fidelity over the input parameter space is more than two million times faster than the full-order finite element model, making tractable the solution of the statistical inverse problem that would otherwise require many years of CPU time.MIT-Singapore Alliance. Computational Engineering ProgrammeUnited States. Air Force Office of Scientific Research (Contract Nos. FA9550-06-0271)National Science Foundation (U.S.) (Grant No. CNS-0540186)National Science Foundation (U.S.) (Grant No. CNS-0540372)Caja Madrid Foundation (Graduate Fellowship

Power Optimization of Wind Turbines Subject to Navier-Stokes Equations

In this thesis, we first develop a second-order corrected-explicit-implicit domain decomposition scheme (SCEIDD) for the parallel approximation of convection-diffusion equations over multi-block sub-domains. The stability and convergence properties of the SCEIDD scheme is analyzed, and it is proved that this scheme is unconditionally stable. Moreover, it is proved that the SCEIDD scheme is second-order accurate in time and space. Furthermore, three different numerical experiments are performed to verify the theoretical results. In all the experiments the SCEIDD scheme is compared with the EIPCMU2D scheme which is first-order in time. Then, we focus on the application of numerical PDEs in wind farm power optimization. We develop a model for wind farm power optimization while considering the wake interaction among wind turbines. The proposed model is a PDE-constrained optimization model with the objective of maximizing the total power of the wind turbines where the three-dimensional Navier-Stokes equations are among the constraints. Moreover, we develop an efficient numerical algorithm to solve the model. This numerical algorithm is based on the pattern search method, the actuator line method and a numerical scheme which is used to solve the Navier-Stokes equations. Furthermore, the proposed numerical algorithm is used to investigate the wake structures. Numerical results are consistent with the field-tested results. Moreover, we find that by optimizing the turbines operation while considering the wake effect, we can gain an additional 8% in the total power. Finally, we relax the deterministic assumption for the incoming wind speed. The developed model is ultimately a PDE-constrained stochastic optimization model. Moreover, we develop an efficient numerical algorithm to solve this model. This numerical algorithm is based on the Monte Carlo simulation method, the pattern search method, the actuator line method and the corrected-explicit-implicit domain decomposition scheme which we develop for the parallel approximation of three-dimensional Navier-Stokes equations. The developed numerical algorithm, the parallel scheme, and the model are validated by a benchmark used in the literature and the experimental data. We find that by optimizing the turbines operation and considering the randomness of incoming wind speed, we can gain an additional 9% in total power

Non-linear model reduction for uncertainty quantification in large-scale inverse problems

We present a model reduction approach to the solution of large-scale statistical inverse problems in a Bayesian inference setting. A key to the model reduction is an efficient representation of the non-linear terms in the reduced model. To achieve this, we present a formulation that employs masked projection of the discrete equations; that is, we compute an approximation of the non-linear term using a select subset of interpolation points. Further, through this formulation we show similarities among the existing techniques of gappy proper orthogonal decomposition, missing point estimation, and empirical interpolation via coefficient-function approximation. The resulting model reduction methodology is applied to a highly non-linear combustion problem governed by an advection–diffusion-reaction partial differential equation (PDE). Our reduced model is used as a surrogate for a finite element discretization of the non-linear PDE within the Markov chain Monte Carlo sampling employed by the Bayesian inference approach. In two spatial dimensions, we show that this approach yields accurate results while reducing the computational cost by several orders of magnitude. For the full three-dimensional problem, a forward solve using a reduced model that has high fidelity over the input parameter space is more than two million times faster than the full-order finite element model, making tractable the solution of the statistical inverse problem that would otherwise require many years of CPU time. Copyright © 2009 John Wiley & Sons, Ltd.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/65031/1/2746_ftp.pd

Proceedings of the Eleventh UK Conference on Boundary Integral Methods (UKBIM 11), 10-11 July 2017, Nottingham Conference Centre, Nottingham Trent University

This book contains the abstracts and papers presented at the Eleventh UK Conference on Boundary Integral Methods (UKBIM 11), held at Nottingham Trent University in July 2017. The work presented at the conference, and published in this volume, demonstrates the wide range of work that is being carried out in the UK, as well as from further afield

Low-Rank Iterative Solvers for Large-Scale Stochastic Galerkin Linear Systems

Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, Dissertation, 2016von Dr. rer. pol. Akwum Agwu OnwuntaLiteraturverzeichnis: Seite 135-14

Cumulative reports and publications through December 31, 1990

This document contains a complete list of ICASE reports. Since ICASE reports are intended to be preprints of articles that will appear in journals or conference proceedings, the published reference is included when it is available

ADAPTIVE GRID BASED FINITE DIFFERENCE METHODS FOR SOLUTION OF HYPERBOLIC PDES: APPLICATION TO COMPUTATIONAL MECHANICS AND UNCERTAINTY QUANTIFICATION

Novel finite-difference based numerical methods for solution of linear and nonlinear hyperbolic partial differential equations (PDEs) using adaptive grids are proposed in this dissertation. The overall goal of this research is to improve the accuracy and/or computational efficiency of numerical solutions via the use of adaptive grids and suitable modifications of a given low-order order finite-difference scheme. These methods can be grouped in two broad categories. The first category of adaptive FD methods proposed in the dissertation attempt to reduce the truncation error and/or enhance the accuracy of the underlying numerical schemes via grid distribution alone. Some approaches for grid distribution considered include those based on (i) a moving uniform mesh/domain, (ii) adaptive gradient based refinement (AGBR) and (iii) unit local Courant-Freidrich-Lewy (CFL) number. The improvement in the accuracy which is obtained using these adaptive methods is limited by the underlying scheme formal order of accuracy. In the second category, the CFL based approach proposed in the first category was extended further using defect correction in order to improve the formal order of accuracy and computational efficiency significantly (i.e. by at least one order or higher). The proposed methods in this category are constructed based upon the analysis of the leading order error terms in the modified differential equation associated with the underlying partial differential equation and finite difference scheme. The error terms corresponding to regular and irregular perturbations are identified and the leading order error terms associated with regular perturbations are eliminated using a non-iterative defect correction approach while the error terms associated with irregular perturbations are eliminated using grid adaptation. In the second category of methods involving defect correction (or reduction of leading order terms of truncation error), we explored two different approaches for selection of adaptive grids. These are based on (i) optimal grid dis- tribution and (ii) remapping with monotonicity preserving interpolation. While the first category of methods may be preferred in view of ease of implementation and lower computational complexity, the second category of methods may be preferred in view of greater accuracy and computational efficiency. The two broad categories of methods, which have been applied to problems involving both bounded and unbounded domains, were also extended to multidimensional cases using a dimensional splitting approaches. The performance of these methods was demonstrated using several example problems in computational uncertainty quantification (CUQ) and computational mechanics. The results of the application of the proposed approaches all indicate improvement in both the accuracy and computational efficiency (by about three orders of magnitude in some selected cases) of underlying schemes. In the context of CUQ, all three proposed adaptive finite different solvers are combined with the Gauss-quadrature sampling technique in excitation space to obtain statistical quantities of interest for dynamical systems with parametric uncertainties from the solution of Liouville equation, which is a linear hyperbolic PDE. The numerical results for four canonical UQ problems show both enhanced computational efficiency and improved accuracy of the proposed adaptive FD solution of the Liouville equation compared to its standard/fixed domain FD solutions. Moreover, the results for canonical test problems in computational mechanics indicate that the proposed approach for increasing the formal order of the underlying FD scheme can be easily implemented in multidimensional spaces and gives an oscillation-free numerical solution with a desired order of accuracy in a reasonable computational time. This approach is shown to provide a better computational time compared to both the underlying scheme (by about three orders of magnitude) and standard FD methods of the same order of accuracy