An iterative method for solving the spectral problem of complex symmetric matrices

  • Hasanov V
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

An effective method for computing eigenvalues and eigenvectors of complex symmetric matrices in real arithmetic is proposed. The problem for computing eigenvalues and eigenvectors of complex symmetric matrices arises in chemical reactive problems. The problem of a complex matrix is equivalent to the spectral problem of a special 2 × 2 block real matrix. Our method uses similarity transformations and preserves the special block structure. The convergence theorem is proved. Numerical experiments are given. © 2004 Elsevier Ltd.

Cite

CITATION STYLE

APA

Hasanov, V. I. (2004). An iterative method for solving the spectral problem of complex symmetric matrices. Computers & Mathematics with Applications, 47(4–5), 529–540. https://doi.org/10.1016/s0898-1221(04)90043-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free