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 algoeirhms 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 / B., Codenotti; Leoncini, Mauro. - In: COMPUTERS AND ARTIFICIAL INTELLIGENCE. - ISSN 0232-0274. - STAMPA. - 9:(1990), pp. 471-491.
Preconditioning Linear Systems and Parallelism
LEONCINI, Mauro
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 algoeirhms are then derived and their behaviour related to that of Csanky's method. We also present experimental results obtained for special types of matrices.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
