Solution

2𝑥1 + 0𝑥2 + 𝑥3 = 3 … … .1
𝑥1 + 𝑥2 + 3𝑥3 = 5 … … … 2
0𝑥1 + 10𝑥2 + 𝑥3 = 2 … … .3
𝑓𝑟𝑜𝑚 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 1 |2| > |0| + |1| = 1
𝑓𝑟𝑜𝑚 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 2 |1| < |1| + |3| = 4
𝑓𝑟𝑜𝑚 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 3 |1| < |0| + |10| = 10
The equations must be arrangement (equation 2 and equation 3)

2𝑥1 + 0𝑥2 + 𝑥3 = 3 ⟹ |2| > |0| + |1| = 1

0𝑥1 + 10𝑥2 + 𝑥3 = 2 ⟹ |10| > |0| + |1| = 1
𝑥1 + 𝑥2 + 3𝑥3 = 5 ⟹ |3| > |1| + |1| = 2
𝟐 0 1
𝐴 = [0 𝟏𝟎 1]
1 1 𝟑
𝐭𝐡𝐞 𝐦𝐚𝐭𝐫𝐢𝐱 𝐢𝐬 𝐝𝐢𝐚𝐠𝐨𝐧𝐚𝐥 𝐝𝐨𝐦𝐚𝐢𝐧, 𝒕𝒉𝒖𝒔 𝒘𝒆 𝒄𝒂𝒏 𝐮𝐬𝐞 𝐭𝐡𝐞 𝐆𝐚𝐮𝐬𝐬 − 𝐒𝐢𝐞𝐝𝐞𝐥 𝐦𝐞𝐭𝐡𝐨𝐝

𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡𝑜 𝑔𝑒𝑡 𝑥1 1
2𝑥1 + 0𝑥2 + 𝑥3 = 3 ⇒ 𝑥1 = [3 − 𝑥3 ]
2
𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡𝑜 𝑔𝑒𝑡 𝑥2 1
0𝑥1 + 10𝑥2 + 𝑥3 = 2 ⇒ 𝑥2 = [2 − 𝑥3 ]
10
𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡𝑜 𝑔𝑒𝑡 𝑥3 1
𝑥1 + 𝑥2 + 3𝑥3 = 5 ⇒ 𝑥3 = [5 − 𝑥1 − 𝑥2 ]
3
𝑢𝑠𝑒 𝑥 0 (0,0,0)𝑡
First iteration
 1 𝑥3 =0 1 3 3
𝑥10 = [3 − 𝑥3 ] ⇒ [3 − 0] = ∴ 𝑥1 = = 1.5
2 2 2 2
1 𝑥3 =0 1 2 1
𝑥20 = [2 − 𝑥3 ] ⇒ [2 − 0] = = = 0.2 𝑥2 = 0.2
10 10 10 5
1 𝑥1 =1.5,𝑥2 =0.2 1
𝑥30 = [5 − 𝑥1 − 𝑥2 ] ⇒ [5 − 1.5 − 0.2] = 3.3 𝑥3 = 3.3
3 3
1.5
The first numerical solution is [0.2]
3.3
Second iteration
1 𝑥3 =3.3 1
𝑥12 = [3 − 𝑥3 ] ⇒ [3 − 3.3] = −0.15
2 2

1 𝑥3 =3.3 1
𝑥22 = [2 − 𝑥3 ] ⇒ [2 − 3.3] = −0.13
10 10
1 𝑥1 =−0.15;𝑥2 =−0.13 1
𝑥32 = [5 − 𝑥1 − 𝑥2 ] ⇒ [5 + 0.15 + 0.13] = 1.056
3 3
−0.15
The second numerical solution is [−0.13]
1.056
third iteration
1 𝑥3 =1.056 1
𝑥13 = [3 − 𝑥3 ] ⇒ [3 − 1.056] = 0.972
2 2
1 𝑥3 =1.056 1
𝑥23 = [2 − 𝑥3 ] ⇒ [2 − 1.056] = 0.0944
10 10
1 𝑥1 =0.972;𝑥2 =0.0944 1
𝑥33 = [5 − 𝑥1 − 𝑥2 ] ⇒ [5 − 0.972 − 0.0944]
3 3
= 1.3112
0.972
The third numerical solution is [0.0944]
1.3114
n 𝑥1𝑛 𝑥2𝑛 𝑥2𝑛
0 0 0 0
1 1.5 0.2 3.3
2 -0.15 0.13 1.056
3 0.972 0.0944 1.3114
Example1
Find the first three iterations of the Gauss-Seidel method for the
following linear system

