Miyajima, ShinyaShinyaMiyajimaOgita, TakeshiTakeshiOgitaRump, Siegfried M.Siegfried M.RumpOishi, Shin’ichiShin’ichiOishi2021-01-212021-01-212010-06-01Reliable Computing (14): 24-45 (2010-06-01)http://hdl.handle.net/11420/8533A fast method for enclosing all eigenpairs in symmetric positive definite generalized eigenvalue problems is proposed. Firstly theorems on verifying all eigenvalues are presented. Next a theorem on verifying all eigenvectors is presented. The proposed method is developed based on these theorems. Numerical results are presented showing the efficiency of the proposed method. As an application of the proposed method, an efficient method of enclosing all eigenpairs in the quadratic eigenvalue problem is also sketched.en1573-1340Reliable Computing20102445[University of Louisiana at Lafayette]EigenpairsGeneralized eigenvalue problemNumerical verificationInformatikFast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problemsJournal ArticleOther