Skip to content
Research Article Open access CC BY 4.0

Construction of Stable High Order One-Block Methods Using Multi-Block Triple

I. J. Ajie, K. Utalor, M. O. Durojaiye

Journal of Advances in Mathematics and Computer Science · pp. 1–13 · Published 14 Jun 2019

10.9734/jamcs/2019/v32i530158

Abstract

This paper deals with the construction of l-stable implicit one-block methods for the solution of stiff initial value problems. The constructions are done using three different multi-block methods. The first multi-block method is composed using Generalized Backward Differentiation Formula (GBDF) and Backward Differentiation Formula (BDF), the second is composed using Reversed Generalized Adams Moulton (RGAM) and Generalized Adams Moulton (GAM) while the third is composed using Reversed Adams Moulton (RAM) and Adams Moulton (AM). Shift operator is then applied to the combination of the three multi-block methods in such a manner that the resultant block is a one-block method and self-starting. These one-block methods are up to order six and  with at order ten. Numerical experiments show that they are good for solving stiff initial problems.

l-stable multi-block stiff initial value problem one-block and self-starting

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

10

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.