<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection:</title>
  <link rel="alternate" href="http://hdl.handle.net/10628/218" />
  <subtitle />
  <id>http://hdl.handle.net/10628/218</id>
  <updated>2013-05-21T05:10:26Z</updated>
  <dc:date>2013-05-21T05:10:26Z</dc:date>
  <entry>
    <title>A collocation multistep methods for integrating ordinary differential equations on manifolds.</title>
    <link rel="alternate" href="http://hdl.handle.net/10628/219" />
    <author>
      <name>Fatokun, J. O.</name>
    </author>
    <author>
      <name>Ajibola, I. K. O.</name>
    </author>
    <id>http://hdl.handle.net/10628/219</id>
    <updated>2011-03-14T08:35:11Z</updated>
    <published>2009-01-01T00:00:00Z</published>
    <summary type="text">Title: A collocation multistep methods for integrating ordinary differential equations on manifolds.
Authors: Fatokun, J. O.; Ajibola, I. K. O.
Abstract: This paper concerns a family of generalized collocation multistep methods that evolves the numerical&#xD;
solution of ordinary differential equations on configuration spaces formulated as homogeneous&#xD;
manifolds. Collocating the general linear method at x x for k s n k = = 0,1,... + , we obtain the discrete&#xD;
scheme which can be adapted to homogeneous spaces. Varying the values of k in the collocation&#xD;
process, the standard Munthe-Kass (k = 1) and the linear multistep methods (k = s) are recovered. Any&#xD;
classical multistep methods may be employed as an invariant method and the order of the invariant&#xD;
method is as high as in the classical setting. In this paper an implicit algorithm was formulated and two&#xD;
approaches presented for its implementation.</summary>
    <dc:date>2009-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

