Solving Sparse Linear System by ILU Preconditioned GMRES and DQGMRES Methods
碩士 === 輔仁大學 === 數學系研究所 === 93 === In this dissertation presents a method that applying ILU preconditioner to the well-known iterative methods, GMRES and DQGMRES for solving a large linear system Ax = b,where $A$ is a sparse nonsigular square matrix of order $n imes n$,the given $b$ and the unknown $...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/54443520748391586561 |
| Summary: | 碩士 === 輔仁大學 === 數學系研究所 === 93 === In this dissertation presents a method
that applying ILU preconditioner to the well-known
iterative methods, GMRES and DQGMRES for solving a large linear system Ax = b,where $A$ is a sparse nonsigular square matrix of order $n imes n$,the given $b$ and the unknown $x$ are $n$-dimensional column vectors.
The forementioned approach is to generate a pattern from Boolean
matrices in practical. We compare the iteration number and
CPU time on several problems for various numerical methods
in order to verify our methods.
|
|---|