<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" version="2.0">
  <channel>
    <title>MaplePrimes - comments on Post, efficiency of the maple codes</title>
    <link>http://www.mapleprimes.com/posts/36595-Efficiency-Of-The-Maple-Codes</link>
    <language>en-us</language>
    <copyright>2026 Maplesoft, A Division of Waterloo Maple Inc.</copyright>
    <generator>Maplesoft Document System</generator>
    <lastBuildDate>Thu, 11 Jun 2026 23:33:27 GMT</lastBuildDate>
    <pubDate>Thu, 11 Jun 2026 23:33:27 GMT</pubDate>
    <itunes:subtitle />
    <itunes:summary />
    <description>The latest comments added to the Post, efficiency of the maple codes</description>
    <image>
      <url>http://www.mapleprimes.com/images/mapleprimeswhite.jpg</url>
      <title>MaplePrimes - comments on Post, efficiency of the maple codes</title>
      <link>http://www.mapleprimes.com/posts/36595-Efficiency-Of-The-Maple-Codes</link>
    </image>
    <item>
      <title>suggestions</title>
      <link>http://www.mapleprimes.com/posts/36595-Efficiency-Of-The-Maple-Codes?ref=Feed:MaplePrimes:efficiency of the maple codes:Comments#comment62855</link>
      <itunes:summary>&lt;p&gt;Why are those (unchanging) &lt;b&gt;diff &lt;/b&gt;calls inside the loop? They don't need to be done 70000 times, right? Not the main culprit, perhaps, but it's often good to look at such aspects.&lt;/p&gt;
&lt;p&gt;Do you really need Digits=16, which is just one digit of working precision above the cuttof between fast double-precision and slower &amp;quot;software&amp;quot; precision.&lt;/p&gt;
&lt;p&gt;Can you replace that Normalize call with something that acts in-place? (Either a Compiler:-Compile'd in-place proc of your own, or exisiting call to Norm and a call to VectorScalarMultiply with its inplace option, etc).&lt;/p&gt;
&lt;p&gt;Does the dsolve,numeric call really need to be inside the loop, or could it too be called just once up front with its new 'parameters' option to handle the changing w1? See the ?dsolve,numeric,IVP help-page.&lt;/p&gt;
&lt;p&gt;That's all presupposing that you don't want to change the basic approach.&lt;/p&gt;
&lt;p&gt;acer&lt;/p&gt;</itunes:summary>
      <description>The latest comments added to the Post, efficiency of the maple codes</description>
      <guid>62855</guid>
      <pubDate>Mon, 12 Oct 2009 18:26:18 Z</pubDate>
      <itunes:author>acer</itunes:author>
      <author>acer</author>
    </item>
    <item>
      <title>thanks acer</title>
      <link>http://www.mapleprimes.com/posts/36595-Efficiency-Of-The-Maple-Codes?ref=Feed:MaplePrimes:efficiency of the maple codes:Comments#comment62856</link>
      <itunes:summary>Actually the program is such that each time i have to  solve the differential equations using different initial conditions. In my case these initial conditions for last three equations are the elements of the normalized vector(w1) , the first three equations can be solved as usual. This is the code for obtaining just one Lyapunov exponent(LE). To find out all the three LEs  would require solving 12 coupled differential equations out of which 9 will have to start with a different initial conditions for every iterate which will be my final task.

The reason that i am using a loop over 70000 iterates is just that i am trying to find the dynamics of a  system where the transients die after a very long time . So in order to find out even accurate values i would need the summation over much higher iterates. So there is no escape(atleast 100000 iterates are needed.)  

I couldnt understand ur comment about replacing  the Normalize command. If u can explain it a step further it would be helpful for me.

Again, the reason that i am using the dsolve command inside the loop is just that for every iterate i have to solve the same set of diiferential equation using different initial conditions, so i think keeping it outside the loop would mean starting from the same initial condition and finding the solution at different times. But in my case I have to update the set of initial conditions at every iterate and then find the solution after a certain time.( i.e., t=0.01, as shown in the present code.)

hyder</itunes:summary>
      <description>The latest comments added to the Post, efficiency of the maple codes</description>
      <guid>62856</guid>
      <pubDate>Mon, 12 Oct 2009 21:36:12 Z</pubDate>
      <itunes:author>haider</itunes:author>
      <author>haider</author>
    </item>
    <item>
      <title>yes, but..</title>
      <link>http://www.mapleprimes.com/posts/36595-Efficiency-Of-The-Maple-Codes?ref=Feed:MaplePrimes:efficiency of the maple codes:Comments#comment62857</link>
      <itunes:summary>&lt;p&gt;I realized that was your line of thinking, when I posted. And that is why I mentioned the 'parameters' option. Have a look at it. It might help you pull out the dsolve call (which is heavy machinery), and allow you to specify the w1_1, w1_2, and w1_3 as parameters. At the very least, you can pull out the diff calls.&lt;/p&gt;
&lt;p&gt;acer&lt;/p&gt;</itunes:summary>
      <description>The latest comments added to the Post, efficiency of the maple codes</description>
      <guid>62857</guid>
      <pubDate>Mon, 12 Oct 2009 21:43:41 Z</pubDate>
      <itunes:author>acer</itunes:author>
      <author>acer</author>
    </item>
  </channel>
</rss>