1 Introduction

Differential equations are the best language for expressing many of the general laws of nature in quantum physics, electronics, computational chemistry and astronomy [1]. They are important because for many physical systems, one can subject it to suitable idealizations. They are important in mathematics and the sciences because they can be used to model a wide variety of real-world situations, [2, 3]. In physics, for example, differential equations can be used to model the motion of particles in a fluid, the trajectory of a projectile, calculate the movement or flow of electricity, motion of an object to and fro like a pendulum, to explain thermodynamics concepts. Also, in medical terms, they are used to check the growth of diseases in graphical representation [4, 5].

The primary purpose of the study of differential equation is the study of solutions that satisfy the equations and the properties of the solutions. Therefore, understanding the solutions of these equations is of paramount interest [6,7,8]. The exact solution is obtained analytically while the numerical solutions are demonstrated using some techniques, namely, the adaptive moving mesh and uniform mesh methods with the exact solution presented in a form of convergent power series [9, 10].

In this work, the block method approach (numerical solutions) will be considered because it provides a faster and easy way to solve problems among other advantages as compared to the analytic method of solution [11, 12]. These solutions are available only at selected (discrete) solution points, but not at all points covered by the functions as in the case with analytical solution methods [2, 13].

One of the major advantages of using block methods is that the methods do not require starting values [14,15,16]. Hence, they are cheaper to implement and it also has the capability of generating simultaneous approximate solutions at grid points within the interval of integration [17,18,19]. For more on block methods, see the works of [12, 19,20,21].

A number of methods have been proposed in literature for the solution of systems of first order IVPs. The authors in [9] proposed the adoption of hybrid block methods for the solution of first order IVPs of the form (1). They went further to implement the proposed method on some sets of first-order problems. The author in [22] formulated block hybrid methods with intra-step points for the solution of first order linear and nonlinear differential equations. They further used the absolute and residual error analysis to carry out the analysis of some basic properties of the methods. The authors in [23] derived a pair of three-step hybrid block methods of orders five and six for the solution of linear and nonlinear first-order systems using the power series polynomial as the basis function to derive the methods, the convergence analysis of the methods was also carried out. The authors in [24] formulated a sixth-order hybrid block method for the solution of first order IVPs. The Lagrange polynomial was adopted as the basis function in constructing the method and the method was found to be A-stable. The authors in [25] derived a class of hybrid block methods for the solution of first-order IVPs. They analysed the convergence properties of the methods. The authors in [26,27,28,29] also gave deep insight as to how to analyze algorithms for solving differential systems. Other authors that used hybrid block methods to solve first order IVPs are [8, 30,31,32].

Most of the conventional methods for solving systems of first-order IVPs of the form (1) have been reported to have some setbacks like low order of accuracy, large function evaluation and large error constants. The desire to address some of these challenges necessitated this research. The proposed BHA has the advantages of possessing fewer number of function evaluation per step, high order of accuracy and very small error constants.

The paper is structured into four sections as follows. Section 1 introduces the topic and the main aim of the article. In Sect. 2, the BHA is derived and analyzes for consistency, zero-stability and convergence. The applicability and validity of the algorithm is tested on some few systems of first order IVPs of ordinary differential equations in Sect. 3. Finally, some concluding remarks and suggestions are contained in Sect. 4.

2 Derivation and convergence analysis of the BHA

Consider the IVP of first order ordinary differential equation of the form

$$ y^{\prime } \left( x \right) = f\left( {x,y\left( x \right)} \right), y\left( {x_{0} } \right) = y_{0} $$
(1)

where \(y(x)\) is the unknown function to be determined. The idea here is to approximate the exact solution \(y(x)\) of (1) in the partition \({I}_{n}=[a={x}_{0}<{x}_{1}<{x}_{2}<\dots <{x}_{n}=b]\) of the integration interval \([a, b]\) with a constant step size \(h={x}_{i}-{x}_{i-1}, i=1,\dots ,n\) by a shifted Legendre polynomial basis function of degree \(s+r-1\) of the form;

