2011 Fourth International Conference on Modeling, Simulation and Applied Optimization 2011
DOI: 10.1109/icmsao.2011.5775576
|View full text |Cite
|
Sign up to set email alerts
|

Two-step diagonal Newton method for large-scale systems of nonlinear equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(17 citation statements)
references
References 10 publications
0
13
0
Order By: Relevance
“…Waziri et al [7] have set the step length ( = 1, for all ); this approach is mostly used in many Newton-like methods.…”
Section: The Improved Secant Diagonal Updatingmentioning
confidence: 99%
See 1 more Smart Citation
“…Waziri et al [7] have set the step length ( = 1, for all ); this approach is mostly used in many Newton-like methods.…”
Section: The Improved Secant Diagonal Updatingmentioning
confidence: 99%
“…Here, we continue in the spirit of diagonal updating, using a new line search strategy to obtain a good step length ( ) in every iteration, anticipating to produce a more accurate approximation of the Jacobian inverse matrix and then employing restating strategy whenever the updating matrix is undefined. To this end, +1 would be obtained almost similar to the diagonal updating scheme presented in [7] in which = − ( ) instead of = − ( ). Now, let the deviation between +1 and denoted as Φ = +1 − be minimized under some norms; the optimal solution is given as…”
Section: The Improved Secant Diagonal Updatingmentioning
confidence: 99%
“…One of the famous method for solving is the Newton method, which generates a sequence { x k } using the formula xk+1=xkJ(xk)1F(xk),k=0,1,2,. The Newton method has a very good convergence property but have some shortcomings such as Jacobian computation per iteration, which is costly. Other methods for solving are quasi Newton methods, spectral gradient methods, conjugate gradient methods, etc . For simplicity, we denote F k = F ( x k ) and J k = J ( x k ).…”
Section: Introductionmentioning
confidence: 99%
“…Other methods for solving (1) are quasi Newton methods, spectral gradient methods, conjugate gradient methods, etc. [2][3][4][5][6][7][8][9] For simplicity, we denote F k = F(x k ) and J k = J(x k ). Methods for solving symmetric nonlinear problem (1) has been proposed by many authors.…”
mentioning
confidence: 99%
“…It is vital to mention that, [5] have reported that, the undesirable performance behaviors of Newton's chord methodespecially when solving high dimensional systems of nonlinear equations is associated with the insufficient Jacobian information in each iteration. The validation associated to our procedure is to enhance the convergence properties as well as improving numerical stability.…”
Section: Derivation Processmentioning
confidence: 99%