3. Secant Method f (xn )(xn−1 − xn ) xn+1 = xn − (5) f (xn−1 ) − f (xn )
1 2 Iterative Polynomial Function Techniques 2.1 Muller’s Method 2cn xn+1 = xn + p (6) bn ± bn 2 − 4an cn Note: ! if bn > 0, the sign should be positive. ! if bn < 0, the sign should be negative.
2 3 Solutions to Linear Equations (Direct Methods) The system of linear equations:
a1 x + b1 y + c1 z = d1 a2 x + b2 y + c2 z = d2 a3 x + b3 y + c3 z = d3 can be expressed as a matrix, as shown below: a1 b1 c1 x d1 a2 b2 c2 y = d2 (7) a3 b3 c3 z d3 a1 b1 c1 A = a2 b2 c2 (8) a3 b3 c3 x x = y (9) z d1 B = d2 (10) d3
3 Given the matrix above, it can be expressed as an augmented ma- trix, as shown below: a1 b1 c1 d1 a2 b2 c2 d2 (11) a3 b3 c3 d3
3.1 Cramer’s Rule
As shown in Equation 7, the solution can be obtained via:
To get the solutions for the system of linear equations, we can follow the formula: x = A−1 · B (13) where A, x, B are defined in Equations 8, 9 and 10, respectively.
4 The steps in finding A−1 or the inverse of matrix A are as follows: 1. Convert the given matrix into its cofactor matrix. Let: C11 C12 C13 C = C21 C22 C23 Cij = (−1)ij Mij C31 C32 C33 e.g. b2 c2 C11 = (−1)2 M11 = (−1)2 b3 c3
