🚀 go-pugleaf

In article <1992Sep1.094300.2414@nuscc.nus.sg> suresh@papaya.iss.nus.sg (Suresh Thennarangam - Research Scholar) writes:
>
>Newton-Raphson's method can handle non-linear n-dimensional equations
>with reasonable results given a good starting point. What happens
>if the system of equations is over-determined ? i.e. M equations in
>N unknowns where M > N. 
>
>I used the routine mnewt() from Numerical Recipes ... with SVD as the 
>backbone linear equation solver. It always converged when M <= N but 
>refused to converge when M > N.
>
>Any comments about this ? Can NR handle M > N at all or does the 
>algorithm have to modified to make it work ?

Don't be surprised about errors or deficiencies in NR.  The authors
are physicists, not numerical analysts.  They have usually just
cobbled together something that seems to work on one of their
special problems, and made a leap of faith to generalize to all
superficially similar problems.

For nonlinear least squares problems, get nl2sol from netlib.
netlib is a network library server operated by Eric Grosse at AT&T
and Jack Dongarra at Oak Ridge National Laboratory.  Start by sending
"send help" and "send index" to netlib@ornl.gov.

-- 
vsnyder@jato.Jpl.Nasa.Gov   vsnyder@math.Jpl.Nasa.Gov  <-- preferred
ames!elroy!jato!vsnyder     ames!elroy!math!vsnyder
vsnyder@jato.uucp