We present a new, fast, and practical parallel algorithm for computing a few eigenvalues of a symmetric tridiagonal matrix by the explicit QR method. We present a new divide and conquer parallel algorithm which is fast and numerically stable. The algorithm is work efficient and of low communication overhead, and it can be used to solve very large problems infeasible by sequential methods.
A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
Codenotti B
1993
Abstract
We present a new, fast, and practical parallel algorithm for computing a few eigenvalues of a symmetric tridiagonal matrix by the explicit QR method. We present a new divide and conquer parallel algorithm which is fast and numerically stable. The algorithm is work efficient and of low communication overhead, and it can be used to solve very large problems infeasible by sequential methods.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_412802-doc_145314.pdf
solo utenti autorizzati
Descrizione: A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.58 MB
Formato
Adobe PDF
|
1.58 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
