home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math.num-analysis
- Path: sparky!uunet!munnari.oz.au!mel.dit.csiro.au!amal
- From: amal@mel.dit.csiro.au (Amal De Silva)
- Subject: Re: Nonlinear systems of equations
- Message-ID: <1992Dec22.044947.17093@mel.dit.csiro.au>
- Sender: news@mel.dit.csiro.au
- Organization: CSIRO DIT (Melb.)
- References: <92Dec17.174419.27750@acs.ucalgary.ca>
- Date: Tue, 22 Dec 92 04:49:47 GMT
- Lines: 25
-
-
- In article <92Dec17.174419.27750@acs.ucalgary.ca>, mgh@hobbes.phys.ucalgary.ca (Mike Henderson) writes:
- |> I am trying to solve a set of 8 nonlinear equations in 8 unknowns.
- |> I have tried the Newton-Raphson technique given in NR (I know
- |> roughly what the solution should be) but havent had much luck. Are
- |> there any more robust methods to choose from?
- |>
- |> Mike Henderson
- |> Dept. of Physics and Astronomy
- |> University of Calgary
- |> mgh@hobbes.phys.ucalgary.ca
-
- The problem with the NR method is that it is not globally convergent (It needs a
- good starting point to get to the solution). One method of solving this problem is
- to represent this as a minimization problem and use a globally convergent
- non linear programming (unconstrained) algorithm to solve it. I can
- give a reference to this.
-
- Numerical methods for unconstrained optimization and nonlinear equations by
- J.R Dennis and Robert Schnabel, Prentice Hall (1983). page 147.
-
-
- Amal de Silva
-
-
-