[發問] 三個Mathematica的問題請求幫助

fantuen

請各位專家幫忙提示我該如何解題
感激不盡

Question.nb (5.6 KB, 下载次数: 2)

2011-3-28 21:51 上传

点击文件名下载附件
Mathematica notebook檔案
下载积分: 体力 -2 点

fantuen

題目如下, 請高手幫幫忙 ^^
0 t, B; P+ d5 e) y; M1. 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.

! R; F' B2 @% t! J0 X2.  
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+ c' y+ N: w  _" Cb) Write and test a program that computes f[n] using Module and a While loop.
/ S6 f/ C  e6 v/ ^* [" n4 S- `c) 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.
0 d: y# D& b1 i2 x, f( i
Consider the iterative map Subscript[x, n] == 1/2 Subsuperscript[x, n-1, 2] -\[Mu].
a) Compute its fixed points and 2-cycles as a function of \[Mu].
3 I  j" A/ n9 }* B& p) {b) Using linear stability analysis, compute the range of stability of both the fixed points as well as the 2-cycles.
c) Show cobweb diagrams for representative parameters illustrating the (un)stable fixed point and 2-cycle.
' _, d! K" c$ \d) Graphically demonstrate the onset of a stable 3-cycle.
e) Produce the bifurcation diagram.

fantuen

似乎貼的不是很好...
& W7 j, B) K# R1 m( \如果有達人願意幫忙, 麻煩+我QQ 860288311
1 v( W0 P: j; e  B4 n* J6 ]; U我可以把notebook檔案發給你

gaoshanliu水