- 在线时间
- 6 小时
- 最后登录
- 2017-2-16
- 注册时间
- 2011-3-28
- 听众数
- 3
- 收听数
- 0
- 能力
- 0 分
- 体力
- 143 点
- 威望
- 0 点
- 阅读权限
- 20
- 积分
- 48
- 相册
- 0
- 日志
- 0
- 记录
- 0
- 帖子
- 10
- 主题
- 1
- 精华
- 0
- 分享
- 0
- 好友
- 0
升级   45.26% 该用户从未签到
|
題目如下, 請高手幫幫忙 ^^
4 y7 u! X) a1 M9 {1 U; j, x. C3 `1. 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.
) X6 y" U0 {) H, x$ `" b3 a4 _( m1 i6 D- H. Q: M1 P r0 Z
2. * P( u2 h( V# R- n* x# E
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.
% a& ~$ t- @5 k0 hb) Write and test a program that computes f[n] using Module and a While loop.
, n8 k! X- p8 }4 W, g; f3 S0 p4 l/ n8 mc) 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.& r$ H' |1 G7 S- v5 P2 Y
4 E4 ` a% {4 K H& d+ e/ x" }4 eConsider the iterative map Subscript[x, n] == 1/2 Subsuperscript[x, n-1, 2] -\[Mu]. 6 I! C4 G* C1 Y1 k! d
a) Compute its fixed points and 2-cycles as a function of \[Mu].$ Y2 \# `# J- U: i. [& L
b) Using linear stability analysis, compute the range of stability of both the fixed points as well as the 2-cycles. 5 `% [* _& j: I8 B" N6 ]. O
c) Show cobweb diagrams for representative parameters illustrating the (un)stable fixed point and 2-cycle.
% z& S; h6 x9 C6 y( jd) Graphically demonstrate the onset of a stable 3-cycle." |0 }. C6 |; U$ C
e) Produce the bifurcation diagram. |
|