On greedy algorithm approximating Kolmogorov widths in Banach spaces

DOI10.1016/j.jmaa.2014.11.054zbMath1310.41031OpenAlexW1994263319MaRDI QIDQ482002

Przemysław 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 algorithmreduced basis methodKolmogorov widthsnon-linear approximation

Mathematics Subject Classification ID

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

Related Items (4)

Greedy algorithms and Kolmogorov widths in Banach spaces ⋮ Linear reconstructions and the analysis of the stable sampling rate ⋮ Data Assimilation in Reduced Modeling ⋮ Kolmogorov \(n\)-widths of function classes induced by a non-degenerate differential operator: a convex duality approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast subspace approximation via greedy least-squares
• A priori convergence theory for reduced-basis approximations of single-parameter elliptic partial differential equations
• 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
• RB (reduced basis) for RB (Rayleigh-Bénard)
• A prioriconvergence of the Greedy algorithm for the parametrized reduced basis method
• Convergence Rates for Greedy Algorithms in Reduced Basis Methods
• A Reduced Basis Method for Parametrized Variational Inequalities
• Normed Linear Spaces Equivalent to Inner Product Spaces

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