Results 291 to 300 of about 670,956 (337)

Nonlinear approximation via compositions [PDF]

Neural Networks, 2019
Given a function dictionary $\cal D$ and an approximation budget $N\in\mathbb{N}^+$, nonlinear approximation seeks the linear combination of the best $N$ terms $\{T_n\}_{1\le n\le N}\subseteq{\cal D}$ to approximate a given function $f$ with the minimum approximation error\[\varepsilon_{L,f}:=\min_{\{g_n\}\subseteq{\mathbb{R}},\{T_n\}\subseteq{\cal D}}\
Zuowei Shen, Haizhao Yang, Shijun Zhang
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Restricted Nonlinear Approximation

Constructive Approximation, 2000
This paper introduces a new form of nonlinear approximation called restricted approximation. It is a generalization of \(n\)-term wavelet approximation in which a weight function is used to control the terms in the wavelet expansion of the approximant.
Cohen, A., DeVore, R. A., Hochmuth, R.
exaly   +3 more sources

Nonlinear Approximation of Random Functions

SIAM Journal on Applied Mathematics, 1997
Summary: Given an orthonormal basis and a certain class \(X\) of vectors in a Hilbert space \(H\), consider the following nonlinear approximation process: approach a vector \(x\in X\) by keeping only its \(N\) largest coordinates, and let \(N\) go to infinity.
Albert Cohen 0002, Jean-Pierre D'Ales
openaire   +1 more source

Nonlinear Wavelet Approximation in BMO

Constructive Approximation, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivanov, Kamen G., Petrushev, Pencho
openaire   +1 more source

An Analysis of Approximate Nonlinear Elimination

SIAM Journal on Scientific Computing, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul J. Lanzkron, Donald J. Rose, James T. Wilkes   +2 more
openaire   +2 more sources

Nonlinear Methods of Approximation

Foundations of Computational Mathematics, 2003
This extensive survey paper is, according to its author, complementary to the survey by \textit{R. A. DeVore} [Acta Numerica 7, 51--150 (1998; Zbl 0931.65007)]. The central concept is \(m\)-term approximation, that is, approximation of a given element \(f\) of a Banach space \(X\) by linear combinations of \(\leq m\) elements \(g_k\) taken from some ...
openaire   +2 more sources

Approximations for nonlinear functions

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 1992
By applying a version of the Stone-Weierstrass theorem the author shows that a continuous real-valued function on a nonempty compact topological space can be uniformly approximated by a sum of the form \[ a_ 1 e^{\phi(x,p_ 1)}+\cdots+ a_ me^{\phi(x,p_ m)}. \] {}.
openaire   +2 more sources

Minimax nonlinear approximation by approximation on subsets

Communications of the ACM, 1972
A possible algorithm for minimax approximation on an infinite set X consists in choosing a sequence of finite point sets { X k } which fill out X and taking a limit of minimax approximations on X
openaire   +2 more sources