Solution
𝑐ℎ𝑒𝑐𝑘
4𝑥1 + 2𝑥2 + 𝑥3 = 11 ⇒ |4| > |2| + |1| = 3
𝑐ℎ𝑒𝑐𝑘
2𝑥1 + 𝑥2 + 4𝑥3 = 16 ⇒ |1| < |2| + |4| = 6
𝑐ℎ𝑒𝑐𝑘
−𝑥1 + 2𝑥2 + 0𝑥3 = 3 ⇒ |0| < |−1| + |2| = 3
Interchange equation 2 and (3).
𝑐ℎ𝑒𝑐𝑘
4𝑥1 + 2𝑥2 + 𝑥3 = 11 ⇒ |4| > |2| + |1| = 3
𝑐ℎ𝑒𝑐𝑘
−𝑥1 + 2𝑥2 + 0𝑥3 = 3 ⇒ |2| > |−1| + |0| = 1
𝑐ℎ𝑒𝑐𝑘
2𝑥1 + 𝑥2 + 4𝑥3 = 16 ⇒ |4| > |2| + |1| = 3
4 2 1
𝐴 = [−1 2 0] 𝐓𝐡𝐞 𝐦𝐚𝐭𝐫𝐢𝐱 𝐢𝐬 𝐝𝐢𝐚𝐠𝐨𝐧𝐚𝐥 𝐝𝐨𝐦𝐚𝐢𝐧
2 1 4
𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡𝑜 𝑔𝑒𝑡 𝑥1 𝟏
4𝑥1 + 2𝑥2 + 𝑥3 = 11 ⇒ 𝒙𝟏 = [𝟏𝟏 − 𝟐𝒙𝟐 − 𝒙𝟑 ]
𝟒
𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡𝑜 𝑔𝑒𝑡 𝑥2 𝟏
−𝑥1 + 2𝑥2 + 0𝑥3 = 3 ⇒ 𝑥2 = [3 + 𝑥1 ]
𝟐
𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡𝑜 𝑔𝑒𝑡 𝑥3 𝟏
2𝑥1 + 𝑥2 + 4𝑥3 = 16 ⇒ 𝒙𝟑 = [𝟏𝟔 − 2𝑥1 − 𝑥2 ]
𝟒

First iteration
𝟏 𝒙𝟐 =𝟏 ; 𝒙𝟑 =𝟏 𝟏
𝒙𝟏 = [𝟏𝟏 − 𝟐𝒙𝟐 − 𝒙𝟑 ] ⇒ [𝟏𝟏 − 𝟐 ∗ 𝟏 − 𝟏 ∗ 𝟏] = 𝟐
𝟒 𝟒
𝟏 𝒙𝟏 =𝟐 𝟏 𝟓
𝑥2 = [3 + 𝑥1 ] ⇒ [3 + 2] = = 𝟐. 𝟓
𝟐 𝟐 𝟐
𝟏 𝑥1 =2;𝑥2 =2.5 𝟏 𝟏𝟗
𝒙𝟑 = [𝟏𝟔 − 2𝑥1 − 𝑥2 ] ⇒ [𝟏𝟔 − 2 ∗ 2 − 2.5] = = 𝟐. 𝟑𝟕𝟓
𝟒 𝟒 𝟖
 2
The first numerical solution is [ 2.5 ]
2.375
second iteration
1 𝒙𝟐 =𝟐.𝟓; 𝒙𝟑 =𝟐.𝟑𝟕𝟓 1 29
𝑥1 = [11 − 2𝑥2 − 𝑥3 ] ⇒ [11 − 2 ∗ 2.5 − 2.375]=
4 4 32
= 0.90625
𝟏 𝒙𝟏 =𝟎.𝟗𝟎𝟔𝟐𝟓 𝟏 𝟏𝟐𝟓
𝑥2 = [3 + 𝑥1 ] ⇒ [𝟑 + 𝟎. 𝟗𝟎𝟔𝟐𝟓] = = 𝟏. 𝟗𝟓𝟑𝟏𝟐𝟓
𝟐 𝟐 𝟔𝟒
𝟏
𝒙𝟑 = [𝟏𝟔 − 2𝑥1 − 𝑥2 ]
𝟒
𝒙𝟏 =𝟎.𝟗𝟎𝟔𝟐𝟓; 𝒙𝟐 =𝟏.𝟗𝟓𝟑𝟏𝟐𝟓 𝟏 783
⇒ [𝟏𝟔 − 2(0.90625) − 1.953125] = = 3.0586
𝟒 256
0.90625
The second numerical solution is [ 1.9531 ]
3.0586
Third iteration
1
𝑥1 = [11 − 2𝑥2 − 𝑥3 ]
4
𝒙𝟐 =𝟏.𝟗𝟓𝟑𝟏; 𝒙𝟑 =𝟑.𝟎𝟓𝟖𝟔 1 𝟏𝟐𝟓 783 𝟏𝟎𝟑𝟑
⇒ [11 − 2 ∗ − ]= = 1.0088
4 𝟔𝟒 256 𝟏𝟎𝟐𝟒

