You are on page 1of 5

CHNG 5: DNG TON PHNG

1, Cc khi nim c bn - nh ngha: Cho n s thc x1, x2, x3,...,xn R F ( x1, x2, x3,...,xn) trong aij l nhng s thc tho mn aij = aji vi mi i, j = 1, 2, 3 ,..,n a11 a12 ... a1n - Ma trn A = a21 a22 ... a2n gi l ma trn ca ... dng ton phng am1 am2 ... amn - A lun l ma trn i xng : A = A - Ch trnh lp ngi ta thng xc nh ma trn A nh sau aii = bii, aij = aji = bij :2 * Ch : Dng ton phng c th vit : F(X) = X.A.X trong X l vct dng , X l vct ct 2, Cc dng ca phng trnh ton phng * Dng chnh tc - nh ngha: Ni dng ton phng c dng chnh tc nu trong aij = 0 vi mi i, j. Ni cch khc l n c dng ng cho chnh - Dng tng qut: F(x1, x2, x3,..., xn) = k1.x1+k2.x2+...+kn.xn - V d: F( x1, x2, x3) = (x1)2 + 2(x2)2 Dng ca ma trn l 1 0 0 0 2 0 0 0 0 * Dng chun tc - nh ngha: Nu trong dng chnh tc trn cc h s ki = 0,1,-1 3, Hng ca ma trn ton phng * nh ngha: cho dng ton phng F c ma trn A. Hng ca dng ton phng F chnh l hng ca ma trn A - Nu A khng suy bin <=> |A| # 0 r(A) = r(A) = n => F cng khng suy bin - Nu A suy bin <=> |A| = 0

r(A) = r(A) < n => F c ng suy bin 4, Gi tr ring v vct ring Cho ma trn A vung cp n, ma trn E vung cp n * a thc : P(k) = A - kE = 0 gi l a thc c trng ca ma trnA bc ca P(k) = n * Nghim ca a thc trn c gi l nghim ring ca A K hiu l : * V d: cho ma trn A 1 2 1 0 3 2 1 1 1 A .E = 1- 2 1 0 3- 2 1 1 1- * V l gi tr ring ca ma trn A <=> tn ti X Rn sao cho (A .E). X = 0 <=> A.X = .X Vc t X tho mn iu kin trn th gi l vc t ring ca ma trn A ng vi gi tr ring xc nh * Nu A l ma trn thc i xng th mi gi tr ring ca A u l s thc * Ma trn A vung cp n gi l trc giao nu tho mn 2 iu kin: - A kh nghch <=> A # 0 - Ma trn nghch o ng = ma trn chuyn v <=> A-1 = A 5, a dng ton phng v dng chnh tc, chun tc * Phng php ga tr ring - Cho dng ton phng F c ma trn A gi s c cc gi tr ring l : k1, k2, k3,...,kn. Khi dng ton phng F c dng chnh tc sau: G (x1, x2,..., xn) = k1.(x1)2 + k2.(x2)2 +...+ kn.(xn)2 - Nhn xt: Dng ton phng Fc nhiu dng chnh tc ( do ghp cc gi tr ring vi x mt cch tu ). Nhng ch c duy nht 1 dng chun tc

Vi n > 2 th vic tm gi tr ring khng d nn phng php ny ch thch hp vi trng hp n khng qu ln v vic tm gi tr ring khng qu phc tp * Phng php Giacobi - Cho A l ma trn vung cp n , A = aij Coi D0 = 1 t D1 = a11 D2 = a11 a12 a21 a22 D3 = a11 a12 a13 a21 a22 a23 a31 a32 a33

F c dng chun tc l : G (x1, x2, x3) = D1 (x1)2 + D2 (x2)2 + D3 (x3)2 D0 D1 D2 -Nhn xt: Ch s dng phng php ny vi s lng n nh iu kin quan trng DI # 0 * Phng php Lagrange - aij .xj . xj ( i # j) : tch cho - Ni dung ca phng php: Thc hin lin tip cc php bin i tuyn tnh mt dn cc tch cho, sau 1 dy hu hn bc th F c dng chnh tc - Chia lm 2 Trng hp: TH1 : nu tn ti aii # 0 , gi s a11 # 0 Khi s dng php bin i sau (php bin i ny khng suy bin) y1 = x1 + a12.x2 + a13.x3 +...+ a1n. xn a11 a11 a11 y2 = x2 y3 = x3 ... y3 = xn

khi F a v dng :F = a11. (y1)2 + G ( y2, y3, ..., yn ) TH2 : nu mi aii = 0, tn ti aij # 0 ( i # j ) gi s a12 # 0 ta s dng php bin i x1 = y1 + y2 x2 = y1 - y2 x3 = y3 ... xn = yn Khi F c dng : a12.(y1)2 - a12 (y2)2 + G ( y1,..,yn) a v TH1 6, Tnh xc nh du thay i du ca dng ton phng Cho dng ton phng : F (X) = X.A.X F (0) = 0 a, nh ngha * Dng ton phng F trn c gi l: Xc nh dng nu F (X) >0 Xc nh m nu F (X) < 0 (vi moi x # 0) Na xc nh dng nu F (X) 0 Na xc nh m nu F (X) 0 Khng xc nh du F (X). F (Y) < 0 * Mnh 1: gi s dng ton phng c dng chnh tc F xc nh Xc nh dng nu ki > 0 Xc nh m nu ki < 0 Na xc nh dng ki 0 tn ti t nht 1 ch s j: kj = 0 Na xc nh m nu ki 0 tn ti t nht 1 ch s j: kj = 0 Khng xc nh du ki .kj < 0

CH : khi vit dng ton phng ta nn vit y cc bin trnh s nhm ln khi xc nh du

* Mnh 2: Cc php bin i tuyn tnh khng suy bin th khng lm thay i tnh xc nh du ca dng ton phng 7, Du hiu nhn bit tnh xc nh du - Du hiu 1: gi s ta dng cc php bin i tuyn tnh khng suy bin a dng ton phng ban u v dng chnh tc khi s dng mnh 1 xt tnh xc nh du - Du hiu 2: nh l SYLVERTER cho dng ton phng F c ma trn A. K hiu DI l cc nh thc con chnh cp con i ca ma trn A. Khi : xc nh dng nu mi Di u dng xc nh m mi nh thc con cp l u m mi nh thc con cp chn u dng

You might also like