Block conjugate gradient type methods for the approximation of bilinear form CHA-1B

Authors:
Lei Du;Yasunori Futamura;Tetsuya Sakurai
Affiliations:
-;-;-
Venue:
Computers & Mathematics with Applications
Year:
2014

Citing 7
Cited 0

An iterative method for nonsymmetric systems with multiple right-hand sides

SIAM Journal on Scientific Computing
Some large-scale matrix computation problems

Journal of Computational and Applied Mathematics - Special issue on TICAM symposium
A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method

Journal of Computational and Applied Mathematics
Matrices, Moments and Quadrature with Applications

Matrices, Moments and Quadrature with Applications
A block IDR(s) method for nonsymmetric linear systems with multiple right-hand sides

Journal of Computational and Applied Mathematics
The university of Florida sparse matrix collection

ACM Transactions on Mathematical Software (TOMS)
On Efficient Numerical Approximation of the Bilinear Form $c^*A^{-1}b$

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper, we consider computing the approximation of block bilinear form C^HA^-^1B, where square matrix A is large sparse, and B and C are rectangular matrices with the same size. We propose block conjugate gradient (CG) type methods for the approximation of C^HA^-^1B, in which approximation X"k of linear systems AX=B does not need to be computed explicitly and only the approximation @h"k of C^HA^-^1B, which is mathematically equivalent to C^HX"k, will be calculated instead. Numerical results show the effectiveness of our proposed methods.