- 在线时间
- 6 小时
- 最后登录
- 2017-2-16
- 注册时间
- 2011-3-28
- 听众数
- 3
- 收听数
- 0
- 能力
- 0 分
- 体力
- 143 点
- 威望
- 0 点
- 阅读权限
- 20
- 积分
- 48
- 相册
- 0
- 日志
- 0
- 记录
- 0
- 帖子
- 10
- 主题
- 1
- 精华
- 0
- 分享
- 0
- 好友
- 0
升级   45.26% 该用户从未签到
|
題目如下, 請高手幫幫忙 ^^
# Y4 P+ Z" Y+ e- `: x6 G1. Write a function that as input has an expression f, and returns the logarithmic derivate 1/f (d f)/(d x) . Use a conditional or pattern test to make your function accept any symbols as input except for lists.
5 }% |" B+ p% s/ d& c. ?6 `; k/ ~1 r- D2 i# d: Z! Y
2. L4 R' C$ E5 \8 ~: X
a) Write a recursive function that computes the function f[n] defined by 6 n f[n]=f[n-1]+n! for n>0, and f[0]=7. Restrict the argument to positive integers.
+ C4 M! i# q7 F9 E9 ?b) Write and test a program that computes f[n] using Module and a While loop.
, o3 c% k4 P. {$ M9 r( G4 L6 I3 W: _" rc) Compare the timings of the two methods by computing f[n] in both cases for very large values of n and/or doing the computation many times. You may have to use Clear or restart to clear Mathematica's memory of previous calculations. Explain your results.% h8 H- d; G7 c3 U9 W" C, ~
5 `9 k5 E" B8 v. n6 m% ^ f# r9 BConsider the iterative map Subscript[x, n] == 1/2 Subsuperscript[x, n-1, 2] -\[Mu].
0 M* p2 b. i1 z$ s0 \, i( P2 Wa) Compute its fixed points and 2-cycles as a function of \[Mu].0 A- N; l* Z7 K4 \; U3 |# {- s
b) Using linear stability analysis, compute the range of stability of both the fixed points as well as the 2-cycles.
- }, V3 C( L+ c8 W2 @( Nc) Show cobweb diagrams for representative parameters illustrating the (un)stable fixed point and 2-cycle. : N5 _& F$ q8 d0 O/ M3 M, {
d) Graphically demonstrate the onset of a stable 3-cycle.
; {% s, O& w0 k9 {% F+ Ne) Produce the bifurcation diagram. |
|