- 學位論文
An Experimental Performance Study of Polynomial Preconditioner in PCG
An Experimental Performance Study of Polynomial Preconditioner in PCG
並列摘要
Solving laplacian system is common in the field of computer science nowadays. Preconditioner is an essential tool while solving linear system with indirect method. It may bring significant improvements to number of iterations, CPU time, and the errors. In this work we will start with graph laplacian, matrix splitting and approximation theories to get some polynomial preconditioners, and investigate the performance in the changes of different parameters in PCG(Preconditioned Conjugate Gradient) method mainly by experiments. We will show the experimental result as conclusion for the purpose of accelerating the iteration in future works.
參考文獻
O. G. Johnson, C. A. Micchelli and G. Paul, Polynomial Preconditioners for Conjugate Gradient Calculations, Society for Industrial and Applied Mathematics, SIAM Journal on Numerical Analysis, Vol. 20, No. 2 (1983), pp. 362-376.
A. K. Nandi, Iterative Methods for Linear and Multilinear Systems Based on Splittings, Birla Institute of Technology and Science, Pilani.
H. Wang, S. Xiang, On the convergence rates of Legendre approximation, Math. Computation, 81 (2012), pp. 861-877.
J.-J. Climent, N. Thome and Y. Wei, A geometrical approach on generalized inverses by Neumann-type series, Linear Algebra and its Applications, 332–334 (2001), pp. 533-540.
M.H. ,Mudde (2017), Chebyshev approximation, Master Thesis, University of Groningen, Faculty of Science and Engineering, Groningen.