On computing the eigenvectors of structured matrices
Küçük Resim Yok
Tarih
2009
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
A numerical method for computing the eigenvectors of symmetric tridiagonal matrices is studied in this paper. This method can easily be adapted for other classes of matrices, e.g. semiseparable matrices, as long as a step of the QR method requires O(n) floating point operations. A real symmetric matrix of order n has a full set of orthogonal eigenvectors. The most used approach to compute the spectrum of such matrices reduces first the dense symmetric matrix into a symmetric structured one, i.e., tridiagonal matrices or semiseparable matrices. This step is accomplished in O(n 3 ) operations. Once the latter symmetric structured matrix is available, its spectrum is computed in an iterative fashion by means of the QR method in O(n 2 ) operations. In principle, the whole set of eigenvectors of the latter structured matrix can be computed by means of inverse iteration in O(n 2 ) operations.
Açıklama
Anahtar Kelimeler
Kaynak
International Conference of Mathematical Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Kodal Sevindir, H. (2009). On computing the eigenvectors of structured matrices. Maltepe Üniversitesi. s. 201.
