full
search.png

Search

close.png

Cancel

arrow
Volume 1, Issue 5
New Smoothing Iterative Block Methods for Linear Systems with Multiple Right-hand Sides

J. Info. Comput. Sci. , 1 (2006), pp. 311-317.

Purchase PDF 56 710

Cited by

google scholar semantic scholar
Export citation
  • Abstract
In the present paper, we propose new smoothing procedures for iterative block methods for solving nonsymmetric linear systems of equations with multiple right-hand sides. These procedures generalize those known for solving linear systems with one right-hand. We first give some properties of these new algorithms. Then new methods such as the global minimal residual smoothing (GMRS) algorithm and the smoothed global biconjugate gradient (SGL-BCG) algorithm are introduced. Finally, numerical examples are given.
  • Keywords

Block methods, Smoothing, Iterative methods, Nonsymmetric linear systems, Mutiple right-hand sides, Matrix Krylov subspace, GL-BCG algorithm

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JICS-1-311, author = {}, title = {New Smoothing Iterative Block Methods for Linear Systems with Multiple Right-hand Sides}, journal = {Journal of Information and Computing Science}, year = {2024}, volume = {1}, number = {5}, pages = {311--317}, abstract = { In the present paper, we propose new smoothing procedures for iterative block methods for solving nonsymmetric linear systems of equations with multiple right-hand sides. These procedures generalize those known for solving linear systems with one right-hand. We first give some properties of these new algorithms. Then new methods such as the global minimal residual smoothing (GMRS) algorithm and the smoothed global biconjugate gradient (SGL-BCG) algorithm are introduced. Finally, numerical examples are given. }, issn = {1746-7659}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22830.html} }
TY - JOUR T1 - New Smoothing Iterative Block Methods for Linear Systems with Multiple Right-hand Sides AU - JO - Journal of Information and Computing Science VL - 5 SP - 311 EP - 317 PY - 2024 DA - 2024/01 SN - 1 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jics/22830.html KW - Block methods, Smoothing, Iterative methods, Nonsymmetric linear systems, Mutiple right-hand sides, Matrix Krylov subspace, GL-BCG algorithm AB - In the present paper, we propose new smoothing procedures for iterative block methods for solving nonsymmetric linear systems of equations with multiple right-hand sides. These procedures generalize those known for solving linear systems with one right-hand. We first give some properties of these new algorithms. Then new methods such as the global minimal residual smoothing (GMRS) algorithm and the smoothed global biconjugate gradient (SGL-BCG) algorithm are introduced. Finally, numerical examples are given.
. (2024). New Smoothing Iterative Block Methods for Linear Systems with Multiple Right-hand Sides. Journal of Information and Computing Science. 1 (5). 311-317. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard