Parallel Adaptive GMRES Implementations for Homotopy Methods

Simple item page
dc.contributor.authorSosonkina, Mashaen
dc.contributor.authorAllison, Donald C. S.en
dc.contributor.authorWatson, Layne T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:55Zen
dc.date.available2013-06-19T14:36:55Zen
dc.date.issued1997-11-01en
dc.description.abstractThe success of homotopy methods in solving large-scale optimization problems and nonlinear systems of equations depends heavily on the solution of large sparse nonsymmetric linear systems on parallel architectures. Iterative solution techniques, such as GMRES(k), favor parallel implementations. However, their straightforward parallelization usually leads to a poor parallel performance because of global communication incurred by processors. One variation of GMRES(k) considered here is to adapt the restart value k for any given problem and use Householder reflections in the orthogonalization phase to achieve high accuracy and reduce the communication overhead.en
dc.format.mimetypeapplication/postscripten
dc.identifierhttp://eprints.cs.vt.edu/archive/00000475/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000475/01/TR-97-18.psen
dc.identifier.trnumberTR-97-18en
dc.identifier.urihttp://hdl.handle.net/10919/19978en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleParallel Adaptive GMRES Implementations for Homotopy Methodsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Name:
TR-97-18.ps
Size:
264.46 KB
Format:
Postscript Files
Download

Collections

Computer Science Technical Reports