Skip to main content
Log in

Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equations

  • Published:
Annals of the Institute of Statistical Mathematics Aims and scope Submit manuscript

Summary

Global analyses are given to continuous analogues of the Levenberg-Marquardt methoddx/dt=−(J t(x)J(x)+δI)−1Jt(x)g(x), and the Newton-Raphson-Ben-Israel methoddx/dt=−J +(x)g(x), for solving an over- and under-determined systemg(x)=0 of nonlinear equations. The characteristics of both methods are compared. Erros in some literature which dealt with related continous analogue methods are pointed out.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ben Israel, A. (1966). A Newton-Raphson method for the solution of systems of equations,J. Math. Anal. Appl.,15, 243–252.

    Article  MathSciNet  Google Scholar 

  2. Bhatia, N. P. and Szegő, G. P. (1967).Dynamical Systems: Stability Theory and Applications, Springer Verlag, New York.

    Book  Google Scholar 

  3. Boggs, P. T. (1971). The solution of nonlinear systems of equations byA-stable integration techniques,SIAM J. Numer. Anal.,8, 767–785.

    Article  MathSciNet  Google Scholar 

  4. Boggs, P. T. (1976). The convergence of the Ben-Israel iteration for nonlinear least squares problems,Math. Comp.,30, 512–522.

    Article  MathSciNet  Google Scholar 

  5. Boggs, P. T. and Dennis, J. E., Jr. (1976). A stability analysis for perturbed nonlinear iterative methods,Math., Comp.,30, 199–215.

    Article  MathSciNet  Google Scholar 

  6. Boggs, P. T. (1977). An algorithm based on singular perturbation theory for ill-conditioned minimization problem,SIAM Numer., Anal.,14, 830–843.

    Article  MathSciNet  Google Scholar 

  7. Branin, F. H., Jr. (1972). Widely convergent method for finding multiple solutions of simultaneous nonlinear equations,IBM J. Res. Develop., Sep. 504–522.

    Article  MathSciNet  Google Scholar 

  8. Brent R. P. (1972). On the Davidenko-Branin method for solving simultaneous nonlinear equations,IBM J. Res. Develop., July, 434–436.

    Article  MathSciNet  Google Scholar 

  9. Coddington, E. A. and Levinson, J. E. (1955).Theory of Ordinary Differential Equations, McGraw-Hill, New York.

    MATH  Google Scholar 

  10. Dekker, L. (1973). Hybrid computation in mathematical programming,Mathematical Programming,4, 21–43.

    Article  MathSciNet  Google Scholar 

  11. Dennis, J. E., Jr. (1977). Nonlinear least squares and equations, (ed. D. A. H. Jacobs)The State of Art in Numerical Analysis, Academic Press, London, 269–312.

    Google Scholar 

  12. Evtushenko, Y. G. and Zhadan, V. G. (1975). Application of the method of Liapunov functions to the study of the convergence of numerical methods,Zh. vy. chisl. Mat. mat. Fiz.,15, 101–112.

    Google Scholar 

  13. Gay, D. (1977). Modifying singular values: Existence of solutions to systems of nonlinear equations having a possibly singular Jacobian matrix,Math. Comp.,31, 962–973.

    MathSciNet  MATH  Google Scholar 

  14. Kizner, W. (1964). A numerical method for finding solutions of nonlinear equations,SIAM J. Appl. Math.,12, 424–428.

    Article  MathSciNet  Google Scholar 

  15. Meyer, G. H. (1968). On solving nonlinear equations with a one-parameter operator imbedding,SIAM J. Numer. Anal.,5, 739–752.

    Article  MathSciNet  Google Scholar 

  16. Ramsay, J. O. (1970). A family of gradient methods for optimization,The Computer J.,13, 413–417.

    Article  MathSciNet  Google Scholar 

  17. Shinohara, Y. (1969). A geometric method of numerical solution of nonlinear equations and error estimation by Urabe's proposition,Publ. RIMS Kyoto Univ.,5, 1–9.

    Article  MathSciNet  Google Scholar 

  18. Tanabe, K. (1969). Algorithm for the constrained maximization techniques for nonlinear programming,Proc. 2nd Hawaii International Conf. on System Science, 487–490.

  19. Tanabe, K. (1969). An algorithm for the constrained maximization in nonlinear programming,Research Memorandum, no.31, Institute of Statistical Mathematics.

  20. Tanabe, K. (1974). An algorithm for the constrained maximization in nonlinear programming,J. Operations Research Society of Japan,17, 184–201.

    MathSciNet  MATH  Google Scholar 

  21. Tanabe, K. (1976). Analogue-type nonlinear programming (in Japanese),Mathematical Science,157, 45–51. (Presented at the Japan-France Seminar on Functional Analysis and Numerical Analysis, Tokyo, 1976).

    Google Scholar 

  22. Tanabe, K. (1977). A geometric method in nonlinear programming,Stanford University Computer Science Report, STAN-CS-77-643. (Presented at the Gatlinburg VII Conference, Asilomar, 1977.)

  23. Tanabe, K. (1979). Continuous Newton-Raphson method for solving an underdetermined system of nonlinear equations,Nonlinear Analysis,3, 495–503.

    Article  MathSciNet  Google Scholar 

  24. Tanabe, K. (1980). A geometric method in nonlinear programming,J. Optimization Theory and Applications,30, 181–210.

    Article  MathSciNet  Google Scholar 

  25. Tanabe, K. (1982). Differential geometric approach to extended GRG method with enforced feasibility in nonlinear programming; Global analysis,Recent Applications of Generalized Inverses (ed. S. L. Campbell), Pitman, Boston.

    Google Scholar 

  26. Tanabe, K. (1978). Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equations,Brookhaven National Laboratory Report, BNL-24022 AMD-789.

  27. Yamashita, H. (1980). A differential equation approach to nonlinear programming,Mathematical Programming,18, 155–168.

    Article  MathSciNet  Google Scholar 

Download references

Authors

Additional information

The Institute of Statistical Mathematics

About this article

Cite this article

Tanabe, K. Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equations. Ann Inst Stat Math 37, 189–203 (1985). https://doi.org/10.1007/BF02481091

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02481091

Key words and phrases

Navigation