黃聰明Huang, Tsung-Ming張耀文Chang, Yao-Wen2022-06-082022-02-082022-06-082022https://etds.lib.ntnu.edu.tw/thesis/detail/2f7738254d4733b93e9f623f43867612/http://rportal.lib.ntnu.edu.tw/handle/20.500.12235/117073noneSolving 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.noneGraph LaplacianPCGPolynomial Preconditioner學術論文