$$ y\left( x \right) = \mathop \sum \limits_{i = 0}^{s + r - 1} c_{i} P_{i} \left( t \right) $$
(2)

where \(P_{i} \left( t \right) = \mathop \sum \nolimits_{k = 0}^{i} \left( { - 1} \right)^{{\left( {i + k} \right)}} \frac{{\left( {i + k} \right)!t^{k} }}{{\left( {i - k} \right)!\left( {k!} \right)^{2} 1^{k} }}\), \(c_{i} \in {\mathbb{R}}\), \(y \in C^{1} \left( {a,b} \right)\) and \(t = \left( {x - x_{n} } \right)\). The shifted Legendre polynomial was used as basis function in deriving the new block hybrid algorithm. This is in contrast to the power series polynomial basis function that is conventionally used in most literatures.

The first derivative of (2) is then substituted into (1) to obtain a differential system of the form

$$ y^{\prime } \left( x \right) = \mathop \sum \limits_{i = 0}^{s + r - 1} c_{i} P_{i}^{\prime } \left( t \right) = f\left( {x,y\left( x \right)} \right) $$
(3)

Now interpolating (2) at \({x}_{n+s}, s=0, \frac{4}{5}\) and collocating (3) at \({x}_{n+r},r=0\left(\frac{1}{5}\right)1\) where \(s\) and \(r\) represents the interpolation and collocation points respectively, the continuous scheme of the form below is obtained;

$$ y\left( x \right) = \alpha_{0} \left( x \right)y_{n} + \alpha_{\frac{4}{5}} \left( x \right)y_{{n + \frac{4}{5}}} + h\left( {\mathop \sum \limits_{\tau = 0}^{ 1} \beta_{\tau } \left( x \right)f\left( {x_{n + \tau } ,y_{n + \tau } } \right) + \mathop \sum \limits_{{v = \frac{1}{5}, \frac{3}{10}, \frac{2}{5}, \frac{3}{5} \frac{4}{5}}}^{ 1} \beta_{v} \left( x \right)f\left( {x_{n + v} ,y_{n + v} } \right)} \right) $$
(4)

where

$${\alpha }_{0}\left(x\right)=1-\frac{7875}{32{h}^{2}}{x}^{2}+\frac{119875}{64{h}^{3}}{x}^{3}-\frac{2953125}{512{h}^{4}}{x}^{4}+\frac{1115625}{128{h}^{5}}{x}^{5}-\frac{1640625}{256{h}^{6}}{x}^{6}+\frac{234375}{128{h}^{7}}{x}^{7}$$
$${\alpha }_\frac{4}{5}\left(x\right)=\frac{7875}{32{h}^{2}}{x}^{2}-\frac{119875}{64{h}^{3}}{x}^{3}+\frac{2953125}{512{h}^{4}}{x}^{4}-\frac{1115625}{128{h}^{5}}{x}^{5}+ \frac{1640625}{256{h}^{6}}{x}^{6}-\frac{234375}{128{h}^{7}}{x}^{7}$$
$${\beta }_{0}\left(x\right)=x-\frac{1009}{48h}{x}^{2}+\frac{38065}{288{h}^{2}}{x}^{3}-\frac{292625}{768{h}^{3}}{x}^{4}+\frac{107125}{192{h}^{4}}{x}^{5}-\frac{464375}{1152{h}^{5}}{x}^{6}+\frac{21875}{192{h}^{6}}{x}^{7}$$
$${\beta }_\frac{1}{5}\left(x\right)=\frac{17255}{36{h}^{2}}{x}^{3}-\frac{148625}{96{h}^{3}}{x}^{4}+\frac{9625}{4{h}^{4}}{x}^{5}-\frac{259375}{144{h}^{5}}{x}^{6}+\frac{3125}{6{h}^{6}}{x}^{7}-\frac{115}{2h}{x}^{2}$$
$${\beta }_\frac{2}{5}\left(x\right)=\frac{19735}{72{h}^{2}}{x}^{3}- \frac{147625}{192{h}^{3}}{x}^{4}+\frac{51125}{48{h}^{4}}{x}^{5}- \frac{209375}{288{h}^{5}}{x}^{6}+\frac{3125}{16{h}^{6}}{x}^{7}-\frac{155}{4h}{x}^{2}$$
$${\beta }_\frac{3}{5}\left(x\right)=\frac{8615}{18{h}^{2}}{x}^{3}-\frac{72625}{48{h}^{3}}{x}^{4}+\frac{14125}{6{h}^{4}}{x}^{5}-\frac{128125}{72{h}^{5}}{x}^{6}+\frac{3125}{6{h}^{6}}{x}^{7}-\frac{185}{3h}{x}^{2}$$
$$ \beta_{\frac{4}{5}} \left( x \right) = \frac{39665}{{288h^{2} }}x^{3} - \frac{316625}{{768h^{3} }}x^{4} + \frac{38375}{{64h^{4} }}x^{5} - \frac{484375}{{1152h^{5} }}x^{6} + \frac{21875}{{192h^{6} }}x^{7} - \frac{295}{{16h}}x^{2} $$
$$ \beta_{1} \left( x \right) = \frac{1}{2h}x^{2} - \frac{125}{{36h^{2} }}x^{3} + \frac{875}{{96h^{3} }}x^{4} - \frac{125}{{12h^{4} }}x^{5} + \frac{625}{{144h^{5} }}x^{6} $$

