Adaptive algorithms of nonlinear approximation with finite terms
From MaRDI portal
Publication:2463809
DOI10.1007/s10114-005-0913-xzbMath1126.41008OpenAlexW2024207258MaRDI QIDQ2463809
Wen Bin Wei, Yuesheng Xu, Pei Xin Ye
Publication date: 6 December 2007
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-005-0913-x
Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items (2)
Optimality of the rescaled pure greedy learning algorithms ⋮ Unified error estimate for weak biorthogonal Greedy algorithms
Cites Work
- Unnamed Item
- The best \(m\)-term approximation and greedy algorithms
- Greedy algorithm and \(m\)-term trigonometric approximation
- Nonlinear functionals of wavelet expansions -- adaptive reconstruction and fast evaluation
- Chebyshev approximation by discrete superposition. Application to neural networks
- An adaptive compression algorithm in Besov spaces
- Restricted nonlinear approximation
- Tree approximation and optimal encoding
- On unconditional polynomial bases in \(L_ p\) and Bergman spaces
This page was built for publication: Adaptive algorithms of nonlinear approximation with finite terms