All in One Maths Lab

C/ C++ PROGRAMMING FOR NUMERICAL LAB

@ [Pŧ]-[A__B]-[ÅÏ™] @ [Pŧ]-[A__B]-[ÅÏ™]

Page 1

CONTENTS 1. BISECTION METHOD 2. SECANT METHOD 3. EULER METHOD 4. TRAPEZOIDAL METHOD 5. REGULA FALSI METHOD 6. FIXED POINT METHOD 7. LAGRANGE’S INTERPOLATION 8. RUNGE-KUTTA METHOD 9. SIMPSON’S 1/3 RULE 10. SIMPSON’S 3/8 RULE 11. GAUSS-SEIDEL METHOD 12. NEWTON-RAPHSON METHOD 13. NEWTON’S DIVIDED DIFFERENCE METHOD 14. HUEN’S METHOD

@ [Pŧ]-[A__B]-[ÅÏ™]

Page 2

BISECTION METHOD AIM: To find solution of x2-4x+3 by BISECTION METHOD.

ALGORITHM: 1. Start 2. Define the function f(x) 3. Read initial values say x1 & x2. 4. if (((f(x1)*f(x2))