Convergence analysis of the generalized empirical interpolation method

From MaRDI portal



Abstract: Let F be a compact set of a Banach space mathcalX. This paper analyses the "Generalized Empirical Interpolation Method" (GEIM) which, given a function finF, builds an interpolant mathcalJn[f] in an n-dimensional subspace XnsubsetmathcalX with the knowledge of n outputs (sigmai(f))i=1n, where sigmaiinmathcalX′ and mathcalX′ is the dual space of mathcalX. The space Xn is built with a greedy algorithm that is adapted to F in the sense that it is generated by elements of F itself. The algorithm also selects the linear functionals (sigmai)i=1n from a dictionary SigmasubsetmathcalX′. In this paper, we study the interpolation error maxfinFVertf−mathcalJn[f]VertmathcalX by comparing it with the best possible performance on an n-dimensional space, i.e., the Kolmogorov n-width of F in mathcalX, dn(F,mathcalX). For polynomial or exponential decay rates of dn(F,mathcalX), we prove that the interpolation error has the same behavior modulo the norm of the interpolation operator. Sharper results are obtained in the case where mathcalX is a Hilbert space.




Cited in
(34)








This page was built for publication: Convergence analysis of the generalized empirical interpolation method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814454)