We present three polynomial preconditioning techniques and analyze some of their theoretical and computational properties. We first show some formal relations between the preconditioning polynomial and the characteristic polynomial of the coefficient matrix. Parallel algorithms are then derived and their behaviour related to that of Csanky's method. We also present experimental results obtained for special types of matrices.
Preconditioning linear systems and parallelism
Codenotti B;
1990
Abstract
We present three polynomial preconditioning techniques and analyze some of their theoretical and computational properties. We first show some formal relations between the preconditioning polynomial and the characteristic polynomial of the coefficient matrix. Parallel algorithms are then derived and their behaviour related to that of Csanky's method. We also present experimental results obtained for special types of matrices.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_489210-doc_203660.pdf
solo utenti autorizzati
Descrizione: Preconditioning linear systems and parallelism
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.36 MB
Formato
Adobe PDF
|
1.36 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.
