Benner, PeterBörm, SteffenMach, ThomasReimer, Knut2025-05-292014https://epflicht.bibliothek.uni-halle.de/handle/123456789/3918870649809urn:nbn:de:gbv:3:2-644532483048Abstract: The computation of eigenvalues of large-scale matrices arising from finite element discretizations has gained significant interest in the last decade. Here we present a new algorithm based on slicing the spectrum that takes advantage of the rank structure of resolvent matrices in order to compute m eigenvalues of the generalized symmetric eigenvalue problem in O(n m logα n) operations, where α>0 is a small constant.1 Online-Ressource (21 Seiten = 0,32 MB) : Diagrammeenghttp://rightsstatements.org/vocab/InC/1.0/510Book