%0 Journal Article %A Yan, Liang %A Zhou, Tao %D 2019 %I Begell House %K Bayesian inverse problems, ensemble Kalman inversion, multifidelity polynomial chaos, surrogate modeling %N 3 %P 205-220 %R 10.1615/Int.J.UncertaintyQuantification.2019029059 %T AN ADAPTIVE MULTIFIDELITY PC-BASED ENSEMBLE KALMAN INVERSION FOR INVERSE PROBLEMS %U https://www.dl.begellhouse.com/journals/52034eb04b657aea,1b58af220d28d8e5,0346063c262ea4bc.html %V 9 %X The ensemble Kalman inversion (EKI), as a derivative-free methodology, has been widely used in the parameter estimation of inverse problems. Unfortunately, its cost may become moderately large for systems described by highdimensional nonlinear PDEs, as EKI requires a relatively large ensemble size to guarantee its performance. In this paper, we propose an adaptive multifidelity polynomial chaos (PC) based EKI technique to address this challenge. Our new strategy combines a large number of low-order PC surrogate model evaluations and a small number of high-fidelity forward model evaluations, yielding a multifidelity approach. Specifically, we present a new approach that adaptively constructs and refines a local multifidelity PC surrogate during the EKI simulation. Since the forward model evaluations are only required for updating the low-order local multifidelity PC model, whose number can be much smaller than the total ensemble size of the classic EKI, the entire computational costs are thus significantly reduced. The new algorithm was tested through the two-dimensional time fractional inverse diffusion problems and demonstrated great effectiveness in comparison with PC-based EKI and classic EKI. %8 2019-06-27