文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > TR2005-862 THREE-LEVEL BDDC IN THREE DIMENSIONS
侵权投诉

TR2005-862 THREE-LEVEL BDDC IN THREE DIMENSIONS

Abstract. BDDC methods are nonoverlapping iterative substructuring domain decomposition methods for the solution of large sparse linear algebraic systems arising from discretization of elliptic boundary value problems. Its coarse problem is given by a smal

TR2005-862

THREE-LEVELBDDCINTHREEDIMENSIONS

XUEMINTU

Abstract.BDDCmethodsarenonoverlappingiterativesubstructuringdomaindecompositionmethodsforthesolutionoflargesparselinearalgebraicsystemsarisingfromdiscretizationofellipticboundaryvalueproblems.Itscoarseproblemisgivenbyasmallnumberofcontinuityconstraintswhichareenforcedacrosstheinterface.Thecoarseproblemmatrixisgeneratedandfactoredbydirectsolversatthebeginningofthecomputationanditcanultimatelybecomeabottleneck,ifthenumberofsubdomainsisverylarge.Inthispaper,twothree-levelBDDCmethodsareintroducedforsolvingthecoarseproblemapproximatelyinthreedimensions.Thisisanextensionofpreviousworkforthetwodimensionalcaseandsincevertexconstraintsalonedonotsu cetoobtainpolylogarithmicconditionnumberbound,edgeconstraintsareconsideredinthispaper.Somenewtechnicaltoolsarethenneededintheanalysisandthismakesthethreedimensionalcasemorecomplicatedthanthetwodimensionalcase.Estimatesoftheconditionnumbersareprovidedfortwothree-levelBDDCmethodsandnumericalexperimentsarealsodiscussed.

Keywords.BDDC,three-level,threedimensions,domaindecomposition,coarseproblem,conditionnumber,Chebysheviteration

AMSsubjectclassi cations.65N30,65N55

1.Introduction.BDDC(BalancingDomainDecompositionbyConstraints)methods,whichwereintroducedandanalyzedin[3,7,8],aresimilartothebalancingNeumann-Neumannalgorithms.However,thecoarseproblem,inaBDDCalgorithm,isgivenintermsofasetofprimalconstraintsandthematrixofthecoarseproblemisgeneratedandfactoredbyusingdirectsolversatthebeginningofthecomputation.Wenotethattherearenowcomputersystemswithmorethan100,000powerfulpro-cessors,whichallowverylargeanddetailedsimulations.Thecoarsecomponentofatwo-levelpreconditionercanthereforebeabottleneckifthenumberofsubdomainsisverylarge.Onewaytoremovethisdi cultyistointroduceoneormoreadditionallevels.Inourrecentpaper[11],twothree-levelBDDCmethodswereintroducedfortwodimensionalproblemswithvertexconstraints.Wesolvethecoarseproblemap-proximately,byusingtheBDDCidearecursively,whileagoodrateofconvergencestillcanbemaintained.However,inthreedimensionalspace,vertexconstraintsalonearenotenoughtoobtaingoodpolylogarithmicconditionnumberboundduetomuchweakerinterpolationestimateandconstraintsontheaveragesoveredgesorfacesareneeded.Thenewconstraintsleadtoaconsiderablymorecomplicatedcoarseproblemandtheneedfornewtechnicaltoolsintheanalysis.Inthispaper,weextendthetwothree-levelBDDCmethodsin[11]tothethreedimensionalcaseusingprimaledgeaverageconstraints.Withthehelpofthenewtechnicaltools,weprovideestimatesoftheconditionnumberboundsofthesystemwiththesetwonewpreconditioners.

Therestofthepaperisorganizedasfollows.We rstreviewthetwo-levelBDDCmethodsbrie yinSection2.Weintroduceour rstthree-levelBDDCmethodandthe

1inSection3.WegivesomeauxiliaryresultsinSec-correspondingpreconditionerM

tion4.InSection5,weprovideanestimateoftheconditionnumberboundforthesys- 2 1 temwiththepreconditionerMwhichisoftheformC1+logH,

h

,H,andharetypicaldiametersofthesubregions,subdomains,andelements,whereH

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email