Butcher-Kuntzmann methods for nonstiff problems on parallel computers
type: Item
instance of: scholarly article
title: Butcher-Kuntzmann methods for nonstiff problems on parallel computers
zbMATH Open document ID: 0812.65064
DOI: 10.1016/0168-9274(94)00032-8
author: P. J. van der Houwen
author: B. P. Sommeijer
published in: Applied Numerical Mathematics
publication date: 1995-05-14T00:00:00Z
review text: Theoretical paper about Butcher-Kuntzmann Runge-Kutta methods. These implicit-type methods are of interest also for non-stiff ordinary differential equations in connection with an efficient predictor and an efficient iterative scheme. One example is presented. Unfortunately, the question of the use on parallel computers (use with increasing number of processors etc.) is not mentioned in this paper.
Mathematics Subject Classification ID: 65L06
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65L05
Mathematics Subject Classification ID: 34A34
zbMATH DE Number: 699077
zbMATH Keywords: Butcher-Kuntzmann methods
zbMATH Keywords: nonstiff problems
zbMATH Keywords: parallel computation
zbMATH Keywords: Runge-Kutta methods
zbMATH Keywords: iterative scheme
MaRDI profile type: Publication
full work available at URL: 0168-9274(94)00032-8
OpenAlex ID: W2043911271
cites work: Implicit Runge-Kutta Processes
cites work: The Faber Polynomials for Circular Sectors
cites work: Q5533688
cites work: Q3779682
cites work: The Potential for Parallelism in Runge–Kutta Methods. Part 1: RK Formulas in Standard Form
cites work: Q3291844
cites work: Q4733317
cites work: High order embedded Runge-Kutta formulae
cites work: Preconditioning in implicit initial-value problem methods on parallel computers
cites work: Parallel iteration of high-order Runge-Kutta methods with stepsize control
description: scientific article; zbMATH DE number 699077