关于海森堡模型中一种并行算法实现的讨论

使用并行算法（简称Z分法）fortran编程计算获取海森堡模型位型N，k] （N为海森堡链总格点数, k为格点中自旋向上的电子数）的最小本征值的最短时间。研究方法：使用置换群方法产生模型的能量矩阵，将能量矩阵对角化所得到的本征值构成数据群，采用Z（Z=1,2……）分法Fortran编程计算获得群中最小数据的最短(或最长)时间。研究结论：(1）同一位型N,k]，使用2分法获取模型位型N，k]的最小本征值的时间最长，而不等分或满等分（此时Z=1或位型N，k]的矩阵维数）时的时间最短且二者相等。(2）对于不同位型N,k] ，Z相同而当N（k）同,k（N）增大时，获取模型最小本征值的最短时间增加。通过讨论海森堡模型获取最小本征值的时间计量可为研究者们在计算工作中作提高运算效率的借鉴。

Discussion on implementation of a parallel algorithm about Heisenberg mode

The shortest time of the minimum eigenvalue of. N，k] of the Heisenberg model( N is the total number of sites of heisenberg chain , k is the number of electrons at site spin up) are obtained using parallel algorithm (Z equisection method ) in fortran program . The studying method is the following . (1)The energy matrix of N，k] is produced by permutation group. The eigenvalues are obtained diagonalling the energy matrix. The shortest (or longest)time of the minimum eigenvalue of N，k] is obtained from the data group being made up of the eigenvalues using Z equisection method .The studying results are the following. The time is the shortest. and same when Z is 1 or the number of the eigenvalue of N, k].(2) When Z and N (k) are same and k（N）increases,the time acquisiting the minimum eigenvalues of N, k] increases.