2022/10/17 by Joseph Hart, Hart, Joseph, Bart van Bloemen Waanders +1
Decision Sciences · Physics and Astronomy · Computer Science · #Probabilistic and Robust Engineering Design #Model Reduction and Neural Networks #Matrix Theory and Algorithms
paper · pdf · doi:10.48550/arxiv.2210.09037
Model discrepancy, defined as the difference between model predictions and reality, is ubiquitous in computational models for physical systems. It is common to derive partial differential equations (PDEs) from first principles physics, but make simplifying assumptions to produce tractable expressions for the governing equations or closure models. These PDEs are then used for analysis and design to achieve desirable performance. For instance, the end goal may be to solve a PDE-constrained optimization (PDECO) problem. This article considers the sensitivity of PDECO problems with respect to model discrepancy. We introduce a general representation of the discrepancy and apply post-optimality sensitivity analysis to derive an expression for the sensitivity of the optimal solution with respect to the discrepancy. An efficient algorithm is presented which combines the PDE discretization, post-optimality sensitivity operator, adjoint-based derivatives, and a randomized generalized singular value decomposition to enable scalable computation. Kronecker product structure in the underlying linear algebra and corresponding infrastructure in PDECO is exploited to yield a general purpose algorithm which is computationally efficient and portable across a range of applications. Known physics and problem specific characteristics of discrepancy are imposed through user specified weighting matrices. We demonstrate our proposed framework on two nonlinear PDECO problems to highlight its computational efficiency and rich insight.