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

MathGroup Archive 2007

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

Search the Archive

Iterating List

  • To: mathgroup at smc.vnet.net
  • Subject: [mg76977] Iterating List
  • From: Gobiithasan <gobiithasan at yahoo.com.my>
  • Date: Thu, 31 May 2007 03:19:54 -0400 (EDT)

Hi, it would be a great help if Mathsgroup members can
show me how to code the following problem in
mathematica:

Say I have a function defined as:
f[a_, b_] = Integrate[Sin[x] + 3, {x, a, b}]

I can find b with given constant=2 and initial
value=0:
In[1]:=
Initialvalue = 0;
s1 = FindRoot[f[0, unknown] == 2, {unknown,
Initialvalue}];
x1 = Part[s1, 1, 2]

Now, using the x1 value obtained from FindRoot, I can
find x2:
s2 = FindRoot[f[x1, unknown] == 2, {unknown,
Initialvalue}];
x2 = Part[s2, 1, 2]

How can i do it for n times (to get xn in a list form)
with given initial value as:
initialvalue= {initialvalue1,initialvalue2,
....,initialvalue3} 

whereby each xi will get initialvalue[[i]]. 

Thanking you in advance

~gobiithasan

Send instant messages to your online friends http://uk.messenger.yahoo.com 



  • Prev by Date: Re: Re: v6: cursor behaviour with arrow keys
  • Next by Date: Re: Re: Ellipse equation simplification on Mathematica:
  • Previous by thread: [V6.0] Possible bug found in Symbolize (Notation Palette)
  • Next by thread: Recursive FindRoot with initial values as a list