Abstract

Time complexity is an important measure of algorithm. The main purpose of this paper is to research the time complexity of the second category of Padé weight function neural network and find out the factors which affect its time complexity. In this paper, firstly, the second category of Padé weight function neural network algorithm is introduced. Then through the analysis of the key steps of the algorithm, the time complexity is given. After MATLAB simulation, the experimental results verify the theoretical analysis of the results. Therefore, its time complexity is related to input dimension, output dimension and the number of training samples.

Full Text
Paper version not known

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 call

Disclaimer: 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.