Solving Block Low-Rank Matrix Eigenvalue Problems

抄録

To solve large-scale matrix eigenvalue problems (EVPs), a two-step tridiagonalization method using the block Householder transformation (HT) is often employed. Although the method based on dense matrix arithmetic requires a memory storage of O(N²) and an arithmetic operations of O(N³), in this study, these were reduced by approximating the method using block low-rank (BLR-) matrices. A special block HT for BLR-matrices and a two-step tridiagonalization method using it are proposed to solve an EVP with a real symmetric BLR-matrix. In the proposed block HT, block Householder vectors are also formed using BLR-matrices. It is demonstrated how the block size m in the BLR-matrix should be determined and confirmed that the memory and arithmetic complexities of the proposed method were O(N^5/3) and O(N^7/3), respectively, for typical cases when using an appropriate block size m ∝ N^1/3. In numerical experiments of a string free vibration problem with known analytical solutions, for large eigenvalues, the calculated eigenvalues using the proposed method converge toward the analytical ones in accordance with the theoretical convergence curves. Owing to the reduced complexity, an EVP of a matrix was solved with about N =300,000, which is significantly larger than the limit of the conventional method with dense matrices, within a reasonable amount of time on a CPU core. For the calculation time, the proposed method was faster than the conventional method when the matrix size N was larger than a few tens of thousands.