scientific article; zbMATH DE number 25590

MaRDI QIDQ3984057zbMATH OpenFDO

Authors Guo-Dong Zhang

Publication date 27 June 1992

zbMATH Keywords

bisection methodconvergence rateextreme eigenvaluesNewton's iteration methodnumerical examplessymmetric tridiagonal matrixvery large sparse matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)

Recommendations

• Publication:4935904
• Bisection acceleration for the symmetric tridiagonal eigenvalue problem
• scientific article; zbMATH DE number 741157
• scientific article; zbMATH DE number 1330402

Cited in

(9)

• Bisection acceleration for the symmetric tridiagonal eigenvalue problem
• Bisection eigenvalue method for Hermitian matrices with quasiseparable representation and a related inverse problem
• The geometric mean algorithm
• On the estimation of eigenvalues for bisymmetric matrices
• Newton's method for symmetric and bisymmetric solvents of the nonlinear matrix equations
• Computing a Few Eigenvalues and Eigenvectors of a Symmetric Band Matrix
• scientific article; zbMATH DE number 4074343 (Why is no real title available?)
• Bisection is not Optimal on Vector Processors
• Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984057)