Computing reducing subspaces of a large linear matrix pencil - ENSTA Paris - École nationale supérieure de techniques avancées Paris
Article Dans Une Revue Russian Journal of Numerical Analysis and Mathematical Modelling Année : 2006

Computing reducing subspaces of a large linear matrix pencil

Résumé

This paper deals with the computation of the reducing subspace associated with the rightmost part of the spectrum of a large matrix pencil A-λ B with B = diag(I,0). Two variants of the Jacobi-Davidson method are discussed and developed. One is based on the Euclidean inner product and the second on the semi-inner product induced by B. Both versions use real arithmetics and incorporate an efficient deflation procedure. Numerical results are reported.

Dates et versions

hal-00978782 , version 1 (14-04-2014)

Identifiants

Citer

Grace Hechme, Yuri. Nechepurenko. Computing reducing subspaces of a large linear matrix pencil. Russian Journal of Numerical Analysis and Mathematical Modelling, 2006, 21 (3), pp.185-198. ⟨10.1515/156939806777320359⟩. ⟨hal-00978782⟩
70 Consultations
0 Téléchargements

Altmetric

Partager

More