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

DOI10.1016/S0898-1221(04)90043-0zbMath1069.65035MaRDI QIDQ1767771

Vejdi I. Hasanov

Publication date: 8 March 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

comparison of methodsnumerical exampleseigenvaluesparallel computationeigenvectorscomplex symmetric matrixJacobi's methodJ-symmetric matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (1)

Approximate antilinear eigenvalue problems and related inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• A convergent Jacobi method for solving the eigenproblem of arbitrary real matrices
• Some convergent Jacobi-like procedures for diagonalising J-symmetric matrices
• New Jacobi-sets for parallel computations
• A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix
• Jacobi’s Method is More Accurate than QR
• Fast Diagonalization of Large and Dense Complex Symmetric Matrices, with Applications to Quantum Reaction Dynamics
• J-Orthogonal Matrices: Properties and Generation
• A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
• On Jacobi and Jacobi-Like Algorithms for a Parallel Computer

This page was built for publication: An iterative method for solving the spectral problem of complex symmetric matrices