{"title":"Morley元的顶点空间预条件的构造","authors":"Jianguo Huang","doi":"10.1515/JNMA.2001.295","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, based on a specially chosen domain decomposition, we construct an overlapping additive Schwarz preconditioner according to the framework of [Brenner, Numer. Math. 72: 419–447, 1996] for the Morley element and show that its condition number is optimal; we analyze in details the structure of this preconditioner, and after proper choices of inexact solvers, we obtain a vertex space preconditioner for the Morley element. Compared with the preconditioners constructed in [Huang, J. Comp. Math. 17: 615–628, 1999, Shi and Xie, J. Comp. Math. 16: 289–304, 1998, Xie, Domain Decomposition and Multigrid Methods for Nonconforming Plate Elements, Chinese Academy of Sciences, 1998], this preconditioner has some advantages, i.e., the computational cost adds little, but the condition number improves greatly.","PeriodicalId":342521,"journal":{"name":"J. Num. Math.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the construction of a vertex space preconditioner for Morley element\",\"authors\":\"Jianguo Huang\",\"doi\":\"10.1515/JNMA.2001.295\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this paper, based on a specially chosen domain decomposition, we construct an overlapping additive Schwarz preconditioner according to the framework of [Brenner, Numer. Math. 72: 419–447, 1996] for the Morley element and show that its condition number is optimal; we analyze in details the structure of this preconditioner, and after proper choices of inexact solvers, we obtain a vertex space preconditioner for the Morley element. Compared with the preconditioners constructed in [Huang, J. Comp. Math. 17: 615–628, 1999, Shi and Xie, J. Comp. Math. 16: 289–304, 1998, Xie, Domain Decomposition and Multigrid Methods for Nonconforming Plate Elements, Chinese Academy of Sciences, 1998], this preconditioner has some advantages, i.e., the computational cost adds little, but the condition number improves greatly.\",\"PeriodicalId\":342521,\"journal\":{\"name\":\"J. Num. Math.\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Num. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/JNMA.2001.295\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Num. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/JNMA.2001.295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the construction of a vertex space preconditioner for Morley element
Abstract In this paper, based on a specially chosen domain decomposition, we construct an overlapping additive Schwarz preconditioner according to the framework of [Brenner, Numer. Math. 72: 419–447, 1996] for the Morley element and show that its condition number is optimal; we analyze in details the structure of this preconditioner, and after proper choices of inexact solvers, we obtain a vertex space preconditioner for the Morley element. Compared with the preconditioners constructed in [Huang, J. Comp. Math. 17: 615–628, 1999, Shi and Xie, J. Comp. Math. 16: 289–304, 1998, Xie, Domain Decomposition and Multigrid Methods for Nonconforming Plate Elements, Chinese Academy of Sciences, 1998], this preconditioner has some advantages, i.e., the computational cost adds little, but the condition number improves greatly.