On greedy algorithm approximating Kolmogorov widths in Banach spaces

DOI10.1016/J.JMAA.2014.11.054MaRDI QIDQ482002zbMATH OpenOpenAlexFDO

Authors P. Wojtaszczyk

Publication date 19 December 2014

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jmaa.2014.11.054

zbMATH Keywords

greedy algorithmnon-linear approximationreduced basis methodKolmogorov widths

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Asymptotic theory of Banach spaces (46B06)

Recommendations

• Greedy algorithms and Kolmogorov widths in Banach spaces
• Greedy algorithms for reduced bases in Banach spaces
• Convergence of some greedy algorithms in Banach spaces
• Convergence rates for greedy algorithms in reduced basis methods
• On a greedy algorithm in the space \(L_p[0,1]\)

Cites work

• scientific article; zbMATH DE number 3877692 (Why is no real title available?)
• scientific article; zbMATH DE number 44588 (Why is no real title available?)
• scientific article; zbMATH DE number 194266 (Why is no real title available?)
• scientific article; zbMATH DE number 1223845 (Why is no real title available?)
• scientific article; zbMATH DE number 713342 (Why is no real title available?)
• scientific article; zbMATH DE number 2206777 (Why is no real title available?)
• scientific article; zbMATH DE number 3357080 (Why is no real title available?)
• A priori convergence theory for reduced-basis approximations of single-parameter elliptic partial differential equations
• A reduced basis method for parametrized variational inequalities
• Basic concepts in the geometry of Banach spaces
• Convergence rates for greedy algorithms in reduced basis methods
• Fast subspace approximation via greedy least-squares
• Global a priori convergence theory for reduced-basis approximations of single-parameter symmetric coercive elliptic partial differential equations
• Greedy algorithms for reduced bases in Banach spaces
• Normed Linear Spaces Equivalent to Inner Product Spaces
• RB (reduced basis) for RB (Rayleigh-Bénard)
• \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method

Cited in

(7)

• Kolmogorov n-widths of function classes induced by a non-degenerate differential operator: a convex duality approach
• Data Assimilation in Reduced Modeling
• Convergence rates for greedy algorithms in reduced basis methods
• Linear reconstructions and the analysis of the stable sampling rate
• Convergence analysis of the generalized empirical interpolation method
• Greedy algorithms and Kolmogorov widths in Banach spaces
• Entropy-based convergence rates of greedy algorithms

This page was built for publication: On greedy algorithm approximating Kolmogorov widths in Banach spaces

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