Research Article

Partitioning Inverse Monte Carlo Iterative Algorithm for Finding the Three Smallest Eigenpairs of Generalized Eigenvalue Problem

Table 1

Number of chains 𝑁 = 8 0 .

DimensionEigenvalues errorEigenvectors error
𝜆 1 ( 1 ) 𝜆 1 ( 2 ) 𝜆 1 ( 3 ) 𝑣 1 ( 1 ) 𝑣 1 ( 2 ) 𝑣 1 ( 3 )

6 4 × 6 4 1 . 2 6 × 1 0 7 4 . 5 × 1 0 7 1 . 2 6 × 1 0 6 8 . 3 6 × 1 0 4 . 0 0 2 8 1 3 . 0 0 8 1 5 4
1 2 8 × 1 2 8 1 . 1 8 × 1 0 7 4 . 4 6 × 1 0 7 1 . 3 3 × 1 0 6 6 . 3 3 × 1 0 4 . 0 0 2 5 3 4 . 0 0 8 0 7 4
2 5 6 × 2 5 6 6 . 4 8 × 1 0 8 4 . 3 7 × 1 0 7 1 . 5 1 × 1 0 6 3 . 1 6 × 1 0 4 . 0 0 2 1 5 1 . 0 0 8 0 7 0
5 1 2 × 5 1 2 7 . 9 1 × 1 0 8 2 . 8 7 × 1 0 7 1 . 7 2 × 1 0 6 1 . 8 3 × 1 0 4 . 0 0 1 2 8 4 . 0 0 7 7 5 9
1 0 2 4 × 1 0 2 4 7 . 0 4 × 1 0 8 1 . 9 9 × 1 0 7 1 . 7 9 × 1 0 6 1 . 0 6 × 1 0 4 . 0 0 0 7 1 2 . 0 0 7 6 9