Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 59 min ago
PreprintCC BY 4.0arXiv

Computational study of Proper Orthogonal Decomposition methods for parametric approximations

Abstract

This paper studies the computational implementation of proper orthogonal decomposition reduced-order models (POD-ROMs) for evolutionary parametric time-dependent partial differential equations (PDEs). For a one-parameter model, many papers in the literature build the correlation matrix by projecting onto L2(Ω) even though optimal pointwise error estimates are proved when projecting onto H10(Ω). We compare both scenarios and observe the similar performance in practice. Additionally, to get the POD approximation it is necessary to compute the nonlinear term in the reduced equations. This requires a high computational cost that increases when the problem gets more complex. Numerical results in this paper show different approaches to address this issue. Discrete Empirical Interpolation Method (DEIM) is the most efficient approach. It reduces computational time by approximately half compared to computing the whole FEM formulation by a tensor construction while maintaining the same accuracy. For a multiparameter model, we analyze the new and standard method proposed in \cite{newmethod} using a two-dimensional Brusselator model to complement the results and support the error analysis with a more complex system.

Related

  1. Adaptive Local Proper Orthogonal Decomposition via Graph Partitioning and Provable Error-Bounded Lossy Compression for Parametric Series in Finite-Dimensional Function Spaces
    Roberto Nuca, Matteo Parsani, Lisandro Dalcin
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. Variationally correct loss functions for nonlinear parametric problems and their neural approximations
    Pablo Cortés Castillo, Wolfgang Dahmen, Jay Gopalakrishnan
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  3. Riemannian Structure and Optimization for a Class of Low-Parametric Orthogonal Matrices
    Ali Aliev, Maxim Rakhuba
    arXivPreprintarXiv licenceFull textGeometry & topologyNumerical analysis & scientific computingarXiv
  4. Global error estimators for parametric monotone nonlinearities and neural approximations
    Pablo Cortés Castillo, Wolfgang Dahmen, Jay Gopalakrishnan
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingStatisticsarXiv
  5. An adaptive localized orthogonal decomposition method for Helmholtz problems
    Yuwen Li, Chuxin Que
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
BibTeX
@misc{garciaarchilla2026computational,
  title = {{Computational study of Proper Orthogonal Decomposition methods for parametric approximations}},
  author = {Bosco García-Archilla and Alicia García-Mascaraque and Julia Novo},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.02583},
  eprint = {2609.02583},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.02583},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Computational study of Proper Orthogonal Decomposition methods for parametric approximations
AU  - Bosco García-Archilla
AU  - Alicia García-Mascaraque
AU  - Julia Novo
PY  - 2026
DA  - 2026/09/02
PB  - arXiv
DO  - 10.48550/arxiv.2609.02583
UR  - https://arxiv.org/abs/2609.02583
AB  - This paper studies the computational implementation of proper orthogonal decomposition reduced-order models (POD-ROMs) for evolutionary parametric time-dependent partial differential equations (PDEs). For a one-parameter model, many papers in the literature build the correlation matrix by projecting onto L^2(Ω) even though optimal pointwise error estimates are proved when projecting onto H^1_0(Ω). We compare both scenarios and observe the similar performance in practice. Additionally, to get the POD approximation it is necessary to compute the nonlinear term in the reduced equations. This requires a high computational cost that increases when the problem gets more complex. Numerical results in this paper show different approaches to address this issue. Discrete Empirical Interpolation Method (DEIM) is the most efficient approach. It reduces computational time by approximately half compared to computing the whole FEM formulation by a tensor construction while maintaining the same accuracy. For a multiparameter model, we analyze the new and standard method proposed in \cite{newmethod} using a two-dimensional Brusselator model to complement the results and support the error analysis with a more complex system.
ER  -