Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. On dimension reduction in Gaussian filters

On dimension reduction in Gaussian filters

Thumbnail Image
Download
Name

Marzouk_On dimension.pdf

Size

433.65 KB

Format

Adobe PDF

Checksum (MD5)

182a139c8e1fd553b191031f45cf8c04

Author(s)
Hakkarainen, Janne
•
Solonen, Antti
•
Cui, Tiangang
•
Marzouk, Youssef M
Date Issued
March 2016
Journal
Inverse Problems
Publisher
IOP Publishing
Citation
Solonen, Antti et al. “On Dimension Reduction in Gaussian Filters.” Inverse Problems 32.4 (2016): 45003.
Version
Author's final manuscript
Abstract
A priori dimension reduction is a widely adopted technique for reducing the computational complexity of stationary inverse problems. In this setting, the solution of an inverse problem is parameterized by a low-dimensional basis that is often obtained from the truncated Karhunen–Loève expansion of the prior distribution. For high-dimensional inverse problems equipped with smoothing priors, this technique can lead to drastic reductions in parameter dimension and significant computational savings. In this paper, we extend the concept of a priori dimension reduction to non-stationary inverse problems, in which the goal is to sequentially infer the state of a dynamical system. Our approach proceeds in an offline–online fashion. We first identify a low-dimensional subspace in the state space before solving the inverse problem (the offline phase), using either the method of 'snapshots' or regularized covariance estimation. Then this subspace is used to reduce the computational complexity of various filtering algorithms—including the Kalman filter, extended Kalman filter, and ensemble Kalman filter—within a novel subspace-constrained Bayesian prediction-and-update procedure (the online phase). We demonstrate the performance of our new dimension reduction approach on various numerical examples. In some test cases, our approach reduces the dimensionality of the original problem by orders of magnitude and yields up to two orders of magnitude in computational savings.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/104940
DOI of Published Version
https://doi.org/10.1088/0266-5611/32/4/045003
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.