C. Bacuta, Jinru Chen, Yunqing Huang, Jinchao Xu, L. Zikatanov
{"title":"Stokes问题非匹配网格的单位划分方法","authors":"C. Bacuta, Jinru Chen, Yunqing Huang, Jinchao Xu, L. Zikatanov","doi":"10.1515/156939505774286148","DOIUrl":null,"url":null,"abstract":"We consider the Stokes problem on a plane polygonal domain We propose a finite element method for overlapping or nonmatching grids for the Stokes problem based on the partition of unity method. We prove that the discrete inf-sup condition holds with a constant independent of the overlapping size of the subdomains. The results are valid for multiple subdomains and any spatial dimension.","PeriodicalId":342521,"journal":{"name":"J. Num. Math.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Partition of unity method on nonmatching grids for the Stokes problem\",\"authors\":\"C. Bacuta, Jinru Chen, Yunqing Huang, Jinchao Xu, L. Zikatanov\",\"doi\":\"10.1515/156939505774286148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the Stokes problem on a plane polygonal domain We propose a finite element method for overlapping or nonmatching grids for the Stokes problem based on the partition of unity method. We prove that the discrete inf-sup condition holds with a constant independent of the overlapping size of the subdomains. The results are valid for multiple subdomains and any spatial dimension.\",\"PeriodicalId\":342521,\"journal\":{\"name\":\"J. Num. Math.\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Num. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/156939505774286148\",\"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/156939505774286148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Partition of unity method on nonmatching grids for the Stokes problem
We consider the Stokes problem on a plane polygonal domain We propose a finite element method for overlapping or nonmatching grids for the Stokes problem based on the partition of unity method. We prove that the discrete inf-sup condition holds with a constant independent of the overlapping size of the subdomains. The results are valid for multiple subdomains and any spatial dimension.