Voß, HeinrichHeinrichVoßElssel, KoljaKoljaElssel2005-12-162005-12-162004-09Preprint. Published in: SIAM. J. Matrix Anal. & Appl., 28.2006,2, 386–397http://tubdok.tub.tuhh.de/handle/11420/65The Automated Multi-Level Substructuring (AMLS) method has been developed to reduce the computational demands of frequency response analysis and has recently been proposed as an alternative to iterative projection methods like Lanczos or Jacobi–Davidson for computing a large number of eigenvalues for matrices of very large dimension. Based on Schur complements and modal approximations of submatrices on several levels AMLS constructs a projected eigenproblem which yields good approximations of eigenvalues at the lower end of the spectrum. Rewriting the original problem as a rational eigenproblem of the same dimension as the projected problem, and taking advantage of a minmax characterization for the rational eigenproblem we derive an a priori bound for the AMLS approximation of eigenvalues.enhttp://rightsstatements.org/vocab/InC/1.0/EigenvaluesAMLSsubstructuringnonlinear eigenproblemminmax characterizationMathematikPreprint2005-12-16urn:nbn:de:gbv:830-opus-118610.15480/882.63Nichtlineares EigenwertproblemEigenvalues, eigenvectorsSparse matrices11420/6510.1137/04061609710.15480/882.63930768121Preprint