资源描述:
《数值分析-7-ludecompositionnew》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库。
1、7.LUDecompositionandMatrixInverse•Gausseliminationisdesignedtosolveasinglesystem[A]{x}={b}.•Itisinefficientwhenwehavesystemswiththesamecoefficients[A]butdifferentright-hand-sideconstants{b}.oWehavetorepeatforwardeliminationandbackwardsubstitutionforeachsystem.oTheresultsoftheforwardeliminati
2、onofthematrix[A]fordifferentsystemsarethesame,whileitisthemostexpensivepartofGausselimination.•Findbetterways7.1LUDecomposition•Separatethetime-consumingeliminationofthematrix[A]fromthemanipulationof{b}.•Multipleright-hand-sidevectors{b}canbeevaluatedinanefficientmanneronce[A]hasbeen“decompo
3、sed”.DecomposeA=LU,whereLisalowertriangularmatrixandUisanuppertriangularmatrix.Then,thesystembecomes:Ax=bL{Ux}=b.Defineanintermediatevectord=Ux.Ld=b.Useforwardsubstitutiontocalculated.Ux=d.Usebackwardsubstitutiontofindx.100L0U1,1U2,1U2,1LU2,1L10L00UULU1,22,12,12,1Ax=LUx=L1,3L
4、2,31L000U2,1LU2,1x=bMMMO0MMMOLLLL1000LUn1,n2,n3,2,1100L0L10L01,2⇒Ld=L1,3L2,31L0d=bforwardsubstitutiontofinddMMMO0LLLL1n1,n2,n3,U1,1U2,1U3,1LU,1n0UULU2,23,2,2n⇒Ux=00U3,3LU,3nx=dbackwardsubstitutiontofindxMMMO000LUn,n-1-7.1.2GaussEliminationas
5、LUDecompositionI)ForwardeliminationinGausselimination)0()0()0()0(100L00a11a12a13La1nm10L000a)1(a)1(La)1(1,222232nmm1L0000a)2(La)2(1,32,3333nA=MMOOM0MMMOMmmmL1M000a(n−)2a(n−)2n−1,1n−2,1n−3,1n−,1n−1n−,1n(n−)1mn1,mn2,mn3,mn4,L10000an,nThesuperscript(n)ina
6、denoteshowmanytimeswechangethecoefficientduringforward(j−)1(j−)1elimination.m=a/afori>jisthepivotelementwheneliminatingxifromthejthi,ji,jj,j)1()1(equation.(m=a/a,m=a/a,m=a/a)1,21,21,11,31,31,12,32,32,2Compactrepresentation)0()0()0()0(aaaLa1112131n)1()1()1(maaLa1,222232nmma)2(La)2(1,3
7、2,3333nA=MMMOMmmma(n−)2a(n−)2n−1,1n−2,1n−3,1n−,1n−1n−,1n(n−)1mn1,mn2,mn3,mn,n−1an,nExamples:214[A]=321133Gausselimination:[A](pivotforrow2is3/2=1.5,andpivotforrow3is½=0.5)21421402−5.1*1=5.01−4*5.1=−5pivotis2.5/0.5=505.0−5