%0 Generic %1 Meng2014New %A Meng, Jing %A Zhu, Peiyong %A Li, Houbiao %A Jing, Yanfei %D 2014 %K na %T A new deflated block GCROT(\$m,k\$) method for the solution of linear systems with multiple right-hand sides %U http://arxiv.org/abs/1405.3733 %X Linear systems with multiple right-hand sides arise in many applications. To solve such systems efficiently, a new deflated block GCROT(\$m,k\$) method is explored in this paper by exploiting a modified block Arnoldi deflation. This deflation strategy has been shown to have the potential to improve the original deflation which indicates an explicit block size reduction. Incorporating this modified block Arnoldi deflation, the new algorithm can address the possible linear dependence at each iteration during the block Arnoldi procedure and avoids expensive computational operations. In addition, we analyze its main mathematical properties and prove that the deflation procedure is based on a non-increasing behavior of the singular values of the true block residual. Moreover, as a block version of GCROT(\$m,k\$), the new method inherits the property of easy operability. Finally, some numerical examples also illustrate the effectiveness of the proposed method.

@misc{Meng2014New, abstract = {{Linear systems with multiple right-hand sides arise in many applications. To solve such systems efficiently, a new deflated block GCROT(\$m,k\$) method is explored in this paper by exploiting a modified block Arnoldi deflation. This deflation strategy has been shown to have the potential to improve the original deflation which indicates an explicit block size reduction. Incorporating this modified block Arnoldi deflation, the new algorithm can address the possible linear dependence at each iteration during the block Arnoldi procedure and avoids expensive computational operations. In addition, we analyze its main mathematical properties and prove that the deflation procedure is based on a non-increasing behavior of the singular values of the true block residual. Moreover, as a block version of GCROT(\$m,k\$), the new method inherits the property of easy operability. Finally, some numerical examples also illustrate the effectiveness of the proposed method.}}, added-at = {2019-02-23T22:09:48.000+0100}, archiveprefix = {arXiv}, author = {Meng, Jing and Zhu, Peiyong and Li, Houbiao and Jing, Yanfei}, biburl = {https://www.bibsonomy.org/bibtex/285566bd2cdfad0df171d01051d240a12/cmcneile}, citeulike-article-id = {14223157}, citeulike-linkout-0 = {http://arxiv.org/abs/1405.3733}, citeulike-linkout-1 = {http://arxiv.org/pdf/1405.3733}, day = 26, eprint = {1405.3733}, interhash = {4971360f2aed7bc076da0add63b74136}, intrahash = {85566bd2cdfad0df171d01051d240a12}, keywords = {na}, month = jun, posted-at = {2016-12-07 15:06:28}, priority = {2}, timestamp = {2019-02-23T22:15:27.000+0100}, title = {{A new deflated block GCROT(\$m,k\$) method for the solution of linear systems with multiple right-hand sides}}, url = {http://arxiv.org/abs/1405.3733}, year = 2014 }