Convergence rates for matrix P-greedy variants

DOI10.1007/978-3-030-55874-1_119zbMATH Open1475.65004OpenAlexW3158106646MaRDI QIDQ3379545FDOQ3379545

Authors: Dominik Wittwar, B. Haasdonk 

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

Recommendations

• Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
• Greedy Kernel Approximation for Sparse Surrogate Modeling
• A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
• Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces
• Kernel approximation: from regression to interpolation

Mathematics Subject Classification ID

Numerical interpolation (65D05)

Cites Work

• On Learning Vector-Valued Functions
• Kernels for vector-valued functions: a review
• Title not available (Why is that?)
• Convergence rates for greedy algorithms in reduced basis methods
• Sampling inequalities for infinitely smooth functions, with applications to interpolation and machine learning
• Greedy algorithms for reduced bases in Banach spaces
• Convergence rates of the POD-greedy method
• Scattered Data Approximation
• Convergence rate of the data-independent $P$-greedy algorithm in kernel-based approximation

Cited In (1)

• Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy

This page was built for publication: Convergence rates for matrix P-greedy variants

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