Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

[Date Index] [Thread Index] [Author Index]

Search the Archive

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


  • Prev by Date: Behaviour of FindRoot
  • Next by Date: Re: Re: Memory operations
  • Previous by thread: Re: optimization nested in root-finding
  • Next by thread: Re: optimization nested in root-finding