Re: Recursive FindRoot with initial values as a list

*To*: mathgroup at smc.vnet.net*Subject*: [mg77053] Re: Recursive FindRoot with initial values as a list*From*: dimitris <dimmechan at yahoo.com>*Date*: Sat, 2 Jun 2007 04:13:09 -0400 (EDT)*References*: <f3m4qv$fgl$1@smc.vnet.net>

Hi. The others have covered your request I think. I just wanted to add that since you are interested in numerical results there is no reason to use Integrate. I suggest changing to NIntegrate. Dimitris / R.G : > Greetings... > Say I have a function defined as: > f[a_, b_]:= Integrate[Sin[x] + 3, {x, a, b}] > > I can find b with given f[a,b]=2 and initial value=0: > In[1]:= Initialvalue = 0; > s1 = FindRoot[f[0, unknown] == 2, {unknown,Initialvalue}]; > x1 = s1[[ 1, 2]] > > Now, using the x1 value obtained from FindRoot, I can find x2: > s2 = FindRoot[f[x1, unknown] == 2, {unknown,Initialvalue}]; > x2 = s2[[ 1, 2]] > > If I have initialvalue in a list form: > InitialValues={initialvalue1,initialvalue2,...,initialvalueN} > > in which each si should get InitialValues[[i]], in general form: > > \!\(s\_i = > FindRoot[{f[x\_\(i - 1\), unknown] \[Equal] 2}, {unknown, > InitialValues[\([i]\)]}]\) > > where > > \!\(x\_i = s\_i[\([1, 2]\)]\) > > How do I code it in Mathematica please? Thanking in advance... > > ~R.G > > > Send instant messages to your online friends http://uk.messenger.yahoo.com