Greedy Algorithms for Reduced Bases in Banach Spaces

DOI10.1007/s00365-013-9186-2MaRDI QIDQ6824684FDO

Authors Ronald Devore, Guergana Petrova, Przemyslaw Wojtaszczyk

Publication date 26 February 2013

Published in Constructive Approximation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00365-013-9186-2

Cited in

(6)

• Greedy Method
• Convergence rates for pivoted QR and LU
• Data-Driven Model Order Reduction with pyMOR
• Simple-regret rates and minimax optimality of fixed-prior expected improvement in Matérn and squared-exponential RKHSs
• Successive Schur-Riesz Analysis for Approximation
• A sharp bound for sampling widths in the uniform norm: kernel D-optimal designs and oversampling

This page was built for publication: Greedy Algorithms for Reduced Bases in Banach Spaces

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