In order to obtain the discrete BHA, Eq. (4) is evaluated at \(x={x}_{n}, {x}_{n+\frac{1}{5}}, \dots , {x}_{n+1}\) and its first derivative evaluated at \({x}_{n+\frac{3}{10}}\), to give the following discrete BHA in Table 1 below.

Table 1 The BHA

Equation (4) is the continuous scheme while Table 1 gives the corresponding block discrete schemes for the one-step hybrid block method.

2.1 Order and error constant

Expanding each term of the block discrete schemes in Table 1 in Taylor’s series using for instance scheme 1 given by;

$${y}_{n+1}= \frac{1375}{512}{y}_{n+\frac{4}{5}}-\frac{233}{2304}h{f}_{n}-\frac{863}{512}{y}_{n}+\frac{19}{288}h{f}_{n+1}- \frac{145}{288}h{f}_{n+\frac{1}{5}}-\frac{65}{576}h{f}_{n+\frac{2}{5}}-\frac{85}{144}h{f}_{n+\frac{3}{5}}+\frac{215}{2304}h{f}_{n+\frac{4}{5}}$$

Now, expanding each term of the above discrete scheme in Taylor’s series and adding together the coefficients of \(h{y}_{n}\) in all the terms of the scheme, we have

$$ \frac{863}{{512}}y_{n} = \frac{863}{{512}}\mathop \sum \limits_{j = 0}^{10} \frac{{\left( 0 \right)^{j} h^{j} }}{j!}y_{n}^{\left( j \right)} = \frac{863}{{512}} $$
$$ y_{n + 1} = \mathop \sum \limits_{j = 0}^{8} \frac{{\left( 1 \right)^{j} h^{j} }}{j!}y_{n}^{\left( j \right)} = \left( \frac{1}{362880} \right)h^{9} y_{{\left\{ n \right\}}}^{9} + \left( \frac{1}{40320} \right)h^{8} y_{{\left\{ n \right\}}}^{8} + \left( \frac{1}{5040} \right)h^{7} y_{{\left\{ n \right\}}}^{7} + \left( \frac{1}{720} \right)h^{6} y_{{\left\{ n \right\}}}^{6} + \left( \frac{1}{120} \right)h^{5} y_{{\left\{ n \right\}}}^{5} + \left( \frac{1}{24} \right)h^{4} y_{{\left\{ n \right\}}}^{4} + \left( \frac{1}{6} \right)h^{3} y_{{\left\{ n \right\}}}^{3} + \left( \frac{1}{2} \right)h^{2} y_{{\left\{ n \right\}}}^{2} + hy_{{\left\{ n \right\}}} + 1 $$
$$ - \frac{1375}{{512}}y_{{n + \frac{4}{5}}} = - \frac{1375}{{512}}\mathop \sum \limits_{j = 0}^{8} \frac{{\left( \frac{4}{5} \right)^{j} h^{j} }}{j!}y_{n}^{\left( j \right)} = - \left( {\frac{11}{{984375}}} \right)h^{8} y_{{\left\{ n \right\}}}^{8} - \left( {\frac{22}{{196875}}} \right)h^{7} y_{{\left\{ n \right\}}}^{7} - \left( {\frac{11}{{11250}}} \right)h^{6} y_{{\left\{ n \right\}}}^{6} - \left( {\frac{11}{{1500}}} \right)h^{5} y_{{\left\{ n \right\}}}^{5} - \left( {\frac{11}{{240}}} \right)h^{4} y_{{\left\{ n \right\}}}^{4} - \left( {\frac{11}{{48}}} \right)h^{3} y_{{\left\{ n \right\}}}^{3} - \left( {\frac{55}{{64}}} \right)h^{2} y_{{\left\{ n \right\}}}^{2} - \left( {\frac{275}{{128}}} \right)hy_{{\left\{ n \right\}}} - \left( {\frac{1375}{{512}}} \right) $$
$$ \frac{233}{{2304}}hf_{n} = \frac{233}{{2304}}h\mathop \sum \limits_{j = 0}^{8} \frac{{\left( 0 \right)^{j} h^{j} }}{j!}y_{n}^{{\left( {j + 1} \right)}} = \left( {\frac{233}{{2304}}} \right)hy_{{\left\{ n \right\}}} $$
$$ \frac{145}{{288}}hf_{{n + \frac{1}{5}}} = \frac{145}{{288}}h\mathop \sum \limits_{j = 0}^{8} \frac{{\left( \frac{1}{5} \right)^{j} h^{j} }}{j!}y_{n}^{{\left( {j + 1} \right)}} = \left( {\frac{29}{{907 200000000}}} \right)h^{9} y_{{\left\{ n \right\}}}^{9} + \left( {\frac{29}{{22 680000000}}} \right)h^{8} y_{{\left\{ n \right\}}}^{8} + \left( {\frac{29}{{648000000}}} \right)h^{7} y_{{\left\{ n \right\}}}^{7} + \left( {\frac{29}{{21600000}}} \right)h^{6} y_{{\left\{ n \right\}}}^{6} + \left( {\frac{29}{{864000}}} \right)h^{5} y_{{\left\{ n \right\}}}^{5} + \left( {\frac{29}{{43200}}} \right)h^{4} y_{{\left\{ n \right\}}}^{4} + \left( {\frac{29}{{2880}}} \right)h^{3} y_{{\left\{ n \right\}}}^{3} + \left( {\frac{29}{{288}}} \right)h^{2} y_{{\left\{ n \right\}}}^{2} + \left( {\frac{145}{{288}}} \right)hy_{{\left\{ n \right\}}} $$
$$ \frac{65}{{576}}hf_{{n + \frac{2}{5}}} = \frac{65}{{576}}h\mathop \sum \limits_{j = 0}^{8} \frac{{\left( \frac{2}{5} \right)^{j} h^{j} }}{j!}y_{n}^{{\left( {j + 1} \right)}} = \left( {\frac{13}{{7087500000}}} \right)h^{9} y_{{\left\{ n \right\}}}^{9} + \left( {\frac{13}{{354375000}}} \right)h^{8} y_{{\left\{ n \right\}}}^{8} + \left( {\frac{13}{{20250000}}} \right)h^{7} y_{{\left\{ n \right\}}}^{7} + \left( {\frac{13}{{1350000}}} \right)h^{6} y_{{\left\{ n \right\}}}^{6} + \left( {\frac{13}{{108000}}} \right)h^{5} y_{{\left\{ n \right\}}}^{5} + \left( {\frac{13}{{10800}}} \right)h^{4} y_{{\left\{ n \right\}}}^{4} + \left( {\frac{13}{{1440}}} \right)h^{3} y_{{\left\{ n \right\}}}^{3} + \left( {\frac{13}{{288}}} \right)h^{2} y_{{\left\{ n \right\}}}^{2} + \left( {\frac{65}{{576}}} \right)hy_{{\left\{ n \right\}}} $$
$$ \frac{85}{{144}}hf_{{n + \frac{3}{5}}} = \frac{85}{{144}}h\mathop \sum \limits_{j = 0}^{8} \frac{{\left( \frac{3}{5} \right)^{j} h^{j} }}{j!}y_{n}^{{\left( {j + 1} \right)}} = \left( {\frac{1377}{{5600000000}}} \right)h^{9} y_{{\left\{ n \right\}}}^{9} + \left( {\frac{459}{{140000000}}} \right)h^{8} y_{{\left\{ n \right\}}}^{8} + \left( {\frac{153}{{4000000}}} \right)h^{7} y_{{\left\{ n \right\}}}^{7} + \left( {\frac{153}{{400000}}} \right)h^{6} y_{{\left\{ n \right\}}}^{6} + \left( {\frac{51}{{16000}}} \right)h^{5} y_{{\left\{ n \right\}}}^{5} + \left( {\frac{17}{{800}}} \right)h^{4} y_{{\left\{ n \right\}}}^{4} + \left( {\frac{17}{{160}}} \right)h^{3} y_{{\left\{ n \right\}}}^{3} + \left( {\frac{17}{{48}}} \right)h^{2} y_{{\left\{ n \right\}}}^{2} + \left( {\frac{85}{{144}}} \right)hy_{{\left\{ n \right\}}} $$
$$ - \frac{215}{{2304}}hf_{{n + \frac{4}{5}}} = - \frac{215}{{2304}}h\mathop \sum \limits_{j = 0}^{8} \frac{{\left( \frac{4}{5} \right)^{j} h^{j} }}{j!}y_{n}^{{\left( {j + 1} \right)}} = - \left( {\frac{86}{{221484375}}} \right)h^{9} y_{{\left\{ n \right\}}}^{9} - \left( {\frac{172}{{44296875}}} \right)h^{8} y_{{\left\{ n \right\}}}^{8} - \left( {\frac{43}{{1265625}}} \right)h^{7} y_{{\left\{ n \right\}}}^{7} - \left( {\frac{43}{{168750}}} \right)h^{6} y_{{\left\{ n \right\}}}^{6} - \left( {\frac{43}{{27000}}} \right)h^{5} y_{{\left\{ n \right\}}}^{5} - \left( {\frac{43}{{5400}}} \right)h^{4} y_{{\left\{ n \right\}}}^{4} - \left( {\frac{43}{{1440}}} \right)h^{3} y_{{\left\{ n \right\}}}^{3} - \left( {\frac{43}{{576}}} \right)h^{2} y_{{\left\{ n \right\}}}^{2} - \left( {\frac{215}{{2304}}} \right)hy_{{\left\{ n \right\}}} $$
$$ - \frac{19}{{288}}hf_{n + 1} = - \frac{19}{{288}}h\mathop \sum \limits_{j = 0}^{8} \frac{{\left( 1 \right)^{j} h^{j} }}{j!}y_{n}^{{\left( {j + 1} \right)}} = - \left( {\frac{19}{{11612160}}} \right)h^{9} y_{{\left\{ n \right\}}}^{9} - \left( {\frac{19}{{1451520}}} \right)h^{8} y_{{\left\{ n \right\}}}^{8} - \left( {\frac{19}{{207360}}} \right)h^{7} y_{{\left\{ n \right\}}}^{7} - \left( {\frac{19}{{34560}}} \right)h^{6} y_{{\left\{ n \right\}}}^{6} - \left( {\frac{19}{{6912}}} \right)h^{5} y_{{\left\{ n \right\}}}^{5} - \left( {\frac{19}{{1728}}} \right)h^{4} y_{{\left\{ n \right\}}}^{4} - \left( {\frac{19}{{576}}} \right)h^{3} y_{{\left\{ n \right\}}}^{3} - \left( {\frac{19}{{288}}} \right)h^{2} y_{{\left\{ n \right\}}}^{2} - \left( {\frac{19}{{288}}} \right)hy_{{\left\{ n \right\}}} $$

