Study on Comparison of Fast BP Algorithms

In this paper, the characteristic and performance of various fast BP algorithms are generalized and contrasted through study on simulation of nonlinear function approximation experiment. It is demonstrated LevenbergMarquardt algorithm′s convergence speed is the quickest and its performance is the most excellent for moderate scale feedforward neural network.