Pointwise Error Bounds in POD Methods Without Difference Quotients

Abstract In this paper we consider proper orthogonal decomposition (POD) methods that do not include difference quotients (DQs) of snapshots in the data set. The inclusion of DQs have been shown in the literature to be a key element in obtaining error bounds that do not degrade with the number of snapshots. More recently, the inclusion of DQs has allowed to obtain pointwise (as opposed to averaged) error bounds that decay with the same convergence rate (in terms of the POD singular values) as averaged ones. In the present paper, for POD methods not including DQs in their data set, we obtain error bounds that do not degrade with the number of snapshots if the function from where the snapshots are taken has certain degree of smoothness. Moreover, the rate of convergence is as close as that of methods including DQs as the smoothness of the function providing the snapshots allows. We do this by obtaining discrete counterparts of Agmon and interpolation inequalities in Sobolev spaces. Numerical experiments validating these estimates are also presented.

Authors

Institutions

Publication Details

Journal
Journal of Scientific Computing
Published
2025-03-08
DOI
https://doi.org/10.1007/s10915-025-02838-9
Citations
4
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
5.29

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Pointwise Error Bounds in POD Methods Without Difference Quotients

Bosco Garcı́a-Archilla, Julia Novo
4 citations
Journal of Scientific Computing
Model Reduction and Neural Networks
5.29
article

Pointwise Error Bounds in POD Methods Without Difference Quotients

Bosco Garcı́a-Archilla, Julia Novo
article en
4 citations

Abstract

Abstract In this paper we consider proper orthogonal decomposition (POD) methods that do not include difference quotients (DQs) of snapshots in the data set. The inclusion of DQs have been shown in the literature to be a key element in obtaining error bounds that do not degrade with the number of snapshots. More recently, the inclusion of DQs has allowed to obtain pointwise (as opposed to averaged) error bounds that decay with the same convergence rate (in terms of the POD singular values) as averaged ones. In the present paper, for POD methods not including DQs in their data set, we obtain error bounds that do not degrade with the number of snapshots if the function from where the snapshots are taken has certain degree of smoothness. Moreover, the rate of convergence is as close as that of methods including DQs as the smoothness of the function providing the snapshots allows. We do this by obtaining discrete counterparts of Agmon and interpolation inequalities in Sobolev spaces. Numerical experiments validating these estimates are also presented.

Journal of Scientific ComputingVol. 103(1)
Universidad Autónoma de Madrid (ES), Universidad de Sevilla (ES)
Universidad de Sevilla, Ministerio de Ciencia e Innovación
Openalex Percentile: Top 5%
Model Reduction and Neural Networks
5.29
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.