Implicit schemes for the integration of ODE's are popular when stabil ity is more of concern than accuracy, for instance for the computation of a steady state solution. However, in particular for very large sys tems the solution of the involved linear systems may be very expensive. In this paper we study the solution of these linear systems by a mod erate number of iterations of the minimum residual iterative method GMRES. Of course, this puts limits to the step size since these ap proximate schemes may be viewed as explicit schemes and these are never unconditionally stable. It turns out that even a modest degree of approximation allows rather large time steps and we propose a simple mechanism for the control of the...
Abstract. Implicit integration schemes for ODEs, such as Runge-Kutta and Runge-Kutta-Nyström method...
AbstractA very simple way of selecting the step size when solving an initial problem for a system of...
It is possible to construct fully implicit Runge-Kutta methods like Gauß-Legendre, Radau-IA, Radau-I...
Implicit schemes for the integration of ODE's are popular when stabil- ity is more of concern than...
Abstract. Implicit integration schemes for large systems of nonlinear ODEs require, at each integrat...
AbstractBased on the simplest well-known integration rules (such as the forward Euler scheme and the...
AbstractThe use of implicit methods for ODEs, e.g. implicit Runge-Kutta schemes, requires the soluti...
The numerical solution of time-dependent ordinary and partial differential equations presents a numb...
We've all looked at stability domains for ODE time-steppers. At the most basic level, these are fou...
Abstract. In this work we study the problem of step size selection for numer-ical schemes, which gua...
The numerical solution of time-dependent ordinary and partial differential equations presents a numb...
AbstractTwo efficient third-and fourth-order processes for solving the initial value problem for ord...
Time integration schemes with a fixed time step, much smaller than the dominant slow time scales of ...
The recently proposed Minimal Residential Approximate Implicit (MRAI) schemes have been developed as...
AbstractTime integration schemes with a fixed time step, much smaller than the dominant slow time sc...
Abstract. Implicit integration schemes for ODEs, such as Runge-Kutta and Runge-Kutta-Nyström method...
AbstractA very simple way of selecting the step size when solving an initial problem for a system of...
It is possible to construct fully implicit Runge-Kutta methods like Gauß-Legendre, Radau-IA, Radau-I...
Implicit schemes for the integration of ODE's are popular when stabil- ity is more of concern than...
Abstract. Implicit integration schemes for large systems of nonlinear ODEs require, at each integrat...
AbstractBased on the simplest well-known integration rules (such as the forward Euler scheme and the...
AbstractThe use of implicit methods for ODEs, e.g. implicit Runge-Kutta schemes, requires the soluti...
The numerical solution of time-dependent ordinary and partial differential equations presents a numb...
We've all looked at stability domains for ODE time-steppers. At the most basic level, these are fou...
Abstract. In this work we study the problem of step size selection for numer-ical schemes, which gua...
The numerical solution of time-dependent ordinary and partial differential equations presents a numb...
AbstractTwo efficient third-and fourth-order processes for solving the initial value problem for ord...
Time integration schemes with a fixed time step, much smaller than the dominant slow time scales of ...
The recently proposed Minimal Residential Approximate Implicit (MRAI) schemes have been developed as...
AbstractTime integration schemes with a fixed time step, much smaller than the dominant slow time sc...
Abstract. Implicit integration schemes for ODEs, such as Runge-Kutta and Runge-Kutta-Nyström method...
AbstractA very simple way of selecting the step size when solving an initial problem for a system of...
It is possible to construct fully implicit Runge-Kutta methods like Gauß-Legendre, Radau-IA, Radau-I...