BiCGSTAB method for solving trapezoidal rule of large ODEs : How we can speed up by reusing of Krylov subspaces
-
- Nakamura Shinsuke
- Faculty of Systems Science and Technology, Akita Prefectural University
-
- Mitsui Taketomo
- Nagoya University
Bibliographic Information
- Other Title
-
- 大規模常微分方程式系の台形則に対するBiCGSTAB法 : Krylov部分空間の再利用による高速化の試み
- ダイキボ ジョウビブン ホウテイシキケイ ノ ダイケイソク ニ タイスル BiCGSTABホウ Krylov ブブン クウカン ノ サイリヨウ ニ ヨル コウソクカ ノ ココロミ
Search this article
Description
We are concerned with an efficient numerical solution of linear equations at each time-stepping of the trapezoidal rule applied to a system of linear ordinary differential equations (ODEs) with a constant coefficient matrix of large dimension. We do not assume that the matrix is symmetric. Hence numerical solutions in the family of BiCG method are sought. The present paper describes a method to reuse Krylov subspaces in the BiCGSTAB process over a number of computational steps. It can suppress increase of the memory usage as well as reduce the total number of BiCGSTAB iterations. Numerical examples depict its efficiency.
Journal
-
- Transactions of the Japan Society for Industrial and Applied Mathematics
-
Transactions of the Japan Society for Industrial and Applied Mathematics 17 (3), 219-238, 2007
The Japan Society for Industrial and Applied Mathematics
- Tweet
Details 詳細情報について
-
- CRID
- 1390001205767797248
-
- NII Article ID
- 110006405048
-
- NII Book ID
- AN10367166
-
- ISSN
- 09172246
- 24240982
-
- NDL BIB ID
- 8962697
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed
