基于局部和混合拉格朗日乘子的高级区域分解方法

Jun-young Kwak, Taeyoung Chun, H. Cho, Sang-Joon Shin, O. Bauchau
{"title":"基于局部和混合拉格朗日乘子的高级区域分解方法","authors":"Jun-young Kwak, Taeyoung Chun, H. Cho, Sang-Joon Shin, O. Bauchau","doi":"10.12941/JKSIAM.2014.18.017","DOIUrl":null,"url":null,"abstract":"This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.","PeriodicalId":41717,"journal":{"name":"Journal of the Korean Society for Industrial and Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2014-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ADVANCED DOMAIN DECOMPOSITION METHOD BY LOCAL AND MIXED LAGRANGE MULTIPLIERS\",\"authors\":\"Jun-young Kwak, Taeyoung Chun, H. Cho, Sang-Joon Shin, O. Bauchau\",\"doi\":\"10.12941/JKSIAM.2014.18.017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.\",\"PeriodicalId\":41717,\"journal\":{\"name\":\"Journal of the Korean Society for Industrial and Applied Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2014-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Korean Society for Industrial and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12941/JKSIAM.2014.18.017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Korean Society for Industrial and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12941/JKSIAM.2014.18.017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种改进的面向大规模结构问题的区域分解方法,以提高计算效率。在之前的研究中,我们开发了基于增广拉格朗日公式的区域分解算法,并证明了在串行和并行计算环境下的数值效率。本文采用提出的区域分解方法进行了新的计算分析。为此,在串行计算条件下,将所提算法与双原始FETI方法的计算时间缩短进行了比较。结果表明,所提出的方法显著提高了线性结构问题的计算速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ADVANCED DOMAIN DECOMPOSITION METHOD BY LOCAL AND MIXED LAGRANGE MULTIPLIERS
This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
33.30%
发文量
0
期刊最新文献
A Study on Pupil Detection and Tracking Methods Based on Image Data Analysis GREEN’S FUNCTION APPROACH TO THERMAL DEFLECTION OF A THIN HOLLOW CIRCULAR DISK UNDER AXISYMMETRIC HEAT SOURCE EXISTENCE OF SOLUTION FOR IMPULSIVE FRACTIONAL DIFFERENTIAL EQUATIONS VIA TOPOLOGICAL DEGREE METHOD THE STABILITY OF GAUGE-UZAWA METHOD TO SOLVE NANOFLUID A LOCAL CONSERVATIVE MULTISCALE METHOD FOR ELLIPTIC PROBLEMS WITH OSCILLATING COEFFICIENTS
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1