2011
DOI: 10.5251/ajsir.2011.2.2.161.173
|View full text |Cite
|
Sign up to set email alerts
|

Formation of hybrid block method of higher step-sizes, through the continuous multi-step collocation

Abstract: We construct a self-starting Simpson's type block hybrid method (BHM) consisting of very closely accurate members each of order p=q+2 as a block. The higher order members of each were obtained by increasing the number k in the multi-step collocation (MC) used to derive the k-step continuous formula (k≥2) through the aid of MAPLE soft wire program. The stability analysis is poorer as the step size k increases, as expected with the linear multi-step methods (lmms), discrete or continuous. In this paper we identi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
15
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(15 citation statements)
references
References 0 publications
0
15
0
Order By: Relevance
“…Note that, which is also the expression for the mass of the substance at any time t. Applying our new half step numerical scheme (8) to solve the Growth model (22) gives results as shown in Table 3 [16,17] (Table 3). …”
Section: Problem 3 (Decay Model)mentioning
confidence: 99%
See 2 more Smart Citations
“…Note that, which is also the expression for the mass of the substance at any time t. Applying our new half step numerical scheme (8) to solve the Growth model (22) gives results as shown in Table 3 [16,17] (Table 3). …”
Section: Problem 3 (Decay Model)mentioning
confidence: 99%
“…We also assume that   N t is the population size at time ( Table 2). t The theoretical solution of (18) Applying our new half step numerical scheme (8) to solve the Growth model (17) gives results as shown in Table 2 [16].…”
Section: Problem 2 (Growth Model)mentioning
confidence: 99%
See 1 more Smart Citation
“…Where y satisfies a given set of initial condition (Ibijola, et al, 2011), and we assume that the function f also satisfies the Lipschitz condition which guarantees existence, uniqueness and continuous differentiable solution, [6]. For the discrete solution of (1) linear multi-step methods has being studied by [7], [8], and continuous solutions of (1) [9]and [12], [13].…”
Section: Introductionmentioning
confidence: 99%
“…Block methods for solving ordinary differential equations have initially been proposed by [10] who advanced their use only as a means of obtaining starting values for predictor-corrector algorithms. Several authors [3], [4], [5], [11], [13,[15], [16], [ 17] among others, have modified it to be more efficient as a computational procedure for the integration of IVPs throughout the range of integration rather than just as a starting method for method for multistep methods [1].…”
Section: Introductionmentioning
confidence: 99%