As mentioned many times, the exponential scaling of the FCI algorithm implies the FCI matrix is very large, and hence iterative diagonalization methods prove useful here that can obtain the nth smallest or largest eigenstates. These iterative algorithms may be used in conjunction with Sparse-Matrix Vector Multiplication, to prevent the explicit construction of the CI Hamiltonian.