Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems

Shinya Miyajima, Takeshi Ogita, Siegfried M. Rump, Shinichi Oishi

    Research output: Contribution to journal › Article

    12 Citations (Scopus)

    Abstract

    A 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.

    Original languageEnglish
    Pages (from-to)24-45
    Number of pages22
    JournalReliable Computing
    Volume14
    Publication statusPublished - 2010 Jun

    Fingerprint

    Generalized Eigenvalue Problem
    Eigenvalues and eigenfunctions
    Positive definite
    Theorem
    Quadratic Eigenvalue Problem
    Eigenvector
    Eigenvalue
    Numerical Results

    Keywords

    • Eigenpairs
    • Generalized eigenvalue problem
    • Numerical verification

    ASJC Scopus subject areas

    • Software
    • Applied Mathematics
    • Computational Mathematics

    Cite this

    Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems. / Miyajima, Shinya; Ogita, Takeshi; Rump, Siegfried M.; Oishi, Shinichi.

    In: Reliable Computing, Vol. 14, 06.2010, p. 24-45.

    Research output: Contribution to journal › Article

    Miyajima, S, Ogita, T, Rump, SM & Oishi, S 2010, 'Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems', Reliable Computing, vol. 14, pp. 24-45.
    Miyajima S, Ogita T, Rump SM, Oishi S. Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems. Reliable Computing. 2010 Jun;14:24-45.
    Miyajima, Shinya ; Ogita, Takeshi ; Rump, Siegfried M. ; Oishi, Shinichi. / Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems. In: Reliable Computing. 2010 ; Vol. 14. pp. 24-45.
    @article{867b9477f50e4cab80b3c723dfc04d6f,
    title = "Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems",
    abstract = "A 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.",
    keywords = "Eigenpairs, Generalized eigenvalue problem, Numerical verification",
    author = "Shinya Miyajima and Takeshi Ogita and Rump, {Siegfried M.} and Shinichi Oishi",
    year = "2010",
    month = "6",
    language = "English",
    volume = "14",
    pages = "24--45",
    journal = "Reliable Computing",
    issn = "1385-3139",
    publisher = "Springer Netherlands",

    }

    TY - JOUR

    T1 - Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems

    AU - Miyajima, Shinya

    AU - Ogita, Takeshi

    AU - Rump, Siegfried M.

    AU - Oishi, Shinichi

    PY - 2010/6

    Y1 - 2010/6

    N2 - A 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.

    AB - A 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.

    KW - Eigenpairs

    KW - Generalized eigenvalue problem

    KW - Numerical verification

    UR - http://www.scopus.com/inward/record.url?scp=79954514993&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=79954514993&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:79954514993

    VL - 14

    SP - 24

    EP - 45

    JO - Reliable Computing

    JF - Reliable Computing

    SN - 1385-3139

    ER -

    Access to Document