Since the multiscale wavelet-based numerical methods allow effective adaptive analysis, they have become new analysis tools. However, the main applications of these methods have been mainly on elliptic problems, they are rarely used for eigenvalue analysis. The objective of this paper is to develop a new multiscale wavelet-based adaptive Galerkin method for eigenvalue analysis. To this end, we employ the hat interpolation wavelets as the basis functions of the finite-dimensional trial function space and formulate a multiresolution analysis approach using the multiscale wavelet-Galerkin method. It is then shown that this multiresolution formulation makes iterative eigensolvers very efficient. The intrinsic difference-checking nature of wavelets is shown to play a critical role in the adaptive analysis. The effectiveness of the present approach will be examined in terms of the total numbers of required nodes and CPU times.