Re: optimization nested in root-finding
- To: mathgroup at smc.vnet.net
- Subject: [mg65073] Re: optimization nested in root-finding
- From: "Borut Levart" <BoLe79 at gmail.com>
- Date: Tue, 14 Mar 2006 05:59:51 -0500 (EST)
- References: <duuc68$h6r$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
I was wondering what is the use of giving x two initial values, as {x,
3, 5} in the FindRoot example of Bob Hanlon above.
I guess FindRoot can then work out with some other, more efficient
algorithm.
But I put StepMonitor :> Print[x] in the FindRoot, and the step count
wasn't any smaller.
And for some examples it wouldn't even be possible for FindRoot to find
the solution with only a single starting value, I think.
However, for I am wondering, is there more to it?
Bye,
Borut Levart