江躍勇


【摘 要】Yun提了一種對對稱M-矩陣的不完全分解預條件技術.本文給出的預條件方法對上述方法予以了改進, 改進的方法收斂速度更快.
【關鍵詞】不完全分解;M-矩陣;稀疏矩陣;共軛梯度法
1 主要結果
在文獻[1]中, Yun提出了一種對系數矩陣為大型稀疏塊三對角對稱M-陣的線性方程組的預條件技術,本文對這種技術進行了改進.
【參考文獻】
[1]Jae Heon Yun, Block incomplete factorization preconditioners for a symmetric block-tridiagonal M-matrix, Journal of Computational and Applied Mathematics[Z], 94 (1998): 133-152.
[2]P. Concus, G.H. Golub, G. Meurant, Block preconditioning for the CG method, SIAM J. Sci. Stat[Z]. Comput. 6(1985): 220-252.
[3]Roger A. Horn, Charles R. Johnson. Topics in Matrix Analysis, Posts & Telecom Press, Beijing, 2005[Z].
[4]O. Axelsson, Iterative Solution Methods, Cambridge University Press, New York, 1994[Z].
[5]D.G. Luenbeger, Introduction to Linear and Nonlinear Progrmming Addison-Wesley, New York, 1973[Z].
[6]Yousef Saad, ILUT: A dual threshold incomplete LU factorization. Numer. Linear Algebra Appl., 4:387-402, 1994[Z].
[7]Michele Benzi, Preconditioning Techniques for Large Linear Systems: A Survey, Journal of Comp. Physics, 182(2002): 418-477[Z].
[責任編輯:楊玉潔]