𝟏 𝒙𝟏 =𝟏.𝟎𝟎𝟖𝟖 𝟏 1033 𝟒𝟏𝟎𝟓

𝑥2 = [3 + 𝑥1 ] ⇒ [3 + ]= = 𝟐. 𝟎𝟎𝟒𝟒
𝟐 𝟐 1024 𝟐𝟎𝟒𝟖
𝟏𝟎𝟑𝟑 𝟒𝟏𝟎𝟓
𝟏 𝒙𝟏 = ;𝒙 =
𝟏𝟎𝟐𝟒 𝟐 𝟐𝟎𝟒𝟖 𝟏 1033 𝟒𝟏𝟎𝟓
𝒙𝟑 = [𝟏𝟔 − 2𝑥1 − 𝑥2 ] ⇒ [𝟏𝟔 − 2 ∗ − ] = 𝟏. 𝟖𝟖𝟕
𝟒 𝟒 1024 𝟐𝟎𝟒𝟖
n 𝑥1𝑛 𝑥2𝑛 𝑥3𝑛
0 1 1 1
1 2 2.5 2.375
2 0.90625 1.9531 3.0586
3 1.0088 𝟐. 𝟎𝟎𝟒𝟒 𝟏. 𝟖𝟖𝟕
Example 2
Find the sixth iterations of the Gauss-Seidel method for the following
linear system
𝑢𝑠𝑒 𝑥 0 (0,0,0)𝑡
𝟑𝒙𝟏 + 𝒙𝟐 + 𝟓𝒙𝟑 = 𝟏𝟑 … … … … … … . 𝟏
𝟓𝒙𝟏 − 𝟐𝒙𝟐 + 𝒙𝟑 = 𝟒 … … … … … … … 𝟐
𝒙𝟏 + 𝟔𝒙𝟐 − 𝟐𝒙𝟑 = −𝟏 … … … … … . … 𝟑
𝒄𝒉𝒆𝒄𝒌 𝐝𝐢𝐚𝐠𝐨𝐧𝐚𝐥 𝐝𝐨𝐦𝐚𝐢𝐧

𝟑𝒙𝟏 + 𝒙𝟐 + 𝟓𝒙𝟑 = 𝟏𝟑 ⟹ |𝟑| < |𝟏| + |𝟓| = 𝟔

