Partitioning ordinary differential equations using Runge-Kutta methods
type: Item
instance of: scholarly article
title: Partitioning ordinary differential equations using Runge-Kutta methods
zbMATH Open document ID: 0871.65069
DOI: 10.1016/0096-3003(95)00247-2
author: F. Ismail
author: Kamel Ariffin B. M. Atan
author: M. B. Suleiman
published in: Applied Mathematics and Computation
publication date: 1997-10-07T00:00:00Z
full work available at URL: Partitioning ordinary differential equations using Runge-Kutta methods.pdf
review text: This paper considers a partitioning strategy for an ordinary differential equation into stiff and non-stiff subsystems based on the non-convergence of an initial non-stiff process and a numerical solution based on a three stage semi-implicit Runge-Kutta method with Newton or fixed point implementation. Some numerical results are presented.
Mathematics Subject Classification ID: 65L06
Mathematics Subject Classification ID: 34A34
Mathematics Subject Classification ID: 34E13
Mathematics Subject Classification ID: 65L05
zbMATH DE Number: 1006532
zbMATH Keywords: stiff system
zbMATH Keywords: partitioning strategy
zbMATH Keywords: semi-implicit Runge-Kutta method
zbMATH Keywords: numerical results
reviewed by: Kevin Burrage
MaRDI profile type: Publication
OpenAlex ID: W2047347911
cites work: Partitioned adaptive Runge-Kutta methods for the solution of nonstiff and stiff systems
cites work: Type-Insensitive ODE Codes Based on Implicit A-Stable Formulas
cites work: Using nonconvergence of iteration to partition ODEs
cites work: Partitioned Runge-Kutta methods with stiffness detection and stepsize control
description: scientific article; zbMATH DE number 1006532