Globally and Rapidly Convergent Algorithms for Symmetric Eigenproblems

DOI10.1137/0612053zbMath0736.65021OpenAlexW2062640418MaRDI QIDQ3980611

J. F. G. Auchmuty

Publication date: 26 June 1992

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0612053

zbMATH Keywords

algorithmsglobal convergencevariational principlesNewton's methodeigenpairscubic convergencesymmetric eigenproblem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (4)

The symmetric eigenvalue complementarity problem ⋮ A DC programming approach for solving the symmetric eigenvalue complementarity problem ⋮ Continuous methods for symmetric generalized eigenvalue problems ⋮ Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton's Method

This page was built for publication: Globally and Rapidly Convergent Algorithms for Symmetric Eigenproblems