Comparison of Brown's and Newton's method in the monotone case (Q1093328)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4022489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison of Brown's and Newton's method in the monotone case |
scientific article; zbMATH DE number 4022489 |
Statements
Comparison of Brown's and Newton's method in the monotone case (English)
0 references
1988
0 references
In many cases when Newton's method, applied to a nonlinear system \(F(x)=0\), produces a monotonically decreasing sequence of iterates, Brown's method converges monotonically, too. We compare the iterates of Brown's and Newton's method in these monotone cases with respect to the natural partial ordering. It turns out that in most of the cases arising in applications Brown's method then produces ``better'' iterates than Newton's method.
0 references
comparison
0 references
Newton's method
0 references
Brown's method
0 references
monotonicity
0 references
0 references
0.8927492499351501
0 references
0.882524847984314
0 references
0.8492584824562073
0 references
