Adaptive algorithms of nonlinear approximation with finite terms
From MaRDI portal
Publication:2463809
DOI10.1007/S10114-005-0913-XzbMATH Open1126.41008OpenAlexW2024207258MaRDI QIDQ2463809FDOQ2463809
Authors: Wenbin 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
Recommendations
Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cites Work
- Title not available (Why is that?)
- The best \(m\)-term approximation and greedy algorithms
- Restricted nonlinear approximation
- Nonlinear functionals of wavelet expansions -- adaptive reconstruction and fast evaluation
- Greedy algorithm and \(m\)-term trigonometric approximation
- Tree approximation and optimal encoding
- On unconditional polynomial bases in \(L_ p\) and Bergman spaces
- An adaptive compression algorithm in Besov spaces
- Chebyshev approximation by discrete superposition. Application to neural networks
Cited In (9)
- Adaptive Approximation of Nonlinear Operators
- Fast implementation of orthogonal greedy algorithm for tight wavelet frames
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
- Unified error estimate for weak biorthogonal greedy algorithms
- Optimality of the rescaled pure greedy learning algorithms
- Title not available (Why is that?)
- Adaptive approximations by greedy algorithms
- Fast adaptive algorithms in the non-standard form for multidimensional problems
- Optimum/adaptive incremental sequence in nonlinear analysis
This page was built for publication: Adaptive algorithms of nonlinear approximation with finite terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463809)
