What is secant method?
Secant method in numerical analysis used to find the roots of the polynomials
• Secant method is a recursive method for finding the root for the polynomials by successive approximation.
• It’s similar to the Regula-falsi method but here we don’t need to check f(x1)f(x2)<0 again.
• It is also calles as 2 point method.
• Secant method is faster than bisection method and newton raphson method.
• Newton's method will fail in cases where the derivative is zero.
Multiple choice questions
1.What is the region of convergence of Secant Method?
a) 1.5
b) 1.26
c) 1.62
d) 1.66
2.Secant method converges faster than Bisection method.
a)True
b)False
3.Secant Method is slower than Newton Raphson Method.
a)True
b)False
4.The number of iterations in Secant Method are less as compared to Newton Raphson.
a)True
b)False
5.Secant method is a bracketing method.
a)True
b)False
6.A quadratic equation x²-4x+4=0 is defined with an initial guess of 10 and 20. Find the approximated value of x2 using Secant Method.
a) 7.538
b) 7.853
c) 7.358.
d) 7.835
7.A quadratic e
quation x²-4x+4=0 is defined with an initial guess of 3 and 2.5. Find the approximated value of root using Secant Method.
a) 1.33
b) 2.33
c) 3.33
d) 4.33
8.A quadratic equation x⁴-x-8=0 is defined with an initial guess of 1 and 2. Find the approximated value of x2 using Secant Method.
a) 7.538
b) 7.853
c) 7.358
d) 1.571
9.A quadratic equation x²-4x+4=0 is defined with an initial guess of 2 and 2.5. Find the approximated value of root using Secant Method.
a)1
b)2
c)3
d)4
0 Comments