Solving Large Sparse Systems of Equations by Iterative Methods

碩士 === 大同大學 === 應用數學研究所 === 89 === Each iterative method uses successive procedure to produce a more accurate solution to a linear system at each iteration. In this paper, we review some famous iterative methods such as IGCG, CGS, and BICGSTAB and discuss at what situation the breakdown w...

Full description

Bibliographic Details
Main Authors: Yi-Hung Ke, 柯宜宏
Other Authors: Luhan Chuang
Format: Others
Language:zh-TW
Published: 2001
Online Access:http://ndltd.ncl.edu.tw/handle/84188697217536667543
id ndltd-TW-089TTU00507001
record_format oai_dc
spelling ndltd-TW-089TTU005070012015-10-13T12:14:42Z http://ndltd.ncl.edu.tw/handle/84188697217536667543 Solving Large Sparse Systems of Equations by Iterative Methods 迭代法求大型稀疏線性系統 Yi-Hung Ke 柯宜宏 碩士 大同大學 應用數學研究所 89 Each iterative method uses successive procedure to produce a more accurate solution to a linear system at each iteration. In this paper, we review some famous iterative methods such as IGCG, CGS, and BICGSTAB and discuss at what situation the breakdown will occur. We also choose two partial differential equations with boundary value conditions as our test problems and discretisize them to linear systems by the central difference. Furthermore, we choose some types of Krylov subspace methods to solve these test problems, and compare the computing time and the rate of convergence of those Krylov subspace methods. Luhan Chuang 莊陸翰 2001 學位論文 ; thesis 35 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 大同大學 === 應用數學研究所 === 89 === Each iterative method uses successive procedure to produce a more accurate solution to a linear system at each iteration. In this paper, we review some famous iterative methods such as IGCG, CGS, and BICGSTAB and discuss at what situation the breakdown will occur. We also choose two partial differential equations with boundary value conditions as our test problems and discretisize them to linear systems by the central difference. Furthermore, we choose some types of Krylov subspace methods to solve these test problems, and compare the computing time and the rate of convergence of those Krylov subspace methods.
author2 Luhan Chuang
author_facet Luhan Chuang
Yi-Hung Ke
柯宜宏
author Yi-Hung Ke
柯宜宏
spellingShingle Yi-Hung Ke
柯宜宏
Solving Large Sparse Systems of Equations by Iterative Methods
author_sort Yi-Hung Ke
title Solving Large Sparse Systems of Equations by Iterative Methods
title_short Solving Large Sparse Systems of Equations by Iterative Methods
title_full Solving Large Sparse Systems of Equations by Iterative Methods
title_fullStr Solving Large Sparse Systems of Equations by Iterative Methods
title_full_unstemmed Solving Large Sparse Systems of Equations by Iterative Methods
title_sort solving large sparse systems of equations by iterative methods
publishDate 2001
url http://ndltd.ncl.edu.tw/handle/84188697217536667543
work_keys_str_mv AT yihungke solvinglargesparsesystemsofequationsbyiterativemethods
AT kēyíhóng solvinglargesparsesystemsofequationsbyiterativemethods
AT yihungke diédàifǎqiúdàxíngxīshūxiànxìngxìtǒng
AT kēyíhóng diédàifǎqiúdàxíngxīshūxiànxìngxìtǒng
_version_ 1716855302658195456