𝟓𝒙𝟏 − 𝟐𝒙𝟐 + 𝒙𝟑 = 𝟒 ⟹ |−𝟐| < |𝟓| + |𝟏| = 𝟔
𝒙𝟏 + 𝟔𝒙𝟐 − 𝟐𝒙𝟑 = −𝟏 ⟹ |−𝟐| < |𝟔| + |𝟏| = 𝟕
Arrange the equations as follows
𝟓𝒙𝟏 − 𝟐𝒙𝟐 + 𝒙𝟑 = 𝟒 ⟹ |𝟓| > |−𝟐||𝟏| = 𝟑
𝒙𝟏 + 𝟔𝒙𝟐 − 𝟐𝒙𝟑 = −𝟏 ⟹ |𝟔| > |𝟏| + |𝟐| = 𝟑
𝟑𝒙𝟏 + 𝒙𝟐 + 𝟓𝒙𝟑 = 𝟏𝟑 ⟹ |𝟓| > |𝟑| + |𝟏| = 𝟒
5 −2 1
𝐴 = [1 6 −2] 𝐓𝐡𝐞 𝐦𝐚𝐭𝐫𝐢𝐱 𝐢𝐬 𝐝𝐢𝐚𝐠𝐨𝐧𝐚𝐥 𝐝𝐨𝐦𝐚𝐢𝐧
3 1 5
𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡𝑜 𝑔𝑒𝑡 𝑥1 1
𝟓𝒙𝟏 − 𝟐𝒙𝟐 + 𝒙𝟑 = 𝟒 ⇒ 𝑥1 = [4 + 𝟐𝒙𝟐 − 𝒙𝟑 ]
5
𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡𝑜 𝑔𝑒𝑡 𝑥2 1
𝒙𝟏 + 𝟔𝒙𝟐 − 𝟐𝒙𝟑 = −𝟏 ⇒ 𝒙𝟐 = [−𝟏 − 𝒙𝟏 + 𝟐𝒙𝟑 ]
6
𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡𝑜 𝑔𝑒𝑡 𝑥3 1
𝟑𝒙𝟏 + 𝒙𝟐 + 𝟓𝒙𝟑 = 𝟏𝟑 ⇒ 𝒙𝟑 = [13 − 𝟑𝒙𝟏 − 𝒙𝟐 ]
5
First iteration
1 𝒙𝟐 =0;𝒙𝟑 =𝟎 1 4
𝑥1 = [4 + 𝟐𝒙𝟐 − 𝒙𝟑 ] ⇒ [4 + 𝟎 − 𝟎]= = 0.8
5 5 5
1 𝒙𝟏 =0.8;𝒙𝟑 =𝟎 1 3
𝒙𝟐 = [−𝟏 − 𝒙𝟏 + 𝟐𝒙𝟑 ] ⇒ [−𝟏 − 𝟎. 𝟖 + 𝟎] = − = −0.3
6 6 10
𝟏 𝒙𝟏 =𝟎.𝟖;𝒙𝟐 =𝟎.𝟑 𝟏 𝟏𝟎𝟗
𝒙𝟑 = [𝟏𝟑 − 𝟑𝒙𝟏 − 𝒙𝟐 ] ⇒ [𝟏𝟑 − 𝟑(𝟎. 𝟖) − (−𝟎. 𝟑)] = = 𝟐. 𝟏𝟖
𝟓 𝟓 𝟓𝟎
second iteration
𝟏 𝒙𝟐 =−𝟎.𝟑;𝒙𝟑 =𝟐.𝟏𝟖 𝟏 𝟔𝟏
𝒙𝟏 = [𝟒 + 𝟐𝒙𝟐 − 𝒙𝟑 ] ⇒ [𝟒 + 𝟐(−𝟎. 𝟑) − 𝟐. 𝟏𝟖] = = 𝟎. 𝟐𝟒𝟒
𝟓 𝟓 𝟐𝟓𝟎
 𝟏 𝒙𝟏 =𝟎.𝟐𝟒𝟒;𝒙𝟑 =𝟐.𝟏𝟖 𝟏 𝟕𝟕𝟗
𝒙𝟐 = [−𝟏 − 𝒙𝟏 + 𝟐𝒙𝟑 ] ⇒ [−𝟏 − 𝟎. 𝟐𝟒𝟒 + 𝟐(𝟐. 𝟏𝟖)] = = 𝟎. 𝟓𝟏𝟗𝟑
𝟔 𝟔 𝟏𝟓𝟎𝟎
𝟏 𝒙𝟏 =𝟎.𝟐𝟒𝟒; 𝒙𝟐 =𝟎.𝟓𝟏𝟗𝟑 𝟏
𝒙𝟑 = [𝟏𝟑 − 𝟑𝒙𝟏 − 𝒙𝟐 ] ⇒ [𝟏𝟑 − 𝟑(𝟎. 𝟐𝟒𝟒) − 𝟎. 𝟓𝟏𝟗𝟑] = 𝟐. 𝟑𝟒𝟗𝟕
𝟓 𝟓