Let \({C}_{0}\) be the coefficient of \({\left(h{y}_{n}\right)}^{0}\), \({C}_{1}\) be the coefficient of \({\left(h{y}_{n}\right)}^{1}\) and \({C}_{2}\) be the coefficient of \({\left(h{y}_{n}\right)}^{2}\) respectively and so on. Summing up these coefficients we, obtain the following;

$${C}_{0}=\left(\frac{863}{512}\right)+1-\left(\frac{1375}{512}\right)=0$$
$${C}_{1}=1-\left(\frac{275}{128}\right)+\left(\frac{233}{2304}\right)+\left(\frac{145}{288}\right)+\left(\frac{65}{576}\right)+\left(\frac{85}{144}\right)-\left(\frac{215}{2304}\right)-\left(\frac{19}{288}\right)=0$$
$${C}_{2}=\left(\frac{1}{2}\right)-\left(\frac{55}{64}\right)+\left(\frac{29}{288}\right)+\left(\frac{13}{288}\right)+\left(\frac{17}{48}\right)-\left(\frac{43}{576}\right)-\left(\frac{19}{288}\right)= 0$$
$${C}_{3}=-\left(\frac{19}{576}\right)-\left(\frac{43}{1440}\right)+\left(\frac{17}{160}\right)+\left(\frac{13}{1440}\right)+\left(\frac{29}{2880}\right)-\left(\frac{11}{48}\right)+\left(\frac{1}{6}\right)= 0$$
$${C}_{4}=-\left(\frac{19}{1728}\right)-\left(\frac{43}{5400}\right)+\left(\frac{17}{800}\right)+\left(\frac{13}{10800}\right)+\left(\frac{29}{43200}\right)-\left(\frac{11}{240}\right)+\left(\frac{1}{24}\right)= 0$$
$${C}_{5}=-\left(\frac{19}{6912}\right)-\left(\frac{43}{27000}\right)+\left(\frac{51}{16000}\right)+\left(\frac{13}{108000}\right)+\left(\frac{29}{864000}\right)-\left(\frac{11}{1500}\right)+\left(\frac{1}{120}\right)= 0$$
$${C}_{6}=-\left(\frac{19}{34560}\right)-\left(\frac{43}{168750}\right)+\left(\frac{153}{400000}\right)+\left(\frac{13}{1350000}\right)+\left(\frac{29}{21600000}\right)-\left(\frac{11}{11250}\right)+\left(\frac{1}{720}\right)= 0$$
$${C}_{7}=-\left(\frac{19}{207360}\right)-\left(\frac{43}{1265625}\right)+\left(\frac{153}{4000000}\right)+\left(\frac{13}{20250000}\right)+\left(\frac{29}{648000000}\right)-\left(\frac{22}{196875}\right)+\left(\frac{1}{5040}\right)= 0$$
$$ C_{8} = - \left( {\frac{19}{{1451520}}} \right) - \left( {\frac{172}{{44296875}}} \right) + \left( {\frac{459}{{140000000}}} \right) + \left( {\frac{13}{{354375000}}} \right) + \left( {\frac{29}{{22680000000}}} \right) - \left( {\frac{11}{{984375}}} \right) + \left( \frac{1}{40320} \right) = - \left( {\frac{11}{{378000000}}} \right) = - 2. 910052910 05 \times 10^{ - 8} $$

