This paper is concerned with the computation of the minimal eigenpair of the generalized eigen-problem. An iterative method of first degree with the arithmetic mean preconditioner and the SSOR preconditioner has been analyzed. These preconditioners have been evaluated also for the method of Rayleigh quotient minimization.
Computation of minimal eigenpair in the large sparse generalized eigen-problem using vector computers / Galligani, Emanuele; V., Ruggiero. - STAMPA. - 4, Series: Advances in Parallel Computing, Eds. G.R. JOUBERT, U. SCHENDEL:(1992), pp. 193-201. (Intervento presentato al convegno International Conference Parallel Computing ‘91 tenutosi a Londra nel 3-6 settembre, 1991).
Computation of minimal eigenpair in the large sparse generalized eigen-problem using vector computers
GALLIGANI, Emanuele;
1992
Abstract
This paper is concerned with the computation of the minimal eigenpair of the generalized eigen-problem. An iterative method of first degree with the arithmetic mean preconditioner and the SSOR preconditioner has been analyzed. These preconditioners have been evaluated also for the method of Rayleigh quotient minimization.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