首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Local refinement techniques for elliptic problems on cell-centered grids
Authors:R E Ewing  R D Lazarov  P S Vassilevski
Institution:(1) Department of Mathematics, University of Wyoming, 82071 Laramie, WY, USA;(2) Institute of Mathematics, Bulgarian Academy of Sciences, Acad. G. Bontchev Str., Block 8, 1113 Sofia, Bulgaria;(3) Center for Informatics and Computer Technology, Bulgarian Academy of Sciences, Acad. G. Bontchev Str., Block 25A, 1113 Sofia, Bulgaria
Abstract:Summary Algebraic multilevel analogues of the BEPS preconditioner designed for solving discrete elliptic problems on grids with local refinement are formulated, and bounds on their relative condition numbers, with respect to the composite-grid matrix, are derived. TheV-cycle and, more generally,v-foldV-cycle multilevel BEPS preconditioners are presented and studied. It is proved that for 2-D problems theV-cycle multilevel BEPS is almost optimal, whereas thev-foldV-cycle algebraic multilevel BEPS is optimal under a mild restriction on the composite cell-centered grid. For thev-fold multilevel BEPS, the variational relation between the finite difference matrix and the corresponding matrix on the next-coarser level is not necessarily required. Since they are purely algebraically derived, thev-fold (v>1) multilevel BEPS preconditioners perform without any restrictionson the shape of subregions, unless the refinement is too fast. For theV-cycle BEPS preconditioner (2-D problem), a variational relation between the matrices on two consecutive grids is required, but there is no restriction on the method of refinement on the shape, or on the size of the subdomains.
Keywords:65F10  65N20  65N30
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号