Hence, the order of the discrete scheme 1 is \(C_{p} = C_{7} \to p = 7\) and error constant \(C_{p + 1} = C_{8} \ne 0 = - 2. 9101 \times 10^{ - 8}\) as shown in Table 2 below and the order and error constants of the remaining schemes are computed using the same approach.

Table 2 Order and error constants of individual members of the BHA

Hence, the BHA has uniform order \(\check{p} = 7\) as can be seen in Table 2 below.

2.2 Consistency

The block discrete schemes in Table 1 is said to be consistent if the following conditions hold:

  1. (i)

    It has order \( \check{p} \ge 1,\)

  2. (ii)

    \(\mathop \sum \nolimits_{j = 0}^{k} \check{\alpha }_{j} = 0,\)

  3. (iii)

    \(\sum\nolimits_{j = 0}^{k} j\hat{\alpha }_{j} = \sum\nolimits_{j = 0}^{k} \check{\beta }_{j} ,\)

  4. (iv)

    \(\rho \left(1\right)=0\) and \(\rho^{\prime } \left( 1 \right) = \sigma \left( 1 \right),\)

where \(\rho (r)\) and \(\sigma (r)\) are the first and the second characteristic polynomials of the block discrete schemes in Table 1. Following [2, 3, 9, 10], condition (i) is a sufficient condition for the block discrete schemes in Table 1 to be consistent. Since \(\hat{p} = 7 > 1\), hence the BHA is consistent.

