Entropy-based convergence rates of greedy algorithms

DOI10.1142/s0218202524500143zbMath1540.41033MaRDI QIDQ6551364

Jonathan W. Siegel, Yuwen Li

Publication date: 6 June 2024

Published in: M\(^3\)AS. Mathematical Models \& Methods in Applied Sciences (Search for Journal in Brave)

zbMATH Keywords

reduced basis methodnonlinear approximationentropy numbersKolmogorov \(n\)-widthorthogonal greedy algorithmsymmetric convex hull

Mathematics Subject Classification ID

Error bounds for boundary value problems involving PDEs (65N15) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

This page was built for publication: Entropy-based convergence rates of greedy algorithms