Third iteration
𝟏 𝒙𝟐 =𝟎.𝟓𝟏𝟗𝟑; 𝒙𝟑 =𝟐.𝟑𝟒𝟗𝟕𝟒 𝟏
𝒙𝟏 = [𝟒 + 𝟐𝒙𝟐 − 𝒙𝟑 ] ⇒ [𝟒 + 𝟐(𝟎. 𝟓𝟏𝟗𝟑) − 𝟐. 𝟑𝟒𝟗𝟕𝟒] = 𝟎. 𝟓𝟑𝟕𝟕
𝟓 𝟓
𝟏 𝒙𝟏 =𝟎.𝟓𝟑𝟕𝟕; 𝒙𝟑 =𝟐.𝟑𝟒𝟗𝟕𝟒 𝟏
𝒙𝟐 = [−𝟏 − 𝒙𝟏 + 𝟐𝒙𝟑 ] ⇒ [−𝟏 − 𝟎. 𝟓𝟑𝟕𝟕 + 𝟐(𝟐. 𝟑𝟒𝟗𝟕𝟒)] = 𝟎. 𝟓𝟐𝟔𝟗
𝟔 𝟔
𝟏 𝒙𝟏 =𝟎.𝟓𝟑𝟕𝟕; 𝒙𝟐 =𝟎.𝟓𝟐𝟔𝟗 𝟏
𝒙𝟑 = [𝟏𝟑 − 𝟑𝒙𝟏 − 𝒙𝟐 ] ⇒ [𝟏𝟑 − 𝟑(𝟎. 𝟓𝟑𝟕𝟕) − 𝟎. 𝟓𝟐𝟔𝟗] = 𝟐. 𝟏𝟕𝟏𝟗𝟖𝟕
𝟓 𝟓

Fourth iteration
𝟏 𝒙𝟐 =𝟎.𝟓𝟐𝟔𝟗; 𝒙𝟑 =𝟐.𝟏𝟕𝟏𝟗𝟖𝟕 𝟏
𝒙𝟏 = [𝟒 + 𝟐𝒙𝟐 − 𝒙𝟑 ] ⇒ [𝟒 + 𝟐(𝟎. 𝟓𝟐𝟔𝟗) − 𝟐. 𝟏𝟕𝟏𝟗𝟖𝟕 ] = 𝟎. 𝟓𝟕𝟔𝟑𝟔𝟐𝟔
𝟓 𝟓
≅ 𝟎. 𝟓𝟕𝟔𝟒
𝟏 𝒙𝟏 =𝟎.𝟓𝟕𝟔𝟑𝟔𝟐𝟔; 𝒙𝟑 =𝟐.𝟏𝟕𝟏𝟗𝟖𝟕 𝟏
𝒙𝟐 = [−𝟏 − 𝒙𝟏 + 𝟐𝒙𝟑 ] ⇒ [−𝟏 − 𝟎. 𝟓𝟕𝟔𝟑𝟔𝟐𝟔 + 𝟐(𝟐. 𝟏𝟕𝟏𝟗𝟖𝟕)] = 𝟎. 𝟒𝟔𝟏𝟐𝟖𝟓𝟔𝟔𝟕
𝟔 𝟔
𝟏 𝒙𝟏 =𝟎.𝟓𝟕𝟔𝟑𝟔𝟐𝟔; 𝒙𝟐 =𝟎.𝟒𝟔𝟏𝟐𝟖𝟓𝟔𝟔𝟕 𝟏
𝒙𝟑 = [𝟏𝟑 − 𝟑𝒙𝟏 − 𝒙𝟐 ] ⇒ [𝟏𝟑 − 𝟑(𝟎. 𝟓𝟕𝟔𝟑𝟔𝟐𝟔) − 𝟎. 𝟒𝟔𝟏𝟐𝟖𝟓𝟔𝟔𝟕]
𝟓 𝟓
= 𝟐. 𝟏𝟔𝟏𝟗𝟐𝟖𝟕𝟐𝟕
Fifth iteration
𝟏 𝒙𝟐 =𝟎𝟎.𝟒𝟔𝟏𝟐𝟖𝟓𝟔𝟔𝟕; 𝒙𝟑 =𝟐.𝟏𝟔𝟏𝟗𝟐𝟖𝟕𝟐𝟕 𝟏
𝒙𝟏 = [𝟒 + 𝟐𝒙𝟐 − 𝒙𝟑 ] ⇒ [𝟒 + 𝟐(𝟎. 𝟒𝟔𝟏𝟐𝟖𝟓𝟔𝟔𝟕) − 𝟐. 𝟏𝟔𝟏𝟗𝟐𝟖𝟕𝟐𝟕]
𝟓 𝟓
= 𝟎. 𝟓𝟓𝟐𝟏𝟐𝟖𝟓𝟐𝟏𝟒
𝟏 𝒙𝟏 =𝟎.𝟓𝟓𝟐𝟏𝟐𝟖𝟓𝟐𝟏𝟒; 𝒙𝟑 =𝟐.𝟏𝟔𝟏𝟗𝟐𝟖𝟕𝟐𝟕 𝟏
𝒙𝟐 = [−𝟏 − 𝒙𝟏 + 𝟐𝒙𝟑 ] ⇒ [−𝟏 − 𝟎. 𝟓𝟓𝟐𝟏𝟐𝟖𝟓𝟐𝟏𝟒
𝟔 𝟔
+ 𝟐(𝟐. 𝟏𝟔𝟏𝟗𝟐𝟖𝟕𝟐𝟕)] = 𝟎. 𝟒𝟔𝟏𝟗𝟓𝟒𝟖𝟐𝟐𝟏
𝟏
𝒙𝟑 = [𝟏𝟑 − 𝟑𝒙𝟏 − 𝒙𝟐 ]
𝟓
𝒙𝟏 =𝟎.𝟓𝟓𝟐𝟏𝟐𝟖𝟓𝟐𝟏𝟒; 𝒙𝟐 =𝟎.𝟒𝟔𝟏𝟗𝟓𝟒𝟖𝟐𝟐𝟏 𝟏
⇒ [𝟏𝟑 − 𝟑(𝟎. 𝟓𝟓𝟐𝟏𝟐𝟖𝟓𝟐𝟏𝟒) − 𝟎. 𝟒𝟔𝟏𝟗𝟓𝟒𝟖𝟐𝟐𝟏]
𝟓
= 𝟐. 𝟏𝟖𝟓𝟑𝟑𝟕𝟏𝟒𝟐

