A Higher-order Block Method for Numerical Approximation of Third-order Boundary Value Problems in ODEs

Abstract

In recent times, numerical approximation of 3rd-order boundary value problems (BVPs) has attracted great attention due to its wide applications in solving problems arising from sciences and engineering. Hence, A higher-order block method is constructed for the direct solution of 3rd-order linear and non-linear BVPs. The approach of interpolation and collocation is adopted in the derivation. Power series approximate solution is interpolated at the points required to suitably handle both linear and non-linear third-order BVPs while the collocation was done at all the multiderivative points. The three sets of discrete schemes together with their first, and second derivatives formed the required higher-order block method (HBM) which is applied to standard third-order BVPs. The HBM is self-starting since it doesn’t need any separate predictor or starting values. The investigation of the convergence analysis of the HBM is completely examined and discussed. The improving tactics are fully considered and discussed which resulted in better performance of the HBM. Three numerical examples were presented to show the performance and the strength of the HBM over other numerical methods. The comparison of the HBM errors and other existing work in the literature was also shown in curves.

New Invariant Quantity To Measure The Entanglement In The Braids

“…The permutation problem is a serious obstacle for calculating thirdorder linking numbers. A requirement for higher-order winding numbers is to avoid such problems [11]. In this paper, we are showing that the Evans-Berger and Akhmetev's formulas coincide in certain cases.…”

Unveiling the Power of Implicit Six-Point Block Scheme: Advancing numerical approximation of two-dimensional PDEs in physical systems

“…According to the established theorem by in Familua et al and Jain et al in references [43] and [57]), this subsection analyzed the order of accuracy, constants of errors, zero-stability, and finally the consistency of the ISBS. The linear operator listed below can be used to represent the Scheme (28) and its related variants.…”

“…where � C s ; s ¼ 1; 2; ::: Definition 3.1.1 (Order) (Familua et al [43]) The ISBS (29) and its linear operators are assigned an order p if The inverse of a matrix A denoted by A −1 is given as A À 1 ¼ adjðAÞ jAj . where adjðAÞ is the ad joint of matrix A and |A| is the determinant of the matrix.…”

“…Olaiya et al [ 42 ] scrutinized the numerical models utilized in resolving the solutions for the Black-Scholes differential equation. Additionally, Familua et al [ 43 ] conducted an in-depth examination of advanced self-starting algorithms tailored for numerically simulating differential equations featuring second derivatives, offering diverse practical applications.…”

Ninth-order Multistep Collocation Formulas for Solving Models of PDEs Arising in Fluid Dynamics: Design and Implementation Strategies

“…Likewise, Olaiya et al in [34] presented a numerical approach for simulating the Black-Scholes partial differential equation via a two-step off-grip block of algorithms of algebraic order seven. Lastly, the work of Familua et al in [35] considered a higher-order block technique for the numerical simulation of thirdorder boundary value problems with applications. The theoretical analysis of the methods was investigated and discussed comprehensively.…”