Advertisement

Chapter 4 Nonlinear equations and nonlinear least squares

Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 165)

Keywords

Jacobian Matrix Hybrid Algorithm Trust Region Superlinear Convergence Newton Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4.4.9 References

  1. Brent, R. [1973]. Some efficient algorithms for solving systems of nonlinear equations, SIAM Journal on Numerical Analysis, 10, 327–344.Google Scholar
  2. Brown, K.M. [1966]. A quadratically convergent method for solving simultaneous nonlinear equations, PhD. Diss., Purdue U., Lafayette, Indiana.Google Scholar
  3. Broyden, C. [1965]. A class of methods for solving systems of nonlinear equations, MAth. Comput. 19, 577–593.Google Scholar
  4. Broyden, C., Dennis, J., Moré [1973]. On the local and superlinear convergence of quasi-Newton Methods, J.Inst.Math. & Applics., 12, 223–245.Google Scholar
  5. Coleman, T., Moré, J. [1982]. Software for estimating sparse Jacobian matrices, ANL-82-37, Argonne National Laboratory, Argonne, Illinois.Google Scholar
  6. Coleman, T. and Moré, J. [1983]. Estimation of sparse Jacobian matrices and graph coloring problems, SIAM Journal on Numerical analysis, 20, 187–209.Google Scholar
  7. Curtis, A., Powell, M.J.D., Reid, J. [1974]. On the estimation of sparse Jacobian matrices, J. Inst. Math. Appl. 13, 117–119.Google Scholar
  8. Dembo, R., Eisenstat, S., and Steihaug [1982]. Inexact Newton Methods, SIAM Journal on Numerical Analysis 19, 400–408.Google Scholar
  9. Dennis, J., Gay, D., and Welsch, R., [1983]. An adaptive nonlinear least-squares algorithm, ACM Trans. Math. Softw. 7, 369–383.Google Scholar
  10. Dennis, J. and Marwil, E. [1981]. Direct secant updates of matrix factorizations, TR 476, Dept. of Math. Sciences, Rice University, Houston, Texas.Google Scholar
  11. Dennis, J. and Moré, J. [1974] A characterization of superlinear convergence and its' application to quasi-Newton methods, Math. of Computation, 28, 549–560.Google Scholar
  12. Gill, P. and Murray, W. [1978]. Algorithms for the nonlinear least-squares problem, SIAM Journal on Numerical Analysis, 15, 977–992.Google Scholar
  13. Goldfarb, D. and Toint, P. [1983]. Optimal estimation of Jacobian and Hessian matrices that arise in finite difference calculations, Technical Report, Department of Industrial Engineering and Operations Research, Columbia University, New York.Google Scholar
  14. Health, M. [1982]. Some extensions of an algorithm for sparse linear least squares problems, SIAM Journal on Sci. Stat. Comput., 3.Google Scholar
  15. Hebden, M.D. [1973]. An algorithm for minimization using exact second derivatives, Atomic Energy Research Establishment, Report T.P. 515, Harwell, England.Google Scholar
  16. Levenberg, K. [1944]. A method for the solution of certain nonlinear problems in least squares, Quart. Appl. Math 2, 164–168.Google Scholar
  17. Marwil, E.[1979]. Convergence results for Schubert's method for solving sparse nonlinear equations, SIAM Journal on Numerical Analysis 16, 588–604.Google Scholar
  18. Marquardt, D.W. [1963]. An algorithm for least squares estimation of nonlinear parameters, SIAM J. Appl. Math. 11, 431–441.Google Scholar
  19. Matula, D.W., Marble, G., and Isaacson, J.D. [1972]. Graph coloring algorithms in Graph Theory and Computing, R.C. Read, ed., Academic Press, New York, 104–122.Google Scholar
  20. Moré, J. [1978]. The Levenberg-Marquardt algorithm: Implementation and theory, Proceedings of the Dundee Conference on Numerical Analysis, G.A. Watson, ed., Springer-Verlag.Google Scholar
  21. Moré, J., Garbow, B., and Hillstrom, K.E. [1980]. User guide for MINPACK-1, Argonne National Laboratory, Report ANL-81-83, Argonne, IL.Google Scholar
  22. Nazareth, L. [1980]. Some recent approaches to solving large residual nonlinear least squares problems, SIAM Review 22, 1–11.Google Scholar
  23. Newsam, G., and Ramsdell, J. [1981]. Estimation of sparse Jacobian matrices, Aiken Computation Lab., TR-17-81, Harvard, Cambridge, Mass.Google Scholar
  24. Powell, M.J.D. [1970]. A hybrid method for nonlinear equations, in Numerical Methods For Nonlinear Algebraic Equations, P. Rabinowitz, ed. Academic Press.Google Scholar
  25. Rose, D.J. [1970]. Triangulated graphs and the elimination process, Journal of Mathematical Analysis and Applications, 32 597–609.Google Scholar
  26. Schubert, L. [1970]. Modification of a quasi-Newton method for nonlinear equations with a sparse Jacobian, Math. Comp., 24, 27–30.Google Scholar
  27. Speelpenning, B. [1980]. Compiling Fast Partial Derivatives of Functions Given By Algorithms, PhD Dissertation, Dept. of Computer Science, Urbana, Illinois.Google Scholar
  28. Tarjan, R. [1975]. Maximum cardinality search and chordal graphs, unpublished notes.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Personalised recommendations