Sixth iteration
𝟏 𝒙𝟐 =𝟎.𝟒𝟔𝟏𝟗𝟓𝟒𝟖𝟐𝟐𝟏; 𝒙𝟑 =𝟐.𝟏𝟖𝟓𝟑𝟑𝟕𝟏𝟒𝟐 𝟏
𝒙𝟏 = [𝟒 + 𝟐𝒙𝟐 − 𝒙𝟑 ] ⇒ [𝟒 + 𝟐(𝟎. 𝟒𝟔𝟏𝟗𝟓𝟒𝟖𝟐𝟐𝟏) − 𝟐. 𝟏𝟖𝟓𝟑𝟑𝟕𝟏𝟒𝟐]
𝟓 𝟓
= 𝟎. 𝟓𝟒𝟕𝟕𝟏𝟒𝟓𝟎𝟎𝟒
𝟏 𝒙𝟏 =𝟎.𝟓𝟒𝟕𝟕𝟏𝟒𝟓𝟎𝟎𝟒; 𝒙𝟑 =𝟐.𝟏𝟖𝟓𝟑𝟑𝟕𝟏𝟒𝟐 𝟏
𝒙𝟐 = [−𝟏 − 𝒙𝟏 + 𝟐𝒙𝟑 ] ⇒ [−𝟏 − 𝟎. 𝟓𝟒𝟕𝟕𝟏𝟒𝟓𝟎𝟎𝟒
𝟔 𝟔
+ 𝟐(𝟐. 𝟏𝟖𝟓𝟑𝟑𝟕𝟏𝟒𝟐)] = 𝟎. 𝟒𝟕𝟎𝟒𝟗𝟑𝟐𝟗𝟕𝟑
𝟏
𝒙𝟑 = [𝟏𝟑 − 𝟑𝒙𝟏 − 𝒙𝟐 ]
𝟓
𝒙𝟏 =𝟎.𝟓𝟒𝟕𝟕𝟏𝟒𝟓𝟎𝟎𝟒; 𝒙𝟐 =𝟎.𝟒𝟕𝟎𝟒𝟗𝟑𝟐𝟗𝟕𝟑 𝟏
⇒ [𝟏𝟑 − 𝟑(𝟎. 𝟓𝟒𝟕𝟕𝟏𝟒𝟓𝟎𝟎𝟒) − 𝟎. 𝟒𝟕𝟎𝟒𝟗𝟑𝟐𝟗𝟕𝟑]
𝟓
= 𝟐. 𝟏𝟕𝟕𝟐𝟕𝟐𝟔𝟒
n 𝑥1𝑛 𝑥2𝑛 𝑥3𝑛
0 0 0 0
1 0.8 -0.3 2.18
2 𝟎. 𝟐𝟒𝟒 𝟎. 𝟓𝟏𝟗 𝟐. 𝟑𝟓𝟎
3 𝟎. 𝟓𝟑𝟖 𝟎. 𝟓𝟐𝟕 𝟐. 𝟏𝟕𝟏
4 0.576 0.461 2.162
5 0.552 0.462 2.185
6 0.548 𝟎. 𝟒𝟕𝟏 2.177