Article View: capdist.seminars
Article #72SUNYA C. S. Dept. Colloquium
From: Pat Keller
Date: Fri, 21 Nov 1997 00:00
Date: Fri, 21 Nov 1997 00:00
30 lines
1873 bytes
1873 bytes
PH.D. STUDENT TALKS
University at Albany - State University of New York
Computer Science Department
Shi-Yu Evan Chen
Monday, November 24, 1997, at ****10:00a.m. in LI-98
Parallelizing the QR Algorithm for the Unsymmetric
Algebraic Eigenvalue Problem: Myths and Reality
By Greg Henry and Robert Van De Geijn
Abstract
Over the last few years, it has been suggested that the
popular QR algorithm for the unsymmetric eigenvalue problem
does not parallelize. In this paper, we present both posi-
tive and negative results on the this subject: In theory,
asymptotically perfect speedup can be obtained. In practice,
reasonable speedup can be obtained on a MIMD distributed
memory computer, for a relatively small number of proces-
sors. However, we also show theoretically that it is impos-
sible for the standard QR algorithm to be scalable. Perfor-
mance of a parallel implementation of the LAPACK DLAHQR rou-
tine on the Intel Paragon system is reported.
Technical Details
Message-ID:
<199711212044.PAA14595@adak.cs.albany.edu>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailShow Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 1463ce,66f6670d4f6726b9,start X-Google-Attributes: gid1463ce,public X-Google-Thread: f61a9,66f6670d4f6726b9,start X-Google-Attributes: gidf61a9,public From: Pat Keller <pat@cs.albany.edu> Subject: SUNYA C. S. Dept. Colloquium Date: 1997/11/21 Message-ID: <199711212044.PAA14595@adak.cs.albany.edu> X-Deja-AN: 291294098 Organization: The University at Albany Newsgroups: capdist.seminars,sunya.cs.general Originator: daemon@cs.albany.edu