Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues

DOI10.1007/s13160-019-00348-4zbMath1418.65049OpenAlexW2916589740WikidataQ128335448 ScholiaQ128335448MaRDI QIDQ2318500

Kensuke Aishima, Takeshi Ogita

Publication date: 15 August 2019

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-019-00348-4

zbMATH Keywords

iterative refinementclustered eigenvaluessymmetric eigenvalue decompositionaccurate numerical algorithm

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (8)

Mixed precision algorithms in numerical linear algebra ⋮ Iterative refinement of Schur decompositions ⋮ Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem ⋮ A mixed precision LOBPCG algorithm ⋮ Fixed-point analysis of Ogita-Aishima's symmetric eigendecomposition refinement algorithm for multiple eigenvalues ⋮ Unnamed Item ⋮ An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations ⋮ Iterative refinement for singular value decomposition based on matrix multiplication

Uses Software

• gmp
• LAPACK
• mctoolbox
• LBNL
• advanpix
• XBLAS
• ELSES
• k-ep

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
• Numerical enclosure for each eigenvalue in generalized eigenvalue problem
• Fast and parallel interval arithmetic
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
• Iterative refinement for symmetric eigenvalue decomposition
• Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations
• Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
• Theoretical Numerical Analysis
• Error bounds for approximate solutions of systems of equations
• LAPACK Users' Guide
• Accuracy and Stability of Numerical Algorithms
• Design, implementation and testing of extended and mixed precision BLAS
• The Rotation of Eigenvectors by a Perturbation. III
• Accurate Sum and Dot Product
• Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation

This page was built for publication: Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues