Show simple item record

dc.contributor.authorRibbens, Calvin J.en_US
dc.contributor.authorBeattie, Christopher A.en_US
dc.date.accessioned2013-06-19T14:36:22Z
dc.date.available2013-06-19T14:36:22Z
dc.date.issued1992
dc.identifierhttp://eprints.cs.vt.edu/archive/00000327/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19791
dc.description.abstractThis paper describes and compares two methods for solving a generalized eigenvalue problem , where T and S are both real symmetric and tridiagonal, and S is positive definite, and the target architecture is a shared memory multiprocessor. One method can be viewed as a generalization of the treeql algorithm of Dongarra and Sorensen [1987]. The second algorithm is a straightforward parallel extension of the bisection/inverse iteration algorithm treeps of Lo, Philippe, and Sameh [1987]. The two methods are representative of families of algorithms of quite different character. We illustrate and compare sequential and parallel performance of the two approaches with numerical examples.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleParallel Solution of Generalized Symmetric Tridiagonal Eigenvalue Problems on Shared Memory Multiprocessorsen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-92-47en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000327/01/TR-92-47.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record