Prev: Error in Lapack la_dgesvd.f90 (Was: who maintains lapack95?)
Next: Text or pictures? (was: non portable - a problem with direct access)
From: Allamarein on 4 Aug 2010 17:59 Anyone is able to write a code solving ODEs by Gauss-Jackson method?
From: e p chandler on 5 Aug 2010 00:18 "Allamarein" <matteo.diplomacy(a)gmail.com> wrote in message news:bb46795c-c693-448d-aad6-6f53ad7156b7(a)q22g2000yqm.googlegroups.com... > Anyone is able to write a code solving ODEs by Gauss-Jackson method? Have you looked at the NETLIB collection? http://www.netlib.org/ode/ in particular, the files in http://www.netlib.org/ode/gauss2.tgz (gzipped-tar)
From: Allamarein on 5 Aug 2010 12:44 On 5 Ago, 06:18, "e p chandler" <e...(a)juno.com> wrote: > "Allamarein" <matteo.diplom...(a)gmail.com> wrote in message > > news:bb46795c-c693-448d-aad6-6f53ad7156b7(a)q22g2000yqm.googlegroups.com... > > > Anyone is able to write a code solving ODEs by Gauss-Jackson method? > > Have you looked at the NETLIB collection? http://www.netlib.org/ode/ > in particular, the files inhttp://www.netlib.org/ode/gauss2.tgz > (gzipped-tar) I found this paper: http://www.lib.umd.edu/drum/handle/1903/2202 Maybe I understood how to write a code, but how can I use that lisp file? What software is required?
From: e p chandler on 5 Aug 2010 23:16 "Allamarein" <matteo.diplomacy(a)gmail.com> wrote in message news:382624b5-9b34-4df7-a74c-fe8ecd2f2b70(a)14g2000yqa.googlegroups.com... On 5 Ago, 06:18, "e p chandler" <e...(a)juno.com> wrote: > "Allamarein" <matteo.diplom...(a)gmail.com> wrote in message > > news:bb46795c-c693-448d-aad6-6f53ad7156b7(a)q22g2000yqm.googlegroups.com... > > > Anyone is able to write a code solving ODEs by Gauss-Jackson method? > > Have you looked at the NETLIB collection? http://www.netlib.org/ode/ > in particular, the files inhttp://www.netlib.org/ode/gauss2.tgz > (gzipped-tar) I found this paper: http://www.lib.umd.edu/drum/handle/1903/2202 Maybe I understood how to write a code, but how can I use that lisp file? What software is required? A lisp interpreter. [smile] I don't know about using that language for numerical calculations. When I first read about it, it was slow, partly due to its highly recursive nature. LISP is about as far from Fortran as you can get. Maybe if you describe the nature of your problem someone can help you find software most suited to it. A brief look at the archive I linked to at netlib indicates that some of the demonstration programs are in space science.
From: Allamarein on 7 Aug 2010 09:10
On 6 Ago, 05:16, "e p chandler" <e...(a)juno.com> wrote: > "Allamarein" <matteo.diplom...(a)gmail.com> wrote in message > > news:382624b5-9b34-4df7-a74c-fe8ecd2f2b70(a)14g2000yqa.googlegroups.com... > On 5 Ago, 06:18, "e p chandler" <e...(a)juno.com> wrote: > > > "Allamarein" <matteo.diplom...(a)gmail.com> wrote in message > > >news:bb46795c-c693-448d-aad6-6f53ad7156b7(a)q22g2000yqm.googlegroups.com... > > > > Anyone is able to write a code solving ODEs by Gauss-Jackson method? > > > Have you looked at the NETLIB collection?http://www.netlib.org/ode/ > > in particular, the files inhttp://www.netlib.org/ode/gauss2.tgz > > (gzipped-tar) > > I found this paper:http://www.lib.umd.edu/drum/handle/1903/2202 > Maybe I understood how to write a code, but how can I use that lisp > file? > What software is required? > > A lisp interpreter. [smile] I don't know about using that language for > numerical calculations. When I first read about it, it was slow, partly due > to its highly recursive nature. > > LISP is about as far from Fortran as you can get. > > Maybe if you describe the nature of your problem someone can help you find > software most suited to it. A brief look at the archive I linked to at > netlib indicates that some of the demonstration programs are in space > science. You are right. I don't know author wrote that code in LISP. I need to find the Eighth-Order Summed-Adams Coefficients in Ordinate Form and Eighth-Order Gauss-Jackson Coefficients in Ordinate Form. You can found that coefficients in the article (pp. 347-348). Writing out these terms one by one it could be very time consuming. |