Anzeige
Erschienen in:
01.12.2015
Order conditions for G-symplectic methods
Erschienen in: BIT Numerical Mathematics | Ausgabe 4/2015
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
General linear methods for the solution of ordinary differential equations are both multivalue and multistage. The order conditions will be stated and analyzed using a B-series approach. However, imposing the G-symplectic structure modifies the nature of the order conditions considerably. For Runge–Kutta methods, rooted trees belonging to the same tree have equivalent order conditions; if the trees are superfluous, they are automatically satisfied and can be ignored. For G-symplectic methods, similar results apply but with a more general interpretation. In the multivalue case, starting conditions are a natural aspect of the meaning of order; unlike the Runge–Kutta case for which “effective order” or “processing” or “conjugacy” has to be seen as having an artificial meaning. It is shown that G-symplectic methods with order 4 can be constructed with relatively few stages, \(s=3\), and with only \(r=2\) inputs to a step.