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":"28 1","pages":"17-26"},"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\":\"28 1\",\"pages\":\"17-26\"},\"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}
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.