List Archives >
Maple User Group List Archive >
Archive by date >
This Month By Date >
This Month By Topic
[MUG] more about implicitdiff:complexity and recursiveness
| [MUG] more about implicitdiff:complexity and recursiveness |
|
Author: Charles James Leonardo Quarra Cappiello
Posted: Thu, 21 Nov 2002 12:26:09 -0400
|
>> From: "Charles James Leonardo Quarra Cappiello" "charsquarra"
Hi,
I've noted that the time of calculation of implicitdiff( eq(z,w) , z , w$n
); grows very quick with n, since in most calculations of the n-th implicit
derivative of z respect of w, one has usually:
n n-1 n-2
d z d z d z dz
--- = f ( ----- , ----- , -- , z , w );
n n-1 n-2
dw dw dw dw
now, in a particular calculation im in need of calculating all k-th implicit
derivatives from 1 to n, but it looks like each timestep, each k=1..n-1
derivatives are recalculated, amounting to an enourmous waste. Any ideas how
could implicitdiff reuse the results of the n-1 previous implicit
derivatives to calculate the n-th one?
Greetings,
Charles Quarra
_________________________________________________________________
The new MSN 8: smart spam protection and 2 months FREE*
http://join.msn.com/?page=features/junkmail
|
[View Complete Thread]
Previous by date: [MUG] graphing parametric equations in 3d, Han Wesseling
Next by date: [MUG] Numerical error, Madham53
Previous thread: [MUG] problems with subs(), Charles James Leonardo Quarra Cappiello
Next thread: [MUG] Numerical error, Madham53
|
(NAG)
