A method of solving systems of nonlinear equations of large dimension with banded Jacobian matrix

1993 ◽  
Vol 67 (5) ◽  
pp. 3277-3280
Author(s):  
Ya. M. Glins'kii ◽  
T. Ya. Khoma
Keyword(s):  
Nonlinear Equations ◽  
Jacobian Matrix ◽  
Large Dimension ◽  
Systems Of Nonlinear Equations

scholarly journals Improved quasi-newton method via SR1 update for solving symmetric systems of nonlinear equations

2019 ◽  
Vol 15 (1) ◽  
pp. 117-120 ◽  
Author(s):  
Muhammad Kabir Dauda ◽  
Mustafa Mamat ◽  
Mohamad Afendee Mohamed ◽  
Mahammad Yusuf Waziri
Keyword(s):  
Nonlinear Equations ◽  
Newton Method ◽  
Large Scale ◽  
Jacobian Matrix ◽  
Systems Of Nonlinear Equations ◽  
Test Problems ◽  
Inexact Line Search ◽  
Cpu Time ◽  
Number Of Iterations ◽  
Symmetric Systems

The systems of nonlinear equations emerges from many areas of computing, scientific and engineering research applications. A variety of an iterative methods for solving such systems have been developed, this include the famous Newton method. Unfortunately, the Newton method suffers setback, which includes storing  matrix at each iteration and computing Jacobian matrix, which may be difficult or even impossible to compute. To overcome the drawbacks that bedeviling Newton method, a modification to SR1 update was proposed in this study. With the aid of inexact line search procedure by Li and Fukushima, the modification was achieved by simply approximating the inverse Hessian matrix  with an identity matrix without computing the Jacobian. Unlike the classical SR1 method, the modification neither require storing  matrix at each iteration nor needed to compute the Jacobian matrix. In finding the solution to non-linear problems of the form  40 benchmark test problems were solved. A comparison was made with other two methods based on CPU time and number of iterations. In this study, the proposed method solved 37 problems effectively in terms of number of iterations. In terms of CPU time, the proposed method also outperformed the existing methods. The contribution from the methodology yielded a method that is suitable for solving symmetric systems of nonlinear equations. The derivative-free feature of the proposed method gave its advantage to solve relatively large-scale problems (10,000 variables) compared to the existing methods. From the preliminary numerical results, the proposed method turned out to be significantly faster, effective and suitable for solving large scale symmetric nonlinear equations.

scholarly journals A Hybrid Approach for Solving Systems of Nonlinear Equations Using Harris Hawks Optimization and Newton’s Method

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Rami Sihwail ◽  
Obadah Said Solaiman ◽  
Khairuddin Omar ◽  
Khairul Akram Zainol Ariffin ◽  
Mohammed Alswaitti ◽  
...  
Keyword(s):  
Nonlinear Equations ◽  
Newton’S Method ◽  
Newton's Method ◽  
Hybrid Approach ◽  
Systems Of Nonlinear Equations

Research on the Forward Kinematics of Stewart Platform Using Memetic Algorithms

2012 ◽  
Vol 268-270 ◽  
pp. 1416-1421
Author(s):  
Yu Hui Zhang ◽  
Li Wen Guan ◽  
Li Ping Wang ◽  
Yong Zhi Hua
Keyword(s):  
Nonlinear Equations ◽  
Rapid Development ◽  
Memetic Algorithms ◽  
Stewart Platform ◽  
Global Optimum ◽  
General Purpose ◽  
Forward Kinematics ◽  
Systems Of Nonlinear Equations ◽  
Artificial Intelligence Technology ◽  
Difficult Issue

The forward kinematics analysis of parallel manipulator is a difficult issue, which has been studied by many researchers recently. In this paper, in order to solve the difficult issue, a new computing method with higher calculation accuracy, good operation steadiness and faster speed is mentioned. Firstly, the mathematical model of direct kinematics of the Stewart platform is founded, which is nonlinear equations. Secondly, with the rapid development of artificial intelligence technology, Memetic algorithms (MA) are applied to solve the systems of nonlinear equations more and more, replacing the traditional algorithms. MA is a kind of meta-heuristic algorithm combined genetic algorithms (GA) with local search at the end of iteration. Finally, the validity of this algorithm has been testified by simulating iteration operation. The numerical simulation shows that MA can surely and rapidly get global optimum solution and greatly improve convergence rate. Thereby, MA can be widely used as a general-purpose algorithm for solving the forward kinematics of parallel mechanism.

Sign in / Sign up

Export Citation Format

Share Document