New Third Order Explicit Runde-Kutta Method with Equal Nodes
J. I. Mbegbu, Stella C. Chiemeke
Abstract
Open-access reader
J. I. Mbegbu, Stella C. Chiemeke
Abstract
Open-access reader
In the light of (4) and (5), a new third order explicit Runge – Kutta Method with equal nodes and it's computer implementation were highlighted. The method compared efficiently with the existing third order explicit Runge – Kutta methods proposed by Kutta, Ralston, Heun and Nystrom respectively. Key Word: Explicit Runge – Kutta methods, Stepsize, order conditions, and parameters. (Global Journal of Mathematical Sciences: 2002 1 (1&2): 1-12)
OpenAlex reports 2 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 the light of (4) and (5), a new third order explicit Runge – Kutta Method with equal nodes and it's computer implementation were highlighted. The method compared efficiently with the existing third order explicit Runge – Kutta methods proposed by Kutta, Ralston, Heun and Nystrom respectively. Key Word: Explicit Runge – Kutta methods, Stepsize, order conditions, and parameters. (Global Journal of Mathematical Sciences: 2002 1 (1&2): 1-12)
Key concepts: Runge–Kutta methods, Third order, Order (exchange), Applied mathematics, Mathematics, Computer science, Key (lock), First order