A simulated annealing based algorithm for eigenvalue problems

DOI10.1016/0010-4655(91)90116-3zbMATH Open0875.65058OpenAlexW2000727752MaRDI QIDQ1366254FDOQ1366254

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)

Cites Work

• Optimization by Simulated Annealing
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366254)