The approach introduced recently by Albrecht to derive order conditions for Runge-Kutta formulas based on the theory of A-methods is also very powerful for the general linear methods. in this paper, using Albrecht's approach, we formulate the general theory of order conditions for a class of general linear methods where the components of the propagating vector of approximations to the solution have different orders. Using this theory we derive a class of diagonally implicit multistage integration methods (DIMSIMs) for which the global order is equal to the local order. We also derive a class of general linear methods with two nodal approximations of different orders which facilitate local error estimation. Our theory also applies to the cla...
Many practical problems in science and engineering are modeled by large systems of ordinary differen...
A class of variable order/variable step diagonally implicit Runge-Kutta formulae suitable for the nu...
The order reduction phenomenon for general linear methods (GLMs) for stiff differential equations is...
We describe the derivation of order conditions, without restrictions on stage order, for general lin...
Implicit–explicit (IMEX) time stepping methods can efficiently solve differential equations with bot...
AbstractA number of questions and results concerning Runge-Kutta and general linear methods are surv...
General linear (GL) methods are numerical algorithms used to solve ODEs. The standard order conditio...
AbstractGeneral linear methods were originally introduced to provide a unified theory of consistency...
We discuss error propagation for general linear methods for ordinary differential equations up to te...
The use of B-series for the derivation of order conditions for general two-step Runge-Kutta methods ...
We give an overview of the construction of algebraic conditions for determining the order of Runge-K...
The numerical method for ordinary differential equations is regular if it has the same set of finite...
AbstractWe discuss error propagation for general linear methods for ordinary differential equations ...
AbstractWe give an overview of the construction of algebraic conditions for determining the order of...
Many practical problems in science and engineering are modeled by large systems of ordinary differen...
A class of variable order/variable step diagonally implicit Runge-Kutta formulae suitable for the nu...
The order reduction phenomenon for general linear methods (GLMs) for stiff differential equations is...
We describe the derivation of order conditions, without restrictions on stage order, for general lin...
Implicit–explicit (IMEX) time stepping methods can efficiently solve differential equations with bot...
AbstractA number of questions and results concerning Runge-Kutta and general linear methods are surv...
General linear (GL) methods are numerical algorithms used to solve ODEs. The standard order conditio...
AbstractGeneral linear methods were originally introduced to provide a unified theory of consistency...
We discuss error propagation for general linear methods for ordinary differential equations up to te...
The use of B-series for the derivation of order conditions for general two-step Runge-Kutta methods ...
We give an overview of the construction of algebraic conditions for determining the order of Runge-K...
The numerical method for ordinary differential equations is regular if it has the same set of finite...
AbstractWe discuss error propagation for general linear methods for ordinary differential equations ...
AbstractWe give an overview of the construction of algebraic conditions for determining the order of...
Many practical problems in science and engineering are modeled by large systems of ordinary differen...
A class of variable order/variable step diagonally implicit Runge-Kutta formulae suitable for the nu...
The order reduction phenomenon for general linear methods (GLMs) for stiff differential equations is...