Abstract
An effective iterative numerical method for solving the spectral problem for an arbitrary complex matrix is described and its applicability discussed. It is a modification of Voevodin's method [5] for computing of eigenvalues and eigenvectors for complex matrix. The method presented in this paper uses similar transformations with real matrices.
This work is partially supported by Contract MM 521/95
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Eberlein, P.: A Jacobi-like method for the automatic computation of eigenvalues and eigenvectors of an arbitrary matrix. SIAM J. 10 (1962) 74–88
Ivanov, I.: Algorithm for solving spectral problem of complex matrix in real arithmetic. Mathematica Balkanica 8 (1994) 51–58
Petkov, M., Ivanov, I.: Solution of symmetric and hermitian J-symmetric eigenvalue problem. Mathematica Balkanica 8 (1994) 337–349
Veselić, K.: A convergent Jacobi method for solving the eigenproblem of arbitrary real matrices. Numer. Math. 25 (1976) 179–184
Voevodin V.: Numerical methods of the algebra. Moscow (1966) (In Russian)
Wilkinson, J., Reinsch C.: Handbook for automatic computation. Linear algebra. Moscow (1976) (In Russian)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ivanov, I.G. (1997). A method for solving the spectral problem for complex matrices. In: Vulkov, L., Waśniewski, J., Yalamov, P. (eds) Numerical Analysis and Its Applications. WNAA 1996. Lecture Notes in Computer Science, vol 1196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62598-4_94
Download citation
DOI: https://doi.org/10.1007/3-540-62598-4_94
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62598-8
Online ISBN: 978-3-540-68326-1
eBook Packages: Springer Book Archive