AJAdebayo James

Adebayo James

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Adebayo James has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the Application of an Intertwined Difference Equations and Newton-Lieberstein Algorithmic to Solve Mildly Non-linear Boundary Value Problems (MNBVP)

    by Dele-Rotimi Olumide, Akinmuyise Mathew, Adebayo James

    Over the years, numerous researchers have developed numerical or classical methods or the other to obtain solutions for Boundary Value Problems; many of these methods have not been adopted to solve Mildly Non-Linear Boundary Value Problems (MNBVP) basically because of their peculiarities. The MNBVP are problems that are neither entirely linear nor exclusively nonlinear rather for multi-variable functions, not all the constants and the function derivative is greater or equal to zero. This paper discusses the process of intertwining the Approximation Difference Equation with the Newton-Lieberstein method in solving mildly non-linear boundary value problems. The technique requires dual independent processes that involve different Methods. The first technique is aimed at reducing the BVP to a tridiagonal system, while the other is employed to solve the system of equations by applying the Newton-Lieberstein algorithm. The resulting equations that is formed from the nonlinear boundary problems will be nonlinear systems but it will be structurally related to tridiagonal systems. In practical settings, mathematical modelling problems can be expressed in the form of BVPs that arise frequently and majorly in the fields of science and engineering, such as electric circuits, fluid dynamics, the motion of rockets or satellites, and other areas of engineering applications. The intertwined methods will be used to evaluate the approximate solutions without much ado on the number of equations the problem has. The technique was employed to solve some problems with numerical results obtained showed the flexibility, the robustness, and how efficient the coined technique is. The results compare favourably with exact or analytical results.

  • Open Access

    Numerical Solution of the Mildly Non-linear Boundary Value Problems (MNBVP) Using Newton-Lieberstein Algorithm

    by Adebayo James, Akinmuyise Folorunsho, Dele-Rotimi Olumide

    Several numerical and classical approaches have been employed to determine the Boundary Value Problems solutions, but not many of these methods have been adopted to work out Mildly Non-Linear Boundary Value Problems (MNBVP); hence, there is a necessity to think of ways of achieving this feat. The MNBVP are problems that are neither linear nor explicitly nonlinear. This paper discusses the process of intertwining the Newton-Lieberstein method into the upwind differencing technique in solving mildly non-linear boundary value problems. The method requires two independent stages that involve different techniques. First, transform the BVP to a tri-diagonal system. Secondly, solve the system of equations by applying the Newton-Lieberstein Algorithm. The resulting equations from the nonlinear boundary problems considered in this paper will generate a nonlinear but will relate structurally to tridiagonal equations. Here, the authors developed a method described as a hybridized iterative algorithm, for which the number of steps cannot be determined a priori. It is a variant of the Newton’s technique. Unlike other classical methods, it applies to nonlinear systems and to systems with more than a thousand equations, after which round off error tends to accumulate. In real life, mathematical problems can now be expressed in the BVPs that sprang largely in the fields of physics, science, and engineering, such as fluid dynamics, electric circuits, the motion of rockets or satellites, and other areas of application. The algorithm proposed will estimate the approximate solutions irrespective of the number of equations involved. Numerical results showed the robustness, efficiency, and flexibility of the intertwined technique.

  • Open Access

    Breaking the Curse of Dimensionality Using a Recursive Dynamic Programming Framework

    by Adebayo James, Alabi John, Omowaye Solomon

    The resolution of optimal control problems (OCPs) in real-world applications is frequently beset by the curse of dimensionality and the inherent nonlinearity of system dynamics. This paper presents a literature framework that combines recursive relationship formulations with the principles of dynamic programming (DP) to address these challenges. The research stresses on a perspective that geared towards bridging the gap between the theoretical approach of DP and the numerical computation that demands practical applications. Dynamic programming is a method that finds solutions to larger sub-problems after the problem has been reduced to smaller ones. The main idea is to embed recursive relationships directly within the DP framework. The hypothesis is that for a significant class of OCPs, particularly those characterized by certain structural properties or separable cost functions, the optimal decision at a given state can be expressed recursively as a function of decisions made in states or stages. The Recursive Dynamic Programming (RDP), embeds a state-dependent recursive structure directly within the DP iteration, enabling a more efficient traversal of the state space and the generation of near-optimal control policies. We demonstrate the efficacy of this approach and its application to the resource-constrained problem. The approach follows derivation of an analytical and a semi-analytical recursive expression for major decision variables or for the gradient function value, which are then applied iteratively within the DP. The RDP framework is shown to significantly reduce computational overhead compared to classical DP while maintaining a high degree of solution accuracy, offering a pragmatic and scalable pathway for tackling complex OCPs prevalent in engineering and economic systems.

  • Open Access

    On the Development and Application of a Modified Ant Colony Optimization (MACO) Algorithm for Solving Optimization Problems

    by Kayode James Adebayo, Kehinde Solomon Omowaye, Olu Sunday Adetolaju

    This study presents the development and application of a Modified Ant Colony Optimization (MACO) algorithm incorporating constant variables to enhance solution efficiency in optimization problems. In the traditional Ant Colony Optimization (ACO) algorithms, though effective in solving combinatorial problems, they often suffer from slow convergence and premature stagnation due to excessive dependence on pheromone and parameter stochastic update settings. The MACO algorithm introduces constant variables control that regulates pheromone evaporation rate, heuristic influence, and exploration–exploitation balance, thereby improving algorithm stability and convergence speed. Additionally, the modification integrates features from complementary metaheuristics to strengthen global search capability while maintaining local refinement efficiency. The model is formulated and tested on benchmark optimization problems, demonstrating improved performance in term of the solution quality, computational rigor, time, and robustness compared to traditional ACO approaches. Results indicate that the incorporation of constant variables reduces parameter uncertainty and enhances repeatability of outcomes. The study contributes to the development of swarm intelligence techniques by providing a more controlled, flexible, and reliable optimization structure suitable for applications in engineering, routing, and logistics design problems.

  • Open Access

    Gompertz Function Approach: Numerical Integration for Microbial Growth Problem

    by Ayinde Olukayode, Omowaye John, Fadugba Emmanuel, Adebayo James, Ogunmiloro Micheal, Olarinde Oluwaseun

    In this work, we developed a numerical integrator using the Gompertz function model approach with the basic parameters as highlighted by Gompertz in finding and measure the growth in human cells as a basis function involving exponential, logarithmic, and polynomial, hence implemented the numerical integrator to solve problems arising in microbial growth staging. Microbial growth, synonymous to mildew or mold, which is a fungi family commonly found both indoors and outdoors. The indoors occur especially when there is humidity, moisture, oxygen, organic matters and low sunlight. Microbial growth which is the increase in the number of microbial cells which can also be in term of bacterial growth. It can be influenced by various factors to grow including temperature, Water, availability of oxygen, and other nutrient content. The growth staging can be in four phases such as lag, logarithmic, stationary and death phases. A culture of bacterial was taken, the approximate number of strand that was originally present and the growth were calculated using the numerical integration, the results obtained shows a significant, effective and robust improvement on the strand when compared the results with the exact solution. The properties of the integrator were analyzed, considering that Microbial Growth is an increase in the number of bacteria cells in a system when the proper nutrients and environment are provided. Therefore with the approach of Gompertz, the numerical integrator can be applied further to find the growth in each of the phases as they occurs.