On computer realization of algorithms for solving.pdfVIP

On computer realization of algorithms for solving.pdf

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
On computer realization of algorithms for solving

On computer realization of algorithms for solving special block linear systems Borislav V. Minchev? Ivan G. Ivanov?? ? Faculty of Mathematics and Informatics, Shoumen University, Shoumen, 9712, Bulgaria e-mail: Borko.Minchev@ii.uib.no ? ? Faculty of Economics and Business Administration, Sofia University, Sofia 1113, Bulgaria e-mail: i ? ivanov@feb.uni-sofia.bg Abstract The solution of Hermitian block circulant tridiagonal linear system is investigated. This special kind of system appears in many applications. We propose new approach of El-sayed’s method and develop two new algorithms for solving such kind of systems. Numerical experiments with our algorithms and some classical algorithms are executed. Numerical examples are given to illustrate the effectiveness of the proposed algorithms. Keywords: linear system, block circulant matrix, matrix equation, Woodburry’s formula. 1 Introduction Many problems in practice lead to the solution of linear systems having special coefficient matrices. Tridiagonal block circulant linear systems arise from a finite difference approximation to Poisson’s equa- tion on a rectangular region with periodicity conditions [2, 5], in approximation of periodic functions using splines [1, 10] and etc. It is known that this systems have the form M? x? = f, (1) where M? = ? ??????????? A B B? B? A B B? A . 0 . . . . . . 0 . . . . . B B B? A ? ??????????? , (2) is Hermitian block circulant matrix with block size n. A and B are m×m blockss. Let introduce the following notation x? = {x?i}i=1,...,n, f = {fi}i=1,...,n, where x?i and fi, are block with size m × 1. The purpose of this paper is to develop new algorithms for solving (1) which are based on method proposed in [3]. According to the results obtained in [9] we propose two new algorithms and compare tham with classical LU factorization and Cholesky factorization [6], concerning time for implementa- tion, number of operations and storage memory. Numerical experiments corroborating the theore

文档评论(0)

l215322 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档