IMECH-IR  > 流固耦合系统力学重点实验室
基于模型减缩的并行共轭梯度算法研究
Alternative TitleModel Reduction-Based Parallel Conjugate Gradient Method
聂雪媛; 丁桦
Source Publication力学季刊
2012-06-25
Volume33Issue:2Pages:275-280
ISSN0254-0053
Abstract有限元并行计算被应用于求解大规模工程问题。为进一步提高计算效率,将模型减缩方法引入到并行计算区域划分步骤中,采用共轭梯度法,推导了适用于分布式并行环境的模型减缩并行算法。该方法在模型减缩的基础上,将边界节点进一步分为"本地节点"和"共享节点",各任务处理器仅交换"共享节点"相关数据,降低了数据交换量,同时仅保存降阶后的区域矩阵,减少了内存存储。编制了MPI并行计算程序,并通过算例对该方法和普通有限元并行方法进行了比较,验证了算法的有效性。
Other AbstractThe finite element parallel computation is applied to analysis of large-scale engineering problems.To make further improvement of computation efficiency,the model reduction method was employed in the procedure of parallel computation domain decomposition,then the parallel computation method with conjugate gradient arithmetic was derived for distributed parallel environment.The method divides the boundary nodes of one domain into "local nodes" and "common nodes" and only the data about "common nodes" are exc...
Keyword模型减缩 并行计算 区域划分 共轭梯度法
Subject Area计算固体力学
URL查看原文
Indexed ByCSCD
Language中文
CSCD IDCSCD:4567536
Department流固耦合系统力学重点实验室
Citation statistics
Document Type期刊论文
Identifierhttp://dspace.imech.ac.cn/handle/311007/46481
Collection流固耦合系统力学重点实验室
Corresponding Author聂雪媛
Recommended Citation
GB/T 7714
聂雪媛,丁桦. 基于模型减缩的并行共轭梯度算法研究[J]. 力学季刊,2012,33(2):275-280.
APA 聂雪媛,&丁桦.(2012).基于模型减缩的并行共轭梯度算法研究.力学季刊,33(2),275-280.
MLA 聂雪媛,et al."基于模型减缩的并行共轭梯度算法研究".力学季刊 33.2(2012):275-280.
Files in This Item: Download All
File Name/Size DocType Version Access License
C2012J-076.pdf(345KB) 开放获取--View Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[聂雪媛]'s Articles
[丁桦]'s Articles
Baidu academic
Similar articles in Baidu academic
[聂雪媛]'s Articles
[丁桦]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[聂雪媛]'s Articles
[丁桦]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: C2012J-076.pdf
Format: Adobe PDF
This file does not support browsing at this time
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.