The geometric mean algorithm

Bisection (of a real interval) is a well known algorithm to compute eigenvalues of symmetric matrices. Given an initial interval [a,b][a,b], convergence to an eigenvalue which has size much smaller than a or b may be made considerably faster if one replaces the usual arithmetic mean (of the end points of the current interval) with the geometric mean. Exploring this idea, we have implemented geometric bisection in a Matlab code. We illustrate the effectiveness of our algorithm in the context of the computation of the eigenvalues of a symmetric tridiagonal matrix which has a very large condition number.