The resulting block Arnoldi algorithm is not only better than the standard $m$-step one both in theory and in practice but also cheaper than the standard $(m+1)$-step one.

• 新算法不仅在理论和实际计算中优于 %24m%24-步的块Arnoldi算法，而且比标准的%24(m+1)%24-步块Arnoldi算法所需的运算量少。