
doi: 10.1007/bf02836480
Summary: We study the degree of approximation by superpositions of a sigmoidal function. We mainly consider the univariate case. If \(f\) is a continuous function, we prove that for any bounded sigmoidal function \(\sigma\), \(d_{n,\sigma}(f)\leq \|\sigma\| \omega \bigl( f,{1\over{n+1}}\bigr)\). For the Heaviside function \(H(x)\), we prove that \(d_{n,H}(f)\leq \omega \bigl( f, {1\over {2n+1)}} \bigr)\). If \(f\) is a continuous function of bounded variation, we prove that \(d_{n,\sigma} (f)\leq {{\|\sigma\|} \over {n+1}} V(f)\) and \(d_{n,H}\leq {1\over {2n+1}} V(f)\). For the Heaviside function, the coefficient 1 and the approximation orders are the best possible. We compare these results with the classical Jackson and Bernstein theorems, and make some conjectures for further study.
sigmoidal function, Rate of convergence, degree of approximation, Approximation by other special function classes, Heaviside function
sigmoidal function, Rate of convergence, degree of approximation, Approximation by other special function classes, Heaviside function
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 49 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
