Mathematics
Permanent URI for this collectionhttp://197.211.34.35:4000/handle/123456789/201
Mathematics
Browse
Item A 3-Person Non-Zero-Sum Game for Sachet Water Companies(Asian Research Journal of Mathematics, 2022-06-24) Nyor, N.; Muazu, M. I.; Somma Samuel AbuThe business of Sachet water (popularly called pure water) in Nigeria is often competitive due to the high demand for Sachet water by the populace. This is so because sachet water is the most affordable form of pure drinking water in Nigeria. As such, Sachet Water Firms that want to succeed in an ever increasing competitive market need to have the knowledge of Game Theory to identify which strategy will yield better profit independent of the strategy adopted by other competitors. This paper is aimed to investigate and determine the equilibrium point for three Sachet Water Firms using the Nash Equilibrium Method as it provides a systematic approach for deciding the best strategy in competitive situation. The result showed two Nash Equilibriums (promo, promo) and (stay-put, stay-put) with their respective payoffs of (82; 82; 82) and (147; 147; 147).Item A 3-step block hybrid backward differentiation formulae (bhbdf) for the solution of general second order ordinary differential equation(New Trends in Mathematical Sciences, 2021-07-12) Hussaini Alhassan; Muhammad RaihanatuIn this paper, the block hybrid Backward Differentiation formulae (BHBDF) for the step number k=3 is developed using power series as basis function for the solution of general second order ordinary differential equation. The idea of interpolation and collocation of the power series at some selected grid and off- grid points gave rise to continuous schemes which were further evaluated at those points to produce discrete schemes combined together to form block methods. Numerical problems were solved with the proposed methods and were found to perform effectively.Item A 4-STAGE RUNGE-KUTTA TYPE METHOD FOR SOLUTION OF STIFF ORDINARY DIFFERENTIAL EQUATIONS(Pan-American Journal of Mathematics, 2024) RAIHANATU MUHAMMAD; ABDULMALIK OYEDEJIIn this paper, a 2 step implicit block hybrid linear multistep method was reformulated into a 4-stage block hybrid Runge-Kutta Type Method via the butcher analysis. The method can be used to solve first order stiff ordinary differential equations. A numerical example solved with the proposed method showed a better result in comparison with an existing methodItem A Backward Diffrention Formula For Third-Order Inttial or Boundary Values Problems Using Collocation Method(Islamic Azad University,Rasht ', Iran, 2021-09-19) AbdGafar Tunde Tiamiyu; Abosede Temilade Cole; Khadeejah James AuduWe propose a new self-starting sixth-order hybrid block linear multistep method using backward differentiation formula for direct solution of third-order differential equations with either initial conditions or boundary conditions. The method used collocation and interpolation techniques with three off-step points and five-step points, choosing power series as the basis function. The convergence of the method is established, and three numerical experiments of initial and boundary value problems are used to demonstrate the efficiency of the proposed method. The numerical results in Tables and Figures show the efficiency of the method. Furthermore, the numerical method outperformed the results from existing literature in terms of accuracy as evident in the results of absolute errors producedItem A Sixth Order Implicit Hybrid Backward Differentiation Formulae (HBDF) for Block Solution of Ordinary Differential Equations(American Journal of Mathematics and Statistics, 2012) Muhammad R; Yahaya.Y.AThe Hybrid Backward Differentiation Formula (HBDF) for case K=5 was reformulated into continuous form using the idea of multistep collocation. Multistep Collocation is a continuous finite difference (CFD) approximation method by the idea of interpolation and collocation. The hybrid 5-step Backward Differentiation Formula (BDF) and additional methods of order (6,6,6,6,6,)𝑇𝑇 were obtained from the same continuous scheme and assembled into a block matrix equation which was applied to provide the solutions of IVPs over non-overlapping intervals.The continous form was im-mediately employed as block methods for direct solution of Ordinary Differential Equation (𝑦𝑦′=𝑓𝑓(𝑥𝑥,𝑦𝑦)). Some benefits of this study are, the proposed block methods will be self starting and does not call for special predictor to estimate 𝑦𝑦’ in the integrators and all the discrete methods obtained will be evaluated from a single continuous formula and its derivatives at various grids and off grid points. These study results help to speed up computation, also the requirement of a starting value and the overlap of solution model which are normally associated with conventional Linear Multistep Methods were elimi-nated by this approach. In conclusion, a convergence analysis of the derived hybrid schemes to establish their effectiveness and reliability was presented. Numerical example carried out on stiff problem further substantiates their performance.Item A THIRD REFINEMENT OF JACOBI METHOD FOR SOLUTIONS TO SYSTEM OF LINEAR EQUATIONS(Federal University, Dutsin Ma, Nigeria, 2023-10-15) Khadeejah James Audu; James Nkereuwem Essien; Abraham Baba Zhiri; Aliyu Rasheed TaiwoSolving linear systems of equations stands as one of the fundamental challenges in linear algebra, given their prevalence across various fields. The demand for an efficient and rapid method capable of addressing diverse linear systems remains evident. In scenarios involving large and sparse systems, iterative techniques come into play to deliver solutions. This research paper contributes by introducing a refinement to the existing Jacobi method, referred to as the "Third Refinement of Jacobi Method." This novel iterative approach exhibits its validity when applied to coefficient matrices exhibiting characteristics such as symmetry, positive definiteness, strict diagonal dominance, and 𝑀 -matrix properties. Importantly, the proposed method significantly reduces the spectral radius, thereby curtailing the number of iterations and substantially enhancing the rate of convergence. Numerical experiments were conducted to assess its performance against the original Jacobi method, the second refinement of Jacobi, and the Gauss-Seidel method. The outcomes underscore the "Third Refinement of Jacobi" method's potential to enhance the efficiency of linear system solving, thereby making it a valuable addition to the toolkit of numerical methodologies in scientific and engineering domains.Item Advancements in Solving Higher-Order Ordinary Differential Equations via the Variational Iterative Method.(Akdeniz University, Turkey, 2025-12-30) Khadeejah James Audu; Michael Ogbole Ogwuche; Sıkırulaı Abolaji Akande; Yahaya Yusuph AmudaThis study presents advancements in solving higher-order ordinary differential equations (ODEs) using the Variational Iterative Method (VIM) and compares its performance with the New Iteration Method (NIM) and Adomian Decomposition Method (ADM). ODEs are critical in modeling the rate of change in various systems over time, and many do not have exact solutions, necessitating the use of numerical methods to obtain approximate results. While several iterative methods exist, a detailed comparison of VIM with other techniques, particularly for higher-order ODEs, is still lacking. This research focuses on understanding the principles and methodology of VIM and applying it to solve higher-order linear and nonlinear ODEs. The study evaluates the accuracy, convergence rate, and computational efficiency of VIM compared to NIM and ADM through the solution of third, fourth, and fifth-order differential problems. The results show that VIM outperforms NIM and ADM, with faster convergence and higher efficiency. Error analysis in Figures 1, 2, and 3 highlights the strengths and limitations of each method, providing valuable insights for researchers and practitioners in selecting the most appropriate technique for solving higher-order ODEs. These findings advance the development of iterative methods in numerical analysis and contribute to progress in the field of differential equations.Item An Accelerated Iterative Technique: Third Refinement of Gauss–Seidel Algorithm for Linear Systems(Multidisciplinary Digital Publishing Institute, Switszerland, 2023-04-28) Khaddejah James Audu; James Nkereuwem EssienObtaining an approximation for the majority of sparse linear systems found in engineering and applied sciences requires efficient iteration approaches. Solving such linear systems using iterative techniques is possible, but the number of iterations is high. To acquire approximate solutions with rapid convergence, the need arises to redesign or make changes to the current approaches. In this study, a modified approach, termed the “third refinement” of the Gauss-Seidel algorithm, for solving linear systems is proposed. The primary objective of this research is to optimize for convergence speed by reducing the number of iterations and the spectral radius. Decomposing the coefficient matrix using a standard splitting strategy and performing an interpolation operation on the resulting simpler matrices led to the development of the proposed method. We investigated and established the convergence of the proposed accelerated technique for some classes of matrices. The efficiency of the proposed technique was examined numerically, and the findings revealed a substantial enhancement over its previous modificationsItem Application of Adomian Decomposition Method (ADM) for solving Mathematical Model of Measles(National Mathematical Center, 2021-03-22) Abdurrahman, Nurat Olamide; Somma S. A.; Ayegbusi F. D.; Gana P.; Adama P. W.; Yisa E. M.Item Application of Grey-Markov Model for Forecasting Nigeria Annual Rice Production(African Journal Online (AJOL), South Africa, 2021-11-21) Lawal Adamu; Didigwu, N. E.; Saidu, D. Y; Sadiq, S. L.; Khadeejah James AuduIn this paper, Grey system model (GM(1,1)) and Grey-Markov model that forecast Nigeria annual Rice production have been presented. The data used in the research were collected from the archive of Central Bank of Nigeria for a period of Six years (2010-2015). The fitted models showed high level of accuracy. Hence, the models can be used for food security plans of the nation.Item Application of Hidden Markov Model in Yam Yield Forecasting.(African Journal Online (AJOL), Soutrh Africa, 2022-06-06) 11. Lawal Adamu; Saidu Daudu Yakubu; Didigwu Ndidiamaka Edith; Abdullahi Abubakar; Khadeejah James Audu; Isaac Adaji.Providing the government and farmers with reliable and dependable information about crop yields before each growing season begins is the thrust of this research. A four-state stochastic model was formulated using the principle of Markov, each state of the model has three possible observations. The model is designed to make a forecast of yam yield in the next and subsequent growing seasons given the yam yield in the present growing season. The parameters of the model were estimated from the yam yield data of Niger state, Nigeria for the period of sixteen years(2001-2016). After which, the model was trained using Baum-Welch algorithm to attend maximum likelihood. A short time validity test conduct on the model showed good performance. Both the validity test and the future forecast shows prevalence of High yam yield, this attest to the reality on the ground, that Niger State is one of the largest producers of yam in Nigeria. The general performance of the model, showed that it is reliable therefore, the results from the model could serve as a guide to the yam farmers and the government to plan strategies for high yam production in the region.Item Approximate Solution of SIR Infectious Disease Model Using Homotopy Pertubation Method (HPM).(Pacific Journal of Science and Technology, 2013-11-20) Abubakar, Samuel; Akinwande, N. I.; Jimoh, O. R.; Oguntolu, F. A.; Ogwumu, O. D.In this paper we proposed a SIR model for general infectious disease dynamics. The analytical solution is obtained using the Homotopy Perturbation Method (HPM). We used the MATLAB computer software package to obtain the graphical profiles of the three compartments while varying some salient parameters. The analysis revealed that the efforts at eradication or reduction of disease prevalence must always match or even supersede the infection rate.Item Assessment of Numerical Performance of Some Runge-Kutta Methods and New Iteration Method on First Order Differential Problems(Federal University, Dutse, Nigeria, 2023-12-10) Khadeejah James Audu; Aliyu Rasheed Taiwo; Abdulganiyu Alabi SoliuThis research focuses on the assessment of the numerical performance of some Runge-Kutta methods and New Iteration Method “NIM” for solving first-order differential problems. The assessment is conducted through extensive numerical experiments and comparative analyses. Accuracy, efficiency, and stability are among the key factors considered in evaluating the performance of the methods. A range of first-order differential problems with diverse characteristics and complexity levels is employed to thoroughly examine the methods' capabilities and limitations. The numerical investigation that is defined in the study as well as the results that are stated in the Tables, demonstrates that all the approaches produce extremely accurate results. However, the “NIM” was shown to be the most effective of the three methods used in this study. Conclusively, the “NIM” should be employed to solve first-order nonlinear and linear ordinary differential equations in place of Runge-Kutta Fourth order method (RK4M) and Butcher Runge-Kutta Fifth order method (BRK5M). In addition, BRK5M is more applicable and efficient than RK4M when solving first order ordinary differential problems.Item BLOCK METHOD APPROACH FOR COMPUTATION OF ERRORS OF SOME ADAMS CLASS OF METHODS(Association of Nigerian Journal of Physics, 2022-12-12) Yahaya, Y. A.; Odeyemi, A. O.; Khadeejah James AuduTraditionally, the error and order constant of block linear multistep methods were analyzed by examining each block members separately. This paper proposes a block-by-block analysis of the schemes as they appear for implementation. Specifically, cases when k= 2, 3, 4, and 5 for Adams Moulton (implicit) are reformulated as continuous schemes in order to generate a sufficient number of schemes required for the methods to be self-starting. The derivation was accomplished through the continuous collocation technique utilizing power series as the basis function, and the property of order and error constants is examined across the entire block for each case of the considered step number. The findings of the study generated error constants in block form for Adams Bashforth and Adams Moulton procedures at steps 2, 3, 4, 5 k . Furthermore, the relevance of the study demonstrates that calculating all members' error constants at once, reduces the amount of time necessary to run the analysis. The new approach, for examining the order and error constants of a block linear multistep method, is highly recommended for application in solving real-world problems, modelled as ordinary and partial differential equationsItem Comparative Numerical Evaluation of Some Runge-Kutta Methods for Solving First Order Systems of ODEs(Toros University Publishing house, Turkey, 2025-12-12) Khadeejah James Audu; Tunde Adekunle Abubakar; Yahaya Yusuph Amuda; James Essien NkereuwemIn this study, a comparative analysis of two Runge-Kutta methods; fourth-order Runge-Kutta method and Butcher’s Fifth Order Runge-Kutta method are presented and used to solve systems of first-order linear Ordinary Differential Equations (ODEs). The main interest of this work is to test the accuracy, convergence rate and computational efficiency of these methods by using different numerical problems of ODEs. Empirical conclusions are drawn after close observation of the results presented by the two methods, which further highlights their limitations and enabling researchers to make informed decisions in choosing the appropriate technique for specific systems of ODEs problems.Item Comparison of Refinement Accelerated Relaxation Iterative Techniques and Conjugate Gradient Technique for Linear Systems(Mathematical Association of Nigeria (MAN), 2022-10-05) Khaddejah James AuduIterative methods use consecutive approximations to get more accurate results. A comparison of three iterative approaches to solving linear systems of this type 𝑀𝑦=𝐵 is provided in this paper. We surveyed the Refinement Accelerated Relaxation technique, Refinement Extended Accelerated Relaxation technique, and Conjugate Gradient technique, and demonstrated algorithms for each of these approaches in order to get to the solutions more quickly. The algorithms are then transformed into the Python language and used as iterative methods to solve these linear systems. Some numerical investigations were carried out to examine and compare their convergence speeds. Based on performance metrics such as convergence time, number of iterations required to converge, storage, and accuracy, the research demonstrates that the conjugate gradient method is superior to other approaches, and it is important to highlight that the conjugate gradient technique is not stationary. These methods can help in situations that are similar to finite differences, finite element methods for solving partial differential equations, circuit and structural analysis. Based on the results of this study, iteration techniques will be used to help analysts understand systems of linear algebraic equations.Item Computational Algorithm for Volterra Integral Solutions via Variational. Iterative Method(Paper Presentation at University of Lagos, Nigeria, 2023-08-28) Khadeejah James AuduThe Volterra Integral Equations (VIE) are a class of mathematical equations that find applications in various fields, including physics, engineering, and biology. Solving VIEs analytically is often challenging, and researchers have turned to numerical methods for obtaining approximate solutions. In this research, we propose a computational algorithm based on the Variational Iterative Method (VIM) to efficiently and accurately solve VIEs. By incorporating this method into the computational algorithm, we aim to improve the accuracy and convergence rate of the solutions. The performance of our algorithm was evaluated through extensive numerical experiments on various types of VIEs. The results demonstrate the effectiveness of the VIM approach in terms of accuracy, convergence rate, and computational efficiency. In conclusion, the proposed computational algorithm based on VIM presents a valuable contribution to the field of solving VIEs. It offers an efficient and accurate approach for obtaining approximate solutions, enabling researchers and practitioners to tackle complex problems that rely on VIEs. The algorithm's versatility and robustness make it a promising tool for a wide range of applications, including physics, engineering, and biology.Item Convergence of Triple Accelerated Over-Relaxation (TAOR) Method for M-Matrix Linear Systems(Islamic Azad University, Rasht, Iran, 2021-09-19) Khadeejah James Audu; Yusuph Amuda Yahaya; Rufus Kayode Adeboye; Usman Yusuf AbubakarIn this paper, we propose some necessary conditions for convergence of Triple Accelerated Over-Relaxation (TAOR) method with respect to 𝑀 − coefficient matrices. The theoretical approach for the proofs is analyzed through standard procedures in the literature. Some numerical experiments are performed to show the efficiency of our approach, and the results obtained compared favourably with those obtained through the existing methods in terms of spectral radius of their iteration matricesItem DERIVATION AND ANALYSIS OF BLOCK IMPLICIT HYBRID BACKWARD DIFFERENTIATION FORMULAE FOR STIFF PROBLEMS(Nigerian Journal of Mathematics and Applications, 2014) MUHAMMAD, R.; YAHAYA, Y. A.; IDRIS L.The Hybrid Backward Di erentiation Formula (HBDF) for the case k = 3 was reformulated into continuous form using the idea of multistep collocation. The continuous form was evaluated at some grid and o grid points which gave rise to discrete schemes employed as block methods for direct solution of rst order Ordinary Di erential Equation y0 = f(x; y). The requirement of a starting value and the overlap of solution model which are associated with conventional Linear Multistep Methods were eliminated by this approach. A convergence analysis of the derived hybrid schemes to establish their e ec- tiveness and reliability is presented. Numerical example carried out on sti problem further substantiates their performance.Item Formulation Of A Standard Runge- Kutta Type Method For The Solution First And Second Order Initial Value Problems(Researchjournali’s Journal of Mathematics, 2015-03) Muhammad R.; Y. A Yahaya; A.S AbdulkareemIn this paper, we present a standard Runge-Kutta Type Method (RKTM) for . The process produces Backward Differentiation Formula (BDF) scheme and its hybrid form which combined together to form a block method. The method is reformulated into a Runge-Kutta Type of the same step number for the solution of first and second order (special or general) initial value problem of Ordinary Differential Equation (ODE).