Skew-symmetric methods for nonsymmetric linear systems with multiple right-hand sides

Authors:
Chuanqing Gu;Hongjun Qian
Affiliations:
Department of Mathematics, Shanghai University, Shanghai 200444, China;Department of Mathematics, Shanghai University, Shanghai 200444, China
Venue:
Journal of Computational and Applied Mathematics
Year:
2009

Citing 2
Cited 2

Global FOM and GMRES algorithms for matrix equations

Applied Numerical Mathematics
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

ACM Transactions on Mathematical Software (TOMS)

A block IDR(s) method for nonsymmetric linear systems with multiple right-hand sides

Journal of Computational and Applied Mathematics
A block GCROT(m,k) method for linear systems with multiple right-hand sides

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	7.29

Visualization

Abstract

By transforming nonsymmetric linear systems to the extended skew-symmetric ones, we present the skew-symmetric methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on the block and global Arnoldi algorithm which is formed by implementing orthogonal projections of the initial matrix residual onto a matrix Krylov subspace. The algorithms avoid the tediously long Arnoldi process and highly reduce expensive storage. Numerical experiments show that these algorithms are effective and give better practical performances than global GMRES for solving nonsymmetric linear systems with multiple right-hand sides.