2.3 Zero-stability

The block discrete schemes in Table 1 is said to be zero stable if the roots \({z}_{r}; r =1, \dots ,n\) of the first characteristic polynomial \(p(z)\), defined by

$$p\left(z\right)=det\left|zQ-T\right|$$

satisfies \(\left|{z}_{r}\right|\le 1\) and every root with \(\left|{z}_{r}\right|=1\) has multiplicity not exceeding the order of the differential equation in the limit as \(h\to 0\), [13].

Calculations from all available information revealed that the BHA has the following roots

$${z}^{5}\left(z - 1\right)= 0\Rightarrow z=(\text{0,0}, 0, 0, 0, 1)$$

Hence, the BHA is zero-stable, since all roots with modulus one does not have multiplicity exceeding the order of the differential equation in the limit as \(h \to 0\).

2.4 Convergence

According to [10, 33], we can safely assert the convergence of the block discrete schemes in Table 1 since the BHA is consistent and zero-stable.

3 Numerical experiments

In this section, some systems of first-order IVPs shall be solved using the BHA. The absolute errors of the BHA shall be compared with those of some existing methods. The following notations shall be used in Tables 3, 4 and 5 and Figs. 1, 2 and 3.

Table 3 Comparison of the performance of the BHA on Problem 1
Table 4 Comparison of the performance of the BHA on Problem 2
Table 5 Comparison of the performance of the BHA on Problem 3
Fig. 1
figure 1

