A minimal norm corrected underdetermined Gauß–Newton procedure

https://doi.org/10.1016/j.apnum.2012.01.006Get rights and content

Abstract

If a Gauß–Newton iteration is used to solve a system of equations that has a manifold of solutions, then the iteration does not produce the minimal norm solution. The limit of the iteration depends on the starting point. This paper introduces a modified Gauß–Newton method that is designed to keep the nonunique part of the solution small in some sense. The iteration is analyzed. Its behavior is discussed along with two computational examples that include the iterationʼs application to general integration methods for differential algebraic equations.

References (27)

  • A. Barrlund et al.

    Analytical and numerical solutions to higher index linear variable coefficient DAE systems

    J. Comput. Appl. Math.

    (1991)
  • A. Ben-Israel

    On iterative methods for solving nonlinear least squares problems over convex sets

    Israel J. Math.

    (1967)
  • K.E. Brenan et al.

    Numerical Solution of Initial-Value Problems in Differential–Algebraic Equations

    (1996)
  • Cited by (0)

    1

    Research supported in part by NSF Grant DMS-0907832.

    View full text