recurrence relation for any given 'n'.
7 Ansichten (letzte 30 Tage)
Ältere Kommentare anzeigen
Venkata
am 20 Jun. 2017
Kommentiert: Venkata
am 7 Jul. 2017
How to compute A_j^(2n) for any 'n' using A_j^(2).
Here, n=2,3,4,...; and j=1:n-1.
Any kind of help is highly appreciated.
Thank you.
0 Kommentare
Akzeptierte Antwort
Walter Roberson
am 21 Jun. 2017
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 Kommentare
Walter Roberson
am 6 Jul. 2017
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.
Weitere Antworten (0)
Siehe auch
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!