AbstractIn the present paper, we present smoothing procedures for iterative block methods for solving nonsymmetric linear systems of equations with multiple right-hand sides. These procedures generalize those known when solving one right-hand linear systems. We give some properties of these new methods and then, using these procedures we show connections between some known iterative block methods. Finally we give some numerical examples
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
This thesis concerns with the development of efficient Krylov subspace methods for solving sequences...
AbstractIn the present paper, we present smoothing procedures for iterative block methods for solvin...
AbstractThe IDR(s) based on the induced dimension reduction (IDR) theorem, is a new class of efficie...
AbstractMany applications require the solution of multiple linear systems that have the same coeffic...
This work concerns the solution of non-symmetric, sparse linear systems with multiple right hand sid...
Many applications require the solution of large nonsymmetric linear systems with multiple right-hand...
AbstractThe global bi-conjugate gradient (Gl-BCG) method is an attractive matrix Krylov subspace met...
This thesis concerns with the development of efficient Krylov subspace methods for solving sequences...
This thesis concerns with the development of efficient Krylov subspace methods for solving sequences...
AbstractBy transforming nonsymmetric linear systems to the extended skew-symmetric ones, we present ...
This thesis concerns with the development of efficient Krylov subspace methods for solving sequences...
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
This thesis concerns with the development of efficient Krylov subspace methods for solving sequences...
AbstractIn the present paper, we present smoothing procedures for iterative block methods for solvin...
AbstractThe IDR(s) based on the induced dimension reduction (IDR) theorem, is a new class of efficie...
AbstractMany applications require the solution of multiple linear systems that have the same coeffic...
This work concerns the solution of non-symmetric, sparse linear systems with multiple right hand sid...
Many applications require the solution of large nonsymmetric linear systems with multiple right-hand...
AbstractThe global bi-conjugate gradient (Gl-BCG) method is an attractive matrix Krylov subspace met...
This thesis concerns with the development of efficient Krylov subspace methods for solving sequences...
This thesis concerns with the development of efficient Krylov subspace methods for solving sequences...
AbstractBy transforming nonsymmetric linear systems to the extended skew-symmetric ones, we present ...
This thesis concerns with the development of efficient Krylov subspace methods for solving sequences...
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
The restarted block generalized minimum residual method (BGMRES) with deflated restarting (BGMRES-DR...
This thesis concerns with the development of efficient Krylov subspace methods for solving sequences...