A simulated annealing based algorithm for eigenvalue problems

DOI10.1016/0010-4655(91)90116-3zbMath0875.65058OpenAlexW2000727752MaRDI QIDQ1366254

Mihir Arjunwadkar, D. G. Kanhere

Publication date: 11 November 1997

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4655(91)90116-3

zbMATH Keywords

iterative algorithmlarge sparse real Hermitian matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (1)

A novel algorithm for calculation of the extreme eigenvalues of large Hermitian matrices

Cites Work

• Optimization by Simulated Annealing
• Unnamed Item
• Unnamed Item

This page was built for publication: A simulated annealing based algorithm for eigenvalue problems