Abstract
In this paper we describe a parallel implementation of the trace minimization method for symmetric generalized eigenvalue problems proposed by Sameh and Wisniewski. The implementation includes several techniques proposed in a later article of Sameh, such as multishifting, preconditioning and adaptive inner solver termination, which accelerate the method and make it much more robust. A Davidson-type variant of the algorithm has been also considered. The different methods are analyzed in terms of sequential and parallel efficiency. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Romero, E., & Roman, J. E. (2008). A parallel implementation of the trace minimization eigensolver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5336 LNCS, pp. 255–268). https://doi.org/10.1007/978-3-540-92859-1_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