Solution curves for Problem 1

Fig. 2
figure 2

Solution curves for Problem 2

Fig. 3
figure 3

Solution curves for Problem 3

\(x\): point of evaluation.

\({y}_{i}\): solution component.

\({\text{N}}_{\text{e}}=\left|{y}_{E}-{y}_{N}\right|\): absolute error.

BHA: the proposed block hybrid algorithm.

Problem 1

Consider a mildly stiff system problem which was solved by [30]

\(\left[ {\begin{array}{*{20}c} {y_{1}^{\prime } \left( x \right)} \\ {y_{2}^{\prime } \left( x \right)} \\ \end{array} } \right] = \left[ {\begin{array}{*{20}c} {998} & {1998} \\ { - 999} & { - 1999} \\ \end{array} } \right]\left[ {\begin{array}{*{20}c} {y_{1} \left( x \right)} \\ {y_{2} \left( x \right)} \\ \end{array} } \right]\), with initial conditions \(\left[\begin{array}{c}{y}_{1}\left(0\right)\\ {y}_{2}\left(0\right)\end{array}\right]=\left[\begin{array}{c}1\\ 1\end{array}\right]\), and the exact solution of the systems is given as \(\left[\begin{array}{c}{y}_{1}\left(x\right)\\ {y}_{2}\left(x\right)\end{array}\right]=\left[\begin{array}{c}{4e}^{-x}-3{e}^{-1000x}\\ {-2e}^{-x}+3{e}^{-1000x}\end{array}\right]\).

