首页 | 本学科首页   官方微博 | 高级检索  
     检索      

追赶法并行求解循环三对角方程组
引用本文:李文强,刘晓.追赶法并行求解循环三对角方程组[J].科技导报(北京),2009,27(18):90-93.
作者姓名:李文强  刘晓
作者单位:河南师范大学数学与信息科学学院,河南,新乡,453007 
基金项目:河南师范大学青年基金项目 
摘    要:给出了求解循环三对角线性方程组的一种并行算法.在系数矩阵满足对角占优的条件下,利用该方法能够快速、稳定地求解循环三对角线性方程组,在单个进程上的计算量仅为○(17n).与传统算法求解循环三对角线性方程组的计算量相同.而且,本算法可以方便地实施分布式并行计算,各进程仅需向主进程传递8个实数,而主进程向各子进程传递2个实数,通讯量较小.数值实验结果表明:对于大规模的循环三对角线性方程组.利用16个进程计算的并行效率均在0_75以上.求解三对角线性方程组的传统追赶法实则是本文算法的一种特例,因此.该算法也可用于求解三对角线性方程组.

关 键 词:追赶法  循环三对角方程组  并行计算

A Parallel Chasing Algorithm for Solving Cyclic Tridiagonal Equations
LI Wenqiang,LIU Xiao College of Mathematics , Information Science,Henan Normal University,Xinxiang ,Henan Province,China.A Parallel Chasing Algorithm for Solving Cyclic Tridiagonal Equations[J].Science & Technology Review,2009,27(18):90-93.
Authors:LI Wenqiang  LIU Xiao College of Mathematics  Information Science  Henan Normal University  Xinxiang  Henan Province  China
Institution:LI Wenqiang,LIU Xiao College of Mathematics , Information Science,Henan Normal University,Xinxiang 453007,Henan Province,China
Abstract:A parallel algorithm for solving the cyclic tridiagonal equations is developed in this paper. This algorithm is mainly based on the matrix decomposition. Firstly, a lower order cyclic tridiagonal equation can be formed by extracting the first and the last equation in each process. Secondly, the lower order cyclic tridiagonal equation is solved to obtain the values of the key variables. Finally, the values of the key variables are used in the corresponding processes and the related equations are solved in pa...
Keywords:chasing algorithm  cyclic tridiagonal equations  parallel computation  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号