【摘要】 讨论一种多重网格叠缩并行计算方法。此方法在多重网格上同时执行对所有未知量的运算，它的全部工作渐近估计为Ｏ（２ｌｏｇＮ），与标准Ｖ周期多重网格方法的计算复杂性等同。更多还原

【Abstract】 Presented in this paper is a telesscopic paralldization of a multigrid,a method for all op-erations on all unknowns to be performed simultaneously on all levels,It is assumed by thealgorithm proposed that the number of iterations on the multiple grid twice equally dividesthe number of levels and limits the types of iterative methods that qualify as smoothers. Thecommunication between adjacent levels is twice the amount what is expected.The number oflevels the information has to traverse to andfrom between thefinest level and the coarsestone is twice as large as the normal one.更多还原