A parameterized multi-step Newton method for solving systems of nonlinear equations (Q261867): Difference between revisions
From MaRDI portal
Latest revision as of 16:58, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parameterized multi-step Newton method for solving systems of nonlinear equations |
scientific article |
Statements
A parameterized multi-step Newton method for solving systems of nonlinear equations (English)
0 references
24 March 2016
0 references
The authors introduce a new multi-step method solving systems nonlinear equations \(\mathbf{F}(\mathbf{x})=0\), where \(\mathbf{F}: \Gamma \subseteq \mathbb{R}^n \rightarrow \mathbb{R}^r\) is Fréchet differentiable at \(\mathbf{x}\in\mathrm{interior}(\Gamma)\) with \(\mathbf{F}(\mathbf{x^\ast})=0\) and \(\det(\mathbf{F}'(x^\ast))\neq 0\). They prove that the method needs \(m\) steps to obtain \(m+1\) convergence order. The method is a generalization of the multi-step Newton method based on a parameter \(\theta\). Applying the method for solving the nonlinear complex Zakharov system [\textit{A. H. Bhrawy}, Appl. Math. Comput. 247, 30--46 (2014; Zbl 1339.65188)], the authors show that the appropriate choice of \(\theta\) leads to faster convergence and larger radius of convergence.
0 references
multi-step iterative methods
0 references
multi-step Newton method
0 references
systems of nonlinear equations
0 references
discretization methods for partial differential equations
0 references
nonlinear complex Zakharov system
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references