Fast accurate eigenvalue methods for graded positive definite matrices

DOI10.1007/s002110050209zbMath0856.65038OpenAlexW2081925639MaRDI QIDQ1923282

Roy Mathias

Publication date: 11 February 1997

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110050209

zbMATH Keywords

eigenvaluesfast algorithmscondition numberCholesky factorizationpositive definite matrixgraded matrixJacobi's method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (1)

An overview of relative \(\sin\Theta\) theorems for invariant subspaces of complex matrices

This page was built for publication: Fast accurate eigenvalue methods for graded positive definite matrices