内罚法多网格算法的收敛性

Applied Numerical Analysis & Computational Mathematics Pub Date : 2005-04-12 DOI:10.1002/anac.200410019

Susanne C. Brenner, Jie Zhao

{"title":"内罚法多网格算法的收敛性","authors":"Susanne C. Brenner, Jie Zhao","doi":"10.1002/anac.200410019","DOIUrl":null,"url":null,"abstract":"V-cycle, F-cycle and W-cycle multigrid algorithms for interior penalty methods for second order elliptic boundary value problems are studied in this paper. It is shown that these algorithms converge uniformly with respect to all grid levels if the number of smoothing steps is sufficiently large, and that the contraction numbers decrease as the number of smoothing steps increases, at a rate determined by the elliptic regularity of the problem. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"2 1","pages":"3-18"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200410019","citationCount":"72","resultStr":"{\"title\":\"Convergence of Multigrid Algorithms for Interior Penalty Methods\",\"authors\":\"Susanne C. Brenner, Jie Zhao\",\"doi\":\"10.1002/anac.200410019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"V-cycle, F-cycle and W-cycle multigrid algorithms for interior penalty methods for second order elliptic boundary value problems are studied in this paper. It is shown that these algorithms converge uniformly with respect to all grid levels if the number of smoothing steps is sufficiently large, and that the contraction numbers decrease as the number of smoothing steps increases, at a rate determined by the elliptic regularity of the problem. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)\",\"PeriodicalId\":100108,\"journal\":{\"name\":\"Applied Numerical Analysis & Computational Mathematics\",\"volume\":\"2 1\",\"pages\":\"3-18\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1002/anac.200410019\",\"citationCount\":\"72\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Numerical Analysis & Computational Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/anac.200410019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Numerical Analysis & Computational Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/anac.200410019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 72

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Convergence of Multigrid Algorithms for Interior Penalty Methods

V-cycle, F-cycle and W-cycle multigrid algorithms for interior penalty methods for second order elliptic boundary value problems are studied in this paper. It is shown that these algorithms converge uniformly with respect to all grid levels if the number of smoothing steps is sufficiently large, and that the contraction numbers decrease as the number of smoothing steps increases, at a rate determined by the elliptic regularity of the problem. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Applied Numerical Analysis & Computational Mathematics

自引率

0.00%

发文量