A parallel solver for extreme eigenpairs

Leonardo Borges; Suely Oliveira

doi:10.1007/BFb0057928

Back

A parallel solver for extreme eigenpairs

Book chapter

Open access

Peer reviewed

A parallel solver for extreme eigenpairs

Leonardo Borges and Suely Oliveira

Euro-Par’98 Parallel Processing, pp.763-770

Lecture Notes in Computer Science, Springer Berlin Heidelberg

06/30/2006

DOI: 10.1007/BFb0057928

Files and links (1)

url

https://doi.org/10.1007/BFb0057928View

Published (Version of record) Open Access

Abstract

In this paper a parallel algorithm for finding a group of extreme eigenvalues is presented. The algorithm is based on the well known Davidson method for finding one eigenvalue of a matrix. Here we incorporate knowledge about the structure of the subspace through the use of an arrowhead solver which allows more parallelization in both the original Davidson and our new version. In our numerical results various preconditioners (diagonal, multigrid and ADI) are compared. The performance results presented are for the Paragon but our implementation is portable to machines which provide MPI and BLAS.

Convergence Factor

Lanczos Algorithm

Message Passing Interface

Parallel Solver

Ritz Vector

Details

Title: Subtitle: A parallel solver for extreme eigenpairs
Creators: Leonardo Borges - Texas A&M University
Suely Oliveira - Texas A&M University
Resource Type: Book chapter
Publication Details: Euro-Par’98 Parallel Processing, pp.763-770
Series: Lecture Notes in Computer Science
DOI: 10.1007/BFb0057928
eISSN: 1611-3349
ISSN: 0302-9743
Publisher: Springer Berlin Heidelberg; Berlin, Heidelberg
Language: English
Date published: 06/30/2006
Academic Unit: Computer Science; Mathematics
Record Identifier: 9984259660302771

Metrics

38 Record Views