文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 工程科技 > 电力/水利 > a fast algebraic multigrid preconditioned conjugate gradient solver
侵权投诉

a fast algebraic multigrid preconditioned conjugate gradient solver

代数 多重网格 有限元

F.H.Pereiraetal./AppliedMathematicsandComputation179(2006)344–351345

Inthiswork,wepresentanewapproachtoselectthecoarsegridsthatallowstheuseoftheAMGasapreconditionerfortheCGmethodforsmallandmediumproblems.Thisapproachleadstoasigni cantreduc-tionofthematrixdimensionatalllevelswithoutlosingtherobustness.

Thepaperisorganizedasfollows.InSection2wegiveabriefoverviewofthebasicAMGalgorithm,detailingthecoarseningprocessinSection3.InSections4and5,thetestcasesandthenumericalresultsarepresented,comparingtheperformanceoftheAMGwiththatofincompleteCholeskymethodinthepreconditioningoftheill-conditionedmatrices.Finally,someconclusionsareformulatedinSection6.

2.Thealgebraicmultigrid

InthissectionwegiveanoutlineofthebasicprinciplesofAMG,andde nesometerminologyandnota-tion.Detailedexplanationsmaybefoundin[3].Consideraproblemoftheform

Au¼f;

ð1Þ

whereAisann·nmatrixwithentriesaij.ForAMG,a‘‘grid’’issimplyasetofindicesofthevariables,sotheoriginalgridisdenotedbyxk={1,2,...,n}withk=1.

Inanymultigridmethod,thecentralideaisthaterrore,thatisnoteliminatedbyrelaxation,mustberemovedbycoarse-gridcorrection.ThisisdonebysolvingtheresidualequationAe=ronacoarsergrid,theninterpolatingtheerrorbackto negridandusingittocorrectthe ne-gridapproximationbyu u+e.Thecoarse-gridproblemitselfissolvedbyarecursiveapplicationofthismethod[7–11].

TheAMGexplorestheuseofmanylevelstoeliminatetheerrorcomponentsthatarenote cientlyremovedbyrelaxation[2,3].Inthisway,thecoarsestgridproblembecomessu cientlysmalltobesolvedbyadirectsolver.

Usingsubscriptstoindicatelevelnumber,whereMdenotesthenumberoflevelsand1isthe nestlevelsothatA1=A,theAMGalgorithmconsistsofthefollowingcomponents[3,5]:

kkk

Coarsening:de nethesplittingxk¼xkC[xFofxkintosetsofcoarseand negridnodesxCandxF,respectively.

Transferoperators:

prolongationrestriction

Pk:Vkþ1!Vk;

Rk¼PTk.

ð2Þ

De nitionofthematrixhierarchy:

Akþ1¼RkAkPk.

Appropriatesmoother:basiciterativemethod.

Themostimportantissuetobediscussedistheconstructionofthematrixhierarchyandtheprolongation

operator,i.e.,thesetupphase[3,4].Thisphaseisexplainedasfollows:AMGsetupphase:1.Setk=1andA1=A.

k

2.PartitionxkintodisjointsetsxkCandxF

(a)Setxkþ1¼xkC.

(b)De neinterpolationPk.3.SetRk¼PTkandAk+1=RkAkPk.

4.Ifxk+1issmallenough,setM=k+1andstop.Otherwise,setk=k+1andgotostep2.

Step2isthecoreoftheAMGsetupprocessandisdetailedinthefollowingsection.Oncethesetupphaseiscompletedandallthesecomponentsarede ned,therecursivelyde nedmultigridV(l1,l2)-cycle,whichisusedhereasapreconditionerfortheCGmethod,canbeperformedasfollows:

ð3Þ

上一页第2页

你可能喜欢

热门文档

相关文档

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