Search arXivSearch

arXiv · 2609.02583

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 $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.

Explore related subjects

Keep this discovery

BibTeXRIS

Bosco García-Archilla, Alicia García-Mascaraque, Julia Novo. 2026-09-02. Computational study of Proper Orthogonal Decomposition methods for parametric approximations. https://arxiv.org/abs/2609.02583

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA