Some New Convergence Analysis and Applications of POD-Greedy Algorithms

Abstract

In this article, we derive a novel convergence estimate for the weak POD-Greedy method with multiple POD modes and variable greedy thresholds in terms of the entropy numbers of the parametric solution manifold. Combining the POD with the Empirical Interpolation Method (EIM), we also propose an EIM-POD-Greedy method with entropy-based convergence analysis for simultaneously approximating parametrized target functions by separable approximants. Several numerical experiments are presented to demonstrate the effectiveness of the proposed algorithm compared to traditional methods.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…