๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation of a function and its derivative with a neural network

โœ Scribed by Pierre Cardaliaguet; Guillaume Euvrard


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
998 KB
Volume
5
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper deals with the approximation of both a function and its derivative by feedforward neural networks. We propose an explicit formula of approximation which is noise resistant and can be easily modified with the patterns. We apply these results to approach a function defined implicitly, which is useful in control theory.


๐Ÿ“œ SIMILAR VOLUMES


Properties and performance of orthogonal
โœ Chieh F. Sher; Ching-Shiow Tseng; Chen-San Chen ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 216 KB

Backpropagation neural network has been applied successfully to solving uncertain problems in many fields. However, unsolved drawbacks still exist such as the problems of local minimum, slow convergence speed, and the determination of initial weights and the number of processing elements. In this pa

Neural network approximation of continuo
โœ M.B. Stinchcombe ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 164 KB

This article characterizes the set of activation functions, bounded or unbounded, that allow feedforward network approximation of the continuous functions on the classic two-point compactification of R 1 . The characterization fails when the set of targets are continuous functions on the classic com

A unified approach for neural network-li
โœ Tianping Chen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 56 KB

In this paper, we give a universal approach to approximation of non-linear functionals and so called myopic input-output maps by neural network-like architectures. Strong theorems on equi-uniform approximation to functionals in abstract spaces are given. As applications, theorems on identification o

A symbolic method for network function a
โœ Aguirre, Idoia; Carlosena, Alfonso ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 160 KB

This letter presents a method to approximate a symbolic network function of any order to a second-order one. The method is based on the symbolic calculation of the displacement of the main roots of a polynomial due to the variations of a given parameter, assuming the ideal circuit (polynomial) of or