An Extended Divide and Conquer Algorithm for Solving Real Symmetric Band Generalized Eigenvalue Problem

In this paper, an extended divide and conquer algorithm is intended proposed, which is for solving the real symmetric band generalized eigenvalue problem under distributing environment Eigenvalue partition theorem is presented and proved Based on divide and conquer by extension, this algorithm computes generalized eigenpaires of symmetric band matrix pencil by bisection and generalized Rayleigh quotient iteration Theoretic analysis and numerical results show that this algorithm is better than the classic software package LAPACK when bandwidth is small and the scale is large Combined with multisection, which has good parallelism, it got good effects under distributed environments