The computation of isotropic vectors
Author(s) -
Gérard Meurant
Publication year - 2012
Publication title -
numerical algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.981
H-Index - 64
eISSN - 1572-9265
pISSN - 1017-1398
DOI - 10.1007/s11075-012-9537-2
Subject(s) - eigenvalues and eigenvectors , hermitian matrix , theory of computation , isotropy , mathematics , computation , matrix (chemical analysis) , combinatorics , algorithm , pure mathematics , physics , quantum mechanics , materials science , composite material
We describe algorithms to compute isotropic vectors for matrices with real or complex entries. These are unit vectors b satisfying b * Ab驴=驴0. For real matrices the algorithm uses only the eigenvectors of the symmetric part corresponding to the extreme eigenvalues. For complex matrices, we first use the eigenvalues and eigenvectors of the Hermitian matrix K驴=驴(A驴驴驴A *)/2i. This works in many cases. In case of failure we use the Hermitian part H or a combination of eigenvectors of H and K. We give some numerical experiments comparing our algorithms with those proposed by R. Carden and C. Chorianopoulos, P. Psarrakos and F. Uhlig.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom