网站大量收购独家精品文档,联系QQ:2885784924

A Krylov Subspace Method to Solve a Sequence of Linear Systems with Dioeerent Right-Hand.pdf

A Krylov Subspace Method to Solve a Sequence of Linear Systems with Dioeerent Right-Hand.pdf

  1. 1、本文档共23页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
A Krylov Subspace Method to Solve a Sequence of Linear Systems with Dioeerent Right-Hand

A Krylov Subspace Method to Solve a Sequenceof Linear Systems with Dierent Right-HandSidesDaniel Skoogh November 1998AbstractA new method to solve linear systems of equations with several right-hand sides is described. It uses the basis from a previous solution to reducethe number of matrix vector products needed to solve a linear system ofequations with a new right-hand side. It builds up a subspace of a union ofKrylov spaces. Some numerical examples are given where variants of themethod are compared to Krylov subspace methods, particularly a blockArnoldi (GMRES) algorithm.Keywords: Arnoldi, Krylov, block, right-hand sides, iterativeAMS subject classication 65F101 IntroductionConsider a set of k linear systems with the same matrix A, but with severalright hand sides bi; i = 1; : : : ; k:Axi = bi; i = 1; : : : ; k (1)A 2 Cnn; bi;xi 2 Cn: (2)We are going to describe a new method that reduces the total number of matrixvector products needed to solve the system (1) compared to when the system issolved for each right-hand side separately. We will discuss cases when all righthand sides are known before the iterations begin, as well as cases when they arenot.If all right-hand sides are known before the iterations begin, then the blockArnoldi method can be used to solve the set of systems (1). It generates or-thonormal basis vectors v1; : : : ;vm+k that span the subspaceSm+k = k[i=1K(mk +1)(A; bi); (3)Report No 1998-46 in Bl? serien preprint series, available at URL:http://www.math.chalmers.se/Math/Research/Preprints. Authors address: Depart-ment of Mathematics, Chalmers University of Technology and the University of G?teborg,S-41296 G?teborg, Sweden (skoogh@math.chalmers.se)1 which is a union of Krylov spaces. As usual, a Krylov subspace is dened byKk(A;v) = spanfv;Av;A2v; : : : ;Ak1vg: (4)In this report we will introduce new algorithms that generate orthonormal basisvectors which span a subspace of a union of Krylov spaces, whereas block Arnoldigenerates basis v

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档