Adaptive algorithms of nonlinear approximation with finite terms
From MaRDI portal
Publication:2463809
Recommendations
Cites work
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- An adaptive compression algorithm in Besov spaces
- Chebyshev approximation by discrete superposition. Application to neural networks
- Greedy algorithm and \(m\)-term trigonometric approximation
- Nonlinear functionals of wavelet expansions -- adaptive reconstruction and fast evaluation
- On unconditional polynomial bases in \(L_ p\) and Bergman spaces
- Restricted nonlinear approximation
- The best \(m\)-term approximation and greedy algorithms
- Tree approximation and optimal encoding
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
- scientific article; zbMATH DE number 1404616 (Why is no real title available?)
- 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)