recurrence relation for any given 'n'.
5 次查看(过去 30 天)
显示 更早的评论
How to compute A_j^(2n) for any 'n' using A_j^(2).
Here, n=2,3,4,...; and j=1:n-1.
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/165348/image.png)
Any kind of help is highly appreciated.
Thank you.
0 个评论
采纳的回答
Walter Roberson
2017-6-21
If you have the Symbolic toolbox, you could use evalin(symengine) or feval(symengine) to call into MuPAD in order to take advantage of solve() of a rec() recurrence structure
11 个评论
Walter Roberson
2017-7-6
I tossed together the attached. I did not test it with functions that return multiple outputs.
Aj_2n_better and Aj_2 are the same as last time. memoizefun is new (I just wrote it) and A_driver_cache is almost the same as the previous A_driver_better except for calling memoizefun instead of R2017a's memoize()
Note: you should test that the results are the same as the previous... they should be, but I did not test that.
更多回答(0 个)
另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!