[en] CAS3D and TERPSICHORE have been designed to analyze the global ideal MHD stability of three dimensional equilibria. Their critical part is to obtain the smallest eigenvalue and its corresponding eigenvector of a large but sparse real symmetric band matrix. In CAS3D the inverse iteration have been applied to do this and the spectral shift is computed by EISPACK eigensolver. It has been shown that application of such kind of software becomes very expensive in the sense of computational time and storage when matrix order and bandwidth become very large. Here this problem is resolved by using the Lanczos algorithm which is economical in CPU time and storage and particularly suitable for very large scale problems. The version of CAS3D2MN with shift-and-inverse Lanczos algorithm is called CAS3D2MNv1. Practical calculations in CAS3D2MNv1 indicate that the shift-and-inverse Lanczos recursion needs only 15 - 20 steps to calculate the smallest eigenvalue. The computation is reliable and efficient. The storage is much smaller and CPU time is saved significantly by 50 - 100 times compared with EISPACK subroutine. Finally the ballooning mode in three dimensional MHD equilibria has been mentioned briefly. (author)