  The Eberlein method is a Jacobi-type process for solving the eigenvalue
problem of an arbitrary matrix. In each iteration two transformations are
applied on the underlying matrix, a plane rotation and a non-unitary elementary
transformation. The paper studies the method under the broad class of
generalized serial pivot strategies. We prove the global convergence of the
Eberlein method under the generalized serial pivot strategies with permutations
and present several numerical examples.
