Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem (Q2784358)

From MaRDI portal





scientific article; zbMATH DE number 1732252
Language Label Description Also known as
English
Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem
scientific article; zbMATH DE number 1732252

    Statements

    0 references
    0 references
    0 references
    23 April 2002
    0 references
    symmetric definite generalized eigenvalue problem
    0 references
    Cholesky method
    0 references
    Cholesky factorization
    0 references
    complete pivoting
    0 references
    Jacobi method
    0 references
    backward error analysis
    0 references
    rounding error analysis
    0 references
    iterative refinement
    0 references
    Newton's method
    0 references
    LAPACK
    0 references
    MATLAB
    0 references
    numerical experiments
    0 references
    numerical stability
    0 references
    0 references
    0 references
    0 references
    0 references
    Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem (English)
    0 references
    The authors consider the Cholesky-Jacobi method for solving the symmetric definite generalized eigenvalue problem \(Ax=\lambda Bx\): the Cholesky factorization \(\Pi^T B\Pi= LD^2 L^T\) is computed to solve the equivalent standard symmetric eigenvalue problem by applying the Jacobi method. A detailed rounding error analysis is given. A fixed precision iterative refinement is investigated as a means for improving the backward errors of the approximate eigenpairs. Theoretical results and numerical experiments show that the Cholesky-Jacobi method has better numerical stability properties than the previous backward error bound suggests.
    0 references
    0 references

    Identifiers