Error analysis of an incremental proper orthogonal decomposition algorithm for PDE simulation data

From MaRDI portal
Publication:2292000

DOI10.1016/J.CAM.2019.112525zbMATH Open1503.65074arXiv1803.06313OpenAlexW2794016787MaRDI QIDQ2292000FDOQ2292000


Authors: Hiba Fareed, John R. Singler Edit this on Wikidata


Publication date: 31 January 2020

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: In our earlier work [Fareed et al., Comput. Math. Appl. 75 (2018), no. 6, 1942-1960], we proposed an incremental SVD algorithm with respect to a weighted inner product to compute the proper orthogonal decomposition (POD) of a set of simulation data for a partial differential equation (PDE) without storing the data. In this work, we perform an error analysis of the incremental SVD algorithm. We also modify the algorithm to incrementally update both the SVD and an error bound when a new column of data is added. We show the algorithm produces the exact SVD of an approximate data matrix, and the operator norm error between the approximate and exact data matrices is bounded above by the computed error bound. This error bound also allows us to bound the error in the incrementally computed singular values and singular vectors. We illustrate our analysis with numerical results for three simulation data sets from a 1D FitzHugh-Nagumo PDE system with various choices of the algorithm truncation tolerances.


Full work available at URL: https://arxiv.org/abs/1803.06313




Recommendations




Cites Work


Cited In (9)

Uses Software





This page was built for publication: Error analysis of an incremental proper orthogonal decomposition algorithm for PDE simulation data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292000)