Chebyshev approximation by discrete superposition. Application to neural networks

DOI10.1007/BF02124739zbMath0860.65007MaRDI QIDQ1923884

Manuela Nees

Publication date: 21 April 1997

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmserror boundcontinuous functionsChebyshev approximationdiscrete superposition

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Related Items (1)

Adaptive algorithms of nonlinear approximation with finite terms

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation by superposition of sigmoidal and radial basis functions
• Approximative versions of Kolmogorov's superposition theorem, proved constructively
• Multilayer feedforward networks are universal approximators
• Metric Entropy, Widths, and Superpositions of Functions
• On the representation of continuous functions of many variables by superposition of continuous functions of one variable and addition
• On the Structure of Continuous Functions of Several Variables
• Approximation by superpositions of a sigmoidal function

This page was built for publication: Chebyshev approximation by discrete superposition. Application to neural networks