Monotone discrete Newton iterations and elimination (Q1903766): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0898-1221(95)00069-b / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1967647958 / rank | |||
Normal rank |
Latest revision as of 10:07, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Monotone discrete Newton iterations and elimination |
scientific article |
Statements
Monotone discrete Newton iterations and elimination (English)
0 references
5 August 1996
0 references
The paper studies the Newton method for the solution of nonlinear algebraic systems with a Jacobian which is an M-matrix. For this case, it is well known that with two properly choosen starting guesses it is possible to obtain two monotone sequences of the Newton iterations which approach the exact solution quadratically and componentwise from below and from above, respectively. These results are extended to the case of the discrete Newton method using a finite difference approximation of the Jacobian. It is also shown that the quadratic convergence can be achieved in this case if the stepsize for the approximation of the Jacobian goes to zero. All these properties are studied once again in the case when some unknowns are eliminated directly from the nonlinear system. Numerical experiments illustrate the theoretical results and show a suitable choice of the stepsize for the discrete Newton method.
0 references
monotone Newton iterations
0 references
numerical experiments
0 references
nonlinear algebraic systems
0 references
quadratic convergence
0 references
discrete Newton method
0 references
0 references