2006
DOI: 10.1016/j.cam.2005.04.019
|View full text |Cite
|
Sign up to set email alerts
|

Constructive approximate interpolation by neural networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 81 publications
(40 citation statements)
references
References 17 publications
0
40
0
Order By: Relevance
“…To verify the above theory and to show the wavelet neural networks have faster convergence rate than the neural networks in [12,13], we give five examples through f ðxÞ À X a ðx; AðnÞÞ j j ¼ f ðxÞ À f ðx i Þ þ X e ðx i ; AðnÞÞ À X a ðx; AðnÞÞ j j ¼ f ðxÞ À f ðx i Þ þ X e ðx i ; AðnÞÞ À X e ðx; AðnÞÞ þ X e ðx; AðnÞÞ À X a ðx; AðnÞÞ j j…”
Section: Unidimensional Numerical Experimentsmentioning
confidence: 93%
See 2 more Smart Citations
“…To verify the above theory and to show the wavelet neural networks have faster convergence rate than the neural networks in [12,13], we give five examples through f ðxÞ À X a ðx; AðnÞÞ j j ¼ f ðxÞ À f ðx i Þ þ X e ðx i ; AðnÞÞ À X a ðx; AðnÞÞ j j ¼ f ðxÞ À f ðx i Þ þ X e ðx i ; AðnÞÞ À X e ðx; AðnÞÞ þ X e ðx; AðnÞÞ À X a ðx; AðnÞÞ j j…”
Section: Unidimensional Numerical Experimentsmentioning
confidence: 93%
“…In this section, we discuss the uniform approximation to continuous functions for the given exact interpolation (9) and approximate interpolation (12). We consider the uniform approximation with the following features:…”
Section: Unidimensional Uniform Approximation By Means Of Wavelet Neumentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, the fact ''If / is sigmoidal, continuous and there exists a point c such that / 0 ðcÞ-0, then an interpolation problem with 2n þ 1 samples can be approximated with arbitrary precision by a net with n þ 1 neurons" was given. Recently, Llanas and Sainz [22] studied the existence and construction of e-approximate interpolation networks. They first considered that the activation function / is a nondecreasing sigmoidal function satisfying the condition (2) and gave a new and quantitative proof of the fact that n þ 1 hidden neurons can learn n þ 1 distinct samples with zero error.…”
Section: Background and Motivationmentioning
confidence: 99%
“…The literature [5][6][7][8] has studied the approximation problems of one variable functions by constructive feedforward neural networks, but when the related conclusions are extended to multidimensional functions, the question becomes quite complex and too strict conditions of convergence are requested, the actual operation becomes difficulty relatively. But in the literature [9], the connection weight of RBF neural networks is obtained through the various learning algorithms; therefore, the weight has certain instability.…”
Section: Introductionmentioning
confidence: 99%