Abstract
A three-layer feed forward artificial neural network with trigonometric hidden-layer units is constructed. The essential order of approximation for the network which can simultaneously approximate function and its derivatives is estimated and a theorem of saturation (the largest capacity of simultaneous approximation) is proved. These results can precisely characterize the approximation ability of the network and the relationship among the rate of simultaneous approximation, the topological structure of hidden-layer and the properties of approximated functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