The computed results are shown in Table 3, while the theoretical and numerical results are plotted graphically in Fig. 1.

Problem 2

Consider the following linear differential equation solved by [8],

\(\left[ {\begin{array}{*{20}c} {y_{1}^{\prime } } \\ {y_{2}^{\prime } } \\ \end{array} } \right] = \left[ {\begin{array}{*{20}c} { - 4y_{1} } \\ {2y_{2} } \\ \end{array} } \right]\), with initial conditions \(\left[\begin{array}{c}{y}_{1}\left(0\right)\\ {y}_{2}\left(0\right)\end{array}\right]=\left[\begin{array}{c}1\\ 1\end{array}\right]\) and the exact solution of this problem is \(\left[\begin{array}{c}{y}_{1}\left(x\right)\\ {y}_{2}\left(x\right)\end{array}\right]=\left[\begin{array}{c}{e}^{-4x}\\ {e}^{2x}\end{array}\right]\). The numerical results are shown in Table 4 while Fig. 2 shows the solution curves for the Problem.

Problem 3

Consider the following nonlinear stiff problem \(\left[ {\begin{array}{*{20}c} {y_{1}^{\prime } } \\ {y_{2}^{\prime } } \\ \end{array} } \right] = \left[ {\begin{array}{*{20}c} { - 1002y_{1} \left( x \right) + 1000y_{2}^{2} \left( x \right)} \\ {y_{1} \left( x \right) - y_{2} \left( x \right) - y_{2}^{2} \left( x \right)} \\ \end{array} } \right],{ }\) with initial conditions \(\left[\begin{array}{c}{y}_{1}\left(0\right)\\ {y}_{2}\left(0\right)\end{array}\right]=\left[\begin{array}{c}1\\ 1\end{array}\right]\). The exact solution of this problem is \(\left[\begin{array}{c}{y}_{1}\left(x\right)\\ {y}_{2}\left(x\right)\end{array}\right]=\left[\begin{array}{c}{e}^{-2x}\\ {e}^{-x}\end{array}\right]\) which was solved by [34]. The computed results are shown in Table 5, while Fig. 3 shows the solution curves for the Problem.

From the numerical and graphical results presented in Tables 3, 4 and 5 and Figs. 1, 2 and 3, it is clear that the proposed BHA is computationally reliable. This explains why the absolute errors obtained (at selected values of \(x\)) on the applications of the BHA (on the first-order IVPs) are by far smaller than those of the existing methods we compared our results with. In essence, this implies that the proposed BHA is more accurate. Furthermore, the solution curves obtained in Figs. 1, 2 and 3 show a measure of convergence of the approximate solution (using the BHA) to the exact solutions.

4 Conclusion

In this article, the BHA derived was tested and found to be accurate, consistent, zero-stable and convergent. The method was implemented on some systems of linear and nonlinear initial value problems of ordinary differential equations and the numerical results were found to be accurate when compared with the exact solutions of other numerical methods as contained in Tables 3, 4 and 5 and their respective solution curves. It was observed that the BHA is computationally reliable for solving ordinary differential equations of the first-order. The close relation between the exact and numerical results is confirmed by the plotted graphs. The new BHA is therefore a suitable candidate for all forms (linear and nonlinear) of first-order initial value problems of ordinary differential equations. The BHA proposed in this research is therefore recommended for the solution of systems of first-order IVPs. It is important to state that the BHA derived in this research is limited to the solution of first-order IVPs only. Further study could extend this work to the numerical solution of higher order IVPs. The possibility of exploiting other basis function than the shifted Legendre polynomial is also a viable option.