Improved QMRCGSTAB method in distributed parallel environments

Abstract

An improved version of the QMRCGSTAB method (IQMRCGSTAB method) for solving large sparse linear systems with non-symmetric coefficient matrices is proposed. The proposed method combines elements of numerical stability and parallel algorithm design without increasing computational costs. Performance analysis shows that the IQMRCGSTAB method has better parallelism and scalability than the original method. Numerical experiments show the efficiency of the new method.

Keywords:

• Linear systems
• Improved QMRCGSTAB method
• Massively parallel computing
• Inner product
• Global communication

Acknowledgements

This project is partially supported by the Natural Science Fund of China (60373015) and the Foundation of the National Key Laboratory of Computational Physics.