An alternative implementation of the IDRstab method saving vector updates

スポンサーリンク

概要

• 論文の詳細を見る

• The IDRstab method is often more effective than both IDR($s$) and BiCGstab($\ell$) for solving large nonsymmetric linear systems. However the computational costs for vector updates are expensive on the original implementation of IDRstab. In this paper, we propose a variant of IDRstab to reduce the computational cost; vector updates are saved. Numerical experiments demonstrate the efficiency of our variant of IDRstab for sparse linear systems.

著者

• Aihara Kensuke

  Graduate School of Science, Tokyo University of Science

• Abe Kuniyoshi

  Faculty of Economics and Information, Gifu Shotoku University

• Ishiwata Emiko

  Department Of Mathematical Information Science Tokyo University Of Science

関連論文

• A strategy of reducing the inner iteration counts for the variable preconditioned GCR({$\vc{m}$}) method
• Discrete hungry integrable systems related to matrix eigenvalue and their local analysis by center manifold theory (Expansion of Integrable Systems)
• Improved SOR Method with Orderings and Direct Methods
• An alternative implementation of the IDRstab method saving vector updates
• Adaptive Improved Block SOR Method with Orderings
• On the qd-type discrete hungry Lotka-Volterra system and its application to the matrix eigenvalue algorithm

スポンサーリンク