学科分类
/ 1
1 个结果
  • 简介:TheGalerkinandleast-squaresmethodsaretwoclassesofthemostpopularKrylovsubspacemethOdsforsolvinglargelinearsystemsofequations.Unfortunately,boththemethodsmaysufferfromseriousbreakdownsofthesametype:InabreakdownsituationtheGalerkinmethodisunabletocalculateanapproximatesolution,whiletheleast-squaresmethod,althoughdoesnotreallybreakdown,isunsucessfulinreducingthenormofitsresidual.Inthispaperwefrstestablishaunifiedtheoremwhichgivesarelationshipbetweenbreakdownsinthetwometh-ods.Wefurtherillustratetheoreticallyandexperimentallythatifthecoefficientmatrixofalienarsystemisofhighdefectivenesswiththeassociatedeigenvalueslessthan1,thentherestart-edGalerkinandleast-squaresmethodswillbeingreatrisksofcompletebreakdowns.Itappearsthatourfindingsmayhelptounderstandphenomenaobservedpracticallyandtoderivetreat-mentsforbreakdownsofthistype.

  • 标签: large linear systems iterative methods Krylov