Iterative refinement for symmetric eigenvalue decomposition
type: Item
instance of: scholarly article
title: Iterative refinement for symmetric eigenvalue decomposition
zbMATH Open document ID: 1403.65018
author: Takeshi Ogita
author: Kensuke Aishima
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2018-12-07T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 15A23
zbMATH DE Number: 6990730
zbMATH Keywords: accurate numerical algorithm
zbMATH Keywords: iterative refinement
zbMATH Keywords: symmetric eigenvalue decomposition
zbMATH Keywords: quadratic convergence
describes a project that uses: LAPACK
describes a project that uses: mctoolbox
describes a project that uses: mftoolbox
describes a project that uses: gmp
describes a project that uses: advanpix
describes a project that uses: LBNL
describes a project that uses: XBLAS
MaRDI profile type: Publication
full work available at URL: s13160-018-0310-3
OpenAlex ID: W2800481425
cites work: A Grassmann--Rayleigh quotient iteration for computing invariant subspaces
cites work: Spectral refinement on quasi-diagonal matrices
cites work: LAPACK Users' Guide
cites work: Theoretical Numerical Analysis
cites work: SOME NOTES ON JAHN'S METHOD FOR THE IMPROVEMENT OF APPROXIMATE LATENT ROOTS AND VECTORS OF A SQUARE MATRIX
cites work: Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem
cites work: Updating the singular value decomposition
cites work: A direct method for completing eigenproblem solutions on a parallel computer
cites work: Q4348513
cites work: Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
cites work: Improving the Accuracy of Computed Eigenvalues and Eigenvectors
cites work: Q4917542
cites work: A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Functions of Matrices
cites work: IMPROVEMENT OF AN APPROXIMATE SET OF LATENT ROOTS AND MODAL COLUMNS OF A MATRIX BY METHODS AKIN TO THOSE OF CLASSICAL PERTURBATION THEORY
cites work: Design, implementation and testing of extended and mixed precision BLAS
cites work: Accurate Sum and Dot Product
cites work: Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
cites work: Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
cites work: Q4348515
cites work: Accurate Floating-Point Summation Part I: Faithful Rounding
cites work: Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
cites work: Newton's method in floating point arithmetic and iterative refinement of generalized eigenvalue problems
cites work: Q5674306
DOI: 10.1007/S13160-018-0310-3
description: scientific article; zbMATH DE number 6990730