Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm

We first study the error performances of the Vector Weak Rescaled Pure Greedy Algorithm for simultaneous approximation with respect to a dictionary D in a Hilbert space. We show that the convergence rate of the Vector Weak Rescaled Pure Greedy Algorithm on A1(D) and the closure of the convex hull of...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics (Basel) Vol. 11; no. 9; p. 2020
Main Authors:	Xu, Xu, Guo, Jinyu, Ye, Peixin, Zhang, Wenhui
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 24.04.2023
Subjects:	Algorithms Analysis Approximation Banach spaces Chebyshev approximation Computational geometry Convergence Convexity Dictionaries Efficiency Error analysis Food science greedy algorithm Greedy algorithms Hilbert space Hilbert spaces Machine learning Mathematical analysis modulus of smoothness Signal processing uniformly smooth Banach spaces vector approximation
ISSN:	2227-7390, 2227-7390
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!