{"title":"Overlapping additive Schwarz preconditioners for isotropic elliptic problems with degenerate coefficients","authors":"S. Beuchler, S. V. Nepomnyaschikh","doi":"10.1515/jnum.2007.012","DOIUrl":null,"url":null,"abstract":"The degenerate isotropic boundary value problem –∇(ω2(x)∇u(x, y)) = f(x, y) on the unit square (0, 1)2 is considered in this paper. The weight function is assumed to be of the form ω2(ξ) = ξα, where α ≥ 0. This problem is discretized by piecewise linear finite elements on a triangular mesh of isosceles right triangles. The system of linear algebraic equations is solved by a preconditioned conjugate gradient method using a domain decomposition preconditioner with overlap. Two different preconditioners are presented and the optimality of the condition number for the preconditioned system is proved for α ≠ 1. The preconditioning operation requires O(N) operations, where N is the number of unknowns. Several numerical experiments show the performance of the proposed method.","PeriodicalId":342521,"journal":{"name":"J. Num. Math.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Num. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/jnum.2007.012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The degenerate isotropic boundary value problem –∇(ω2(x)∇u(x, y)) = f(x, y) on the unit square (0, 1)2 is considered in this paper. The weight function is assumed to be of the form ω2(ξ) = ξα, where α ≥ 0. This problem is discretized by piecewise linear finite elements on a triangular mesh of isosceles right triangles. The system of linear algebraic equations is solved by a preconditioned conjugate gradient method using a domain decomposition preconditioner with overlap. Two different preconditioners are presented and the optimality of the condition number for the preconditioned system is proved for α ≠ 1. The preconditioning operation requires O(N) operations, where N is the number of unknowns. Several numerical experiments show the performance of the proposed method.