A Parallel Inexact Newton Method Using a Krylov Multisplitting Algorithm
| dc.contributor.author | Huang, Chiou-Ming | en_US |
| dc.contributor.author | O'Leary, Dianne P. | en_US |
| dc.date.accessioned | 2004-05-31T22:23:39Z | |
| dc.date.available | 2004-05-31T22:23:39Z | |
| dc.date.created | 1993-07 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | Abstract. We present a paraUel variant of the inexact Newton algorithm that uses the Krylov multisplitting algorithm (KMS) to compute the approxrmate Newton direction. The algorithm can be used for solving unconstrained optimization problems or systems of nonlinear equations. The KMS algorithm is a more efficient paraUel implementation of Krylov subspace methods (GMRES, Arnoldi, etc.) with multisplitting preconditioners. The work of the KMS algorithm is divided into the multisplitting tasks and a direction forrning task. There is a great deal of paraUelism within each task and the number of synchronization points between the tasks is greatly reduced. We study the local and global convergence properties of the algorithm and present results of numerical examples on a sequential computer. (Also cross-referenced as UMIACS-TR-93-71) | en_US |
| dc.format.extent | 208865 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/591 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3112 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-93-71 | en_US |
| dc.title | A Parallel Inexact Newton Method Using a Krylov Multisplitting Algorithm | en_US |
| dc.type | Technical Report | en_US |