Convergence of Asynchronous Jacobi-Newton-Iterations
Asynchronous iterations often converge under different conditions than their syn- chronous counterparts. In this paper we will study the global convergence of Jacobi- Newton-like methods for nonlinear equationsF x = 0. It is a known fact, that the synchronous algorithm converges monotonically, ifF i...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Universitätsbibliothek Chemnitz
1998
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199801324 http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199801324 http://www.qucosa.de/fileadmin/data/qucosa/documents/4211/data/b003.pdf http://www.qucosa.de/fileadmin/data/qucosa/documents/4211/data/b003.ps http://www.qucosa.de/fileadmin/data/qucosa/documents/4211/19980132.txt |
| Summary: | Asynchronous iterations often converge under different conditions than their syn- chronous counterparts. In this paper we will study the global convergence of Jacobi- Newton-like methods for nonlinear equationsF x = 0. It is a known fact, that the synchronous algorithm converges monotonically, ifF is a convex M-function and the starting valuesx0 andy0 meet the conditionF x04 04F y0 . In the paper it will be shown, which modifications are necessary to guarantee a similar convergence behavior for an asynchronous computation.
|
|---|