Aveiro method in reproducing kernel Hilbert spaces under complete dictionary

DOI10.1002/MMA.4526zbMATH Open1382.30005arXiv1604.07592OpenAlexW2473757290MaRDI QIDQ3134038FDOQ3134038

Authors: Weixiong Mai, Tao Qian 

Publication date: 8 February 2018

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Abstract: Aveiro Method is a sparse representation method in reproducing kernel Hilbert spaces (RKHS) that gives orthogonal projections in linear combinations of reproducing kernels over uniqueness sets. It, however, suffers from determination of uniqueness sets in the underlying RKHS. In fact, in general spaces, uniqueness sets are not easy to be identified, let alone the convergence speed aspect with Aveiro Method. To avoid those difficulties we propose an anew Aveiro Method based on a dictionary and the matching pursuit idea. What we do, in fact, are more: The new Aveiro method will be in relation to the recently proposed, the so called Pre-Orthogonal Greedy Algorithm (P-OGA) involving completion of a given dictionary. The new method is called Aveiro Method Under Complete Dictionary (AMUCD). The complete dictionary consists of all directional derivatives of the underlying reproducing kernels. We show that, under the boundary vanishing condition, bring available for the classical Hardy and Paley-Wiener spaces, the complete dictionary enables an efficient expansion of any given element in the Hilbert space. The proposed method reveals new and advanced aspects in both the Aveiro Method and the greedy algorithm.

Full work available at URL: https://arxiv.org/abs/1604.07592

Recommendations

• Aveiro Discretization Method in Mathematics: A New Discretization Principle
• Sparse representations in reproducing kernels of operator equations
• Reproducing kernel sparse representations in relation to operator equations
• scientific article; zbMATH DE number 1322909
• Adaptive greedy approximations

zbMATH Keywords

pre-orthogonal greedy algorithm

Mathematics Subject Classification ID

Hardy spaces (30H10) Approximation by arbitrary linear expressions (41A45) Kernel functions in one complex variable and applications (30C40)

Cited In (7)

• Rational approximation in a class of weighted Hardy spaces
• Reproducing kernel sparse representations in relation to operator equations
• The Fourier type expansions on tubes
• Rational approximation in Hardy spaces on strips
• Greedy Algorithms and Rational Approximation in One and Several Variables
• Adaptive decompositions in monogenic reproducing kernel Hilbert spaces of Paley-Wiener type
• A theory on non-constant frequency decompositions and applications

This page was built for publication: Aveiro method in reproducing kernel Hilbert spaces under complete dictionary

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