A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices

We present a fast and numerically stable algorithm for computing the eigendecomposition of a symmetric block diagonal plus semiseparable matrix. We report numerical experiments that indicate that our algorithm is significantly faster than the standard method which treats the given matrix as a general symmetric dense matrix.