\"We propose an incremental algorithm to compute the proper orthogonal decomposition (POD) of simulation data for a partial differential equation. Specifically, we modify an incremental matrix SVD algorithm of Brand to accommodate data arising from Galerkin-type simulation methods for time dependent PDEs. We introduce an incremental SVD algorithm with respect to a weighted inner product to compute the proper orthogonal decomposition (POD). The algorithm is applicable to data generated by many numerical methods for PDEs, including finite element and discontinuous Galerkin methods. We also modify the algorithm to initialize and incrementally update both the SVDand an error bound during the time stepping in a PDE solver without storing the simulation data. 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 demonstrate the effectiveness of the algorithm using finite element computations for a 1D Burgers' equation, a 1D FitzHugh-Nagumo PDE system, and a 2D Navier-Stokes problem\"--Abstract, page iv.
","abstract_html":"<p>"We propose an incremental algorithm to compute the proper orthogonal decomposition (POD) of simulation data for a partial differential equation. Specifically, we modify an incremental matrix SVD algorithm of Brand to accommodate data arising from Galerkin-type simulation methods for time dependent PDEs. We introduce an incremental SVD algorithm with respect to a weighted inner product to compute the proper orthogonal decomposition (POD). The algorithm is applicable to data generated by many numerical methods for PDEs, including finite element and discontinuous Galerkin methods. We also modify the algorithm to initialize and incrementally update both the SVDand an error bound during the time stepping in a PDE solver without storing the simulation data. 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 demonstrate the effectiveness of the algorithm using finite element computations for a 1D Burgers' equation, a 1D FitzHugh-Nagumo PDE system, and a 2D Navier-Stokes problem"--Abstract, page iv.</p>","abstract_has_math":false,"creators":["Fareed, Hiba"],"institution":"Missouri University of Science and Technology","degree_name":"Ph. D. in Mathematics","degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-07-24T03:18:43Z","subjects":["Error Analysis","Finite Element Method","Incremental Algorithm","Proper Orthogonal Decomposition","Weighted Norm","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://scholarsmine.mst.edu/doctoral_dissertations/2671","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Fareed, Hiba"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:type","label":"Dc Type","values":["Dissertation - Open Access"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D. in Mathematics"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Missouri University of Science and Technology"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Error Analysis","Finite Element Method","Incremental Algorithm","Proper Orthogonal Decomposition","Weighted Norm","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarsmine.mst.edu/doctoral_dissertations/2671"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["\"We propose an incremental algorithm to compute the proper orthogonal decomposition (POD) of simulation data for a partial differential equation. Specifically, we modify an incremental matrix SVD algorithm of Brand to accommodate data arising from Galerkin-type simulation methods for time dependent PDEs. We introduce an incremental SVD algorithm with respect to a weighted inner product to compute the proper orthogonal decomposition (POD). The algorithm is applicable to data generated by many numerical methods for PDEs, including finite element and discontinuous Galerkin methods. We also modify the algorithm to initialize and incrementally update both the SVDand an error bound during the time stepping in a PDE solver without storing the simulation data. 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 demonstrate the effectiveness of the algorithm using finite element computations for a 1D Burgers' equation, a 1D FitzHugh-Nagumo PDE system, and a 2D Navier-Stokes problem\"--Abstract, page iv.
"]},{"key":"dc:title","label":"Title","values":["Incremental proper orthogonal decomposition for PDE simulation data: Algorithms and analysis"]}]}],"canonical_facts":{"dc:creator":["Fareed, Hiba"],"dc:description.abstract":["\"We propose an incremental algorithm to compute the proper orthogonal decomposition (POD) of simulation data for a partial differential equation. Specifically, we modify an incremental matrix SVD algorithm of Brand to accommodate data arising from Galerkin-type simulation methods for time dependent PDEs. We introduce an incremental SVD algorithm with respect to a weighted inner product to compute the proper orthogonal decomposition (POD). The algorithm is applicable to data generated by many numerical methods for PDEs, including finite element and discontinuous Galerkin methods. We also modify the algorithm to initialize and incrementally update both the SVDand an error bound during the time stepping in a PDE solver without storing the simulation data. 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 demonstrate the effectiveness of the algorithm using finite element computations for a 1D Burgers' equation, a 1D FitzHugh-Nagumo PDE system, and a 2D Navier-Stokes problem\"--Abstract, page iv.
"],"dc:identifier":["https://scholarsmine.mst.edu/doctoral_dissertations/2671"],"dc:subject":["Error Analysis","Finite Element Method","Incremental Algorithm","Proper Orthogonal Decomposition","Weighted Norm","Mathematics"],"dc:title":["Incremental proper orthogonal decomposition for PDE simulation data: Algorithms and analysis"],"dc:type":["Dissertation - Open Access"],"thesis:degree_name":["Ph. D. in Mathematics"],"thesis:institution_name":["Missouri University of Science and Technology"]},"updated_at":"2026-07-24T03:18:43Z"}