The algorithm for coefficients determination for stability polynomials of degree up to m = 35 is developed. The coefficients correspond to explicit Runge-Kutta methods of the first accuracy order. Dependence between values of a polynomial at the points of extremum and both size and form of a stability domain is shown. Numerical results are given
In this article, we demonstrate through specific examples that the evolution of the size of the abso...
A number of techniques and solvers have been suggested, developed, and described, but a clear defini...
We describe the derivation of highly stable general linear methods for the numerical solution of ini...
The Cauchy problem for a stiff system of ODEs is considered. The explicit m-stage first order method...
An algorithm is developed to determine coefficients of the stability polynomials such that the expli...
AbstractSarafyan and others have recently developed novel explicit Runge-Kutta methods. Associated w...
The analytic form of a new class of factorized Runge-Kutta-Chebyshev (FRKC) stability polynomials of...
. Optimal stability polynomials are polynomials whose stability region is as large as possible in a...
AbstractA function characterizing the stability of explicit boundary value Runge-Kutta methods for t...
In this article, we demonstrate through specific examples that the evolution of the size of the abso...
We describe the construction of implicit two-step Runge-Kutta methods with stability properties dete...
AbstractThis paper is concerned with the stability of rational two-stage Runge Kutta methods for the...
In the past numerical stability theory for initial value problems in ordinary differential equations...
Classical collocation Runge--Kutta methods are polynomially fitted in the sense that they integrate ...
We describe the construction of general linear methods in Nordsieck form of order p and stage order ...
In this article, we demonstrate through specific examples that the evolution of the size of the abso...
A number of techniques and solvers have been suggested, developed, and described, but a clear defini...
We describe the derivation of highly stable general linear methods for the numerical solution of ini...
The Cauchy problem for a stiff system of ODEs is considered. The explicit m-stage first order method...
An algorithm is developed to determine coefficients of the stability polynomials such that the expli...
AbstractSarafyan and others have recently developed novel explicit Runge-Kutta methods. Associated w...
The analytic form of a new class of factorized Runge-Kutta-Chebyshev (FRKC) stability polynomials of...
. Optimal stability polynomials are polynomials whose stability region is as large as possible in a...
AbstractA function characterizing the stability of explicit boundary value Runge-Kutta methods for t...
In this article, we demonstrate through specific examples that the evolution of the size of the abso...
We describe the construction of implicit two-step Runge-Kutta methods with stability properties dete...
AbstractThis paper is concerned with the stability of rational two-stage Runge Kutta methods for the...
In the past numerical stability theory for initial value problems in ordinary differential equations...
Classical collocation Runge--Kutta methods are polynomially fitted in the sense that they integrate ...
We describe the construction of general linear methods in Nordsieck form of order p and stage order ...
In this article, we demonstrate through specific examples that the evolution of the size of the abso...
A number of techniques and solvers have been suggested, developed, and described, but a clear defini...
We describe the derivation of highly stable general linear methods for the numerical solution of ini...