摘要
对M阵用块循环约化后,给出新的分裂方式,该分裂构造的选代收敛,其收敛速度比Jacobi等一般迭代收敛快,且有很好的并行性.
Cyclic reduction methods is highly parallel methods for solving block tridiagonal systems;this paper extends cyclic reduction algorithms to block tridiagonal M-matrix systems.When A is a M-matrix block tridiagonal systems,we apply incomplete block cyclic reduction to get a precondition,then get a solution with generalized PCG methods.After applying block cyclic reduction for M-matrix, this paper put forward a new splitting methods and demonstrates this splitting iteration converge.The converge speed is faster than Jacobi iteration.Because this spiltting process applies block cyclic reduction,this process is highly parallel.
出处
《青岛大学学报(自然科学版)》
CAS
1995年第3期42-49,共8页
Journal of Qingdao University(Natural Science Edition)
关键词
块循环约化
并行分裂迭代
迭代收敛
迭代法
lock cyclic reduction
incomplete block cyclic reduction
parallel splitting iteration