Please use this identifier to cite or link to this item:
|Title: ||A Scalar Homotopy Method for Solving an Over/Under-Determined System of Non-Linear Algebraic Equations|
|Authors: ||Chein-Shan Liu|
Satya N. Atluri
|Keywords: ||Nonlinear algebraic equations|
Ordinary differential equations
Scalar homotopy method (SHM)
|Issue Date: ||2018-10-12T03:24:20Z
|Publisher: ||CMES: Computer Modeling in Engineering & Science|
|Abstract: ||Abstract: Iterative algorithms for solving a system of nonlinear algebraic equations
(NAEs): Fi(xj) = 0, i, j= 1,. . . ,n date back to the seminal work of Issac Newton.
Nowadays a Newton-like algorithm is still the most popular one to solve the
NAEs, due to the ease of its numerical implementation. However, this type of algorithm
is sensitive to the initial guess of solution, and is expensive in terms of the
computations of the Jacobian matrix ∂Fi/∂ xj and its inverse at each iterative step.
In addition, the Newton-like methods restrict one to construct an iteration procedure
for n-variables by using n-equations, which is not a necessary condition for the
existence of a solution for underdetermined or overdetermined system of equations.
In this paper, a natural system of first-order nonlinear Ordinary Differential Equations
(ODEs) is derived from the given system of Nonlinear Algebraic Equations
(NAEs), by introducing a scalar homotopy function gauging the total residual error
of the system of equations. The iterative equations are obtained by numerically integrating
the resultant ODEs, which does not need the inverse of ∂Fi/∂ xj
. The new
method keeps the merit of homotopy method, such as the global convergence, but
it does not involve the complicated computation of the inverse of the Jacobian matrix.
Numerical examples given confirm that this Scalar Homotopy Method (SHM)
is highly efficient to find the true solutions with residual errors being much smaller.
|Relation: ||53(1) pp.47-71|
|Appears in Collections:||[河海工程學系] 期刊論文|
Files in This Item:
All items in NTOUR are protected by copyright, with all rights reserved.