Convergence Rates for Matrix P-Greedy Variants

DOI10.1007/978-3-030-55874-1_119zbMath1475.65004OpenAlexW3158106646MaRDI QIDQ3379545

Bernard Haasdonk, Dominik Wittwar

Publication date: 27 September 2021

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-55874-1_119

Mathematics Subject Classification ID

Numerical interpolation (65D05)

Cites Work

• Unnamed Item
• Sampling inequalities for infinitely smooth functions, with applications to interpolation and machine learning
• Greedy algorithms for reduced bases in Banach spaces
• Kernels for Vector-Valued Functions: A Review
• Convergence Rates for Greedy Algorithms in Reduced Basis Methods
• Convergence Rates of the POD–Greedy Method
• Convergence rate of the data-independent $P$-greedy algorithm in kernel-based approximation
• On Learning Vector-Valued Functions
• Scattered Data Approximation

This page was built for publication: Convergence Rates for Matrix P-Greedy Variants