A third order Runge-Kutta method based on a convex combination of Lehmer means
Author information unavailable
Abstract
Author information unavailable
Abstract
In this paper we introduce a modification of the third order Runge-Kutta method based on a convex combination of Lehmer means. The error of this method is also presented. The stability of this method is similar to the stability of third order Runge-Kutta method based on arithmetic mean. We end the discussion with two numerical examples to justify the effectiveness of the method.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we introduce a modification of the third order Runge-Kutta method based on a convex combination of Lehmer means. The error of this method is also presented. The stability of this method is similar to the stability of third order Runge-Kutta method based on arithmetic mean. We end the discussion with two numerical examples to justify the effectiveness of the method.
Key concepts: Mathematics, Runge–Kutta methods, Regular polygon, Third order, Stability (learning theory), Order (exchange), Convex combination, Applied mathematics