Aug 2026· Mathematics· Vol 14, pp. 2775· 0 citations· 21 references
TL;DR
Results confirm that combining global metaheuristic search with high-order local refinement yields a robust, scalable solver for complex biological and engineering nonlinear systems, though performance on problems with dense high-dimensional Jacobians may require further adaptation.
Abstract
Nonlinear systems of equations arise across engineering, physics, and biological modeling; however, classical Newton-type methods may fail when the initial approximation lies outside the convergence region of the NJN local solver. This work proposes a two-stage hybrid framework that couples Particle Swarm Optimization (PSO) for global exploration with the fifth-order Newton–Jarratt (NJN) iterative method for local refinement. The fifth-order convergence of the NJN phase, established through a complete Fréchet-derivative Taylor expansion with explicitly computed error constants, guarantees rapid local convergence once PSO delivers a sufficiently close starting point. The framework is validated on four test problems with increasing numbers of dimensions (n=2,5,20,40): a two-dimensional benchmark algebraic system, a five-dimensional metabolic network model for ethanol production in Saccharomyces cerevisiae, and two large-scale Hammerstein integral equation systems. Over 30 independent runs per method and under the tested conditions, PSO-NJN achieves 100% convergence with mean final residuals of order 10−14–10−16, while pure PSO fails completely on the high-dimensional Hammerstein cases (n=20,40) and achieves only 10% success on the metabolic model. These results confirm that combining global metaheuristic search with high-order local refinement yields a robust, scalable solver for complex biological and engineering nonlinear systems, though performance on problems with dense high-dimensional Jacobians may require further adaptation.
Nonlinear systems are very common in science and engineering, but solving them numerically with iterative methods is still difficult due to the various behaviours of solvers under different problem structures. This paper investigates how algebraic structures in the Jacobian matrix, such as symmetry, condition number, s...
Zi-Rui Peng· Theoretical and Natural Scie...· 0 citations
The results make a clear case that pre-screening variables with DOE, approximating the reduced function with RBF surrogates, and refining solutions with GA–SQP can cut both computational effort and convergence time substantially without sacrificing accuracy.
Yara H. ElKassaby, Mohamed H. Gadallah· Journal of engineering and a...· 0 citations
Solving systems of nonlinear equations is an important problem in applied mathematics, engineering, and scientific computing. Traditional numerical methods often require derivative information and suitable initial approximations, which may reduce their effectiveness when dealing with complex nonlinear systems. This pap...
R. Karyakos, S. A. Al-kababchee, Z. Algamal et al.· مجلة العلوم الأساسـية· 0 citations
Fractional iterative techniques are pivotal for modeling complex dynamic systems with enhanced accuracy. Despite their significance, scarcity of two step fractional iterative methods presents critical research gap. To fill this void, we propose a novel class of conformable two step Newton type fractional algorithm base...
Saima Akram, F. Akram, Muhammad Ibrahim· Punjab University journal of...· 0 citations
The growing complexity of industrial cyber-physical systems demands control strategies capable of handling strong nonlinearities, tight actuator constraints, and competing objectives under real-time requirements. Although Genetic Algorithms (GAs) are widely used in this class of problems, their non-differentiable opera...
Ali Deeb, V. Khokhlovskiy, Viacheslav Shkodyrev· Cybernetics and Physics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.