Scribd
Upload
6 views

Assignment AIML1

The document outlines an assignment with various questions related to transcendental equations, roots of equations, algorithm complexities, and methods for finding roots such as Bisection, Secant, and Newton-Raphson. It includes tasks to explain concepts, provide examples, and perform calculations using specified methods. Additionally, it requires graphical approximations and comparisons of different root-finding methods.

Uploaded by

manyapasricha95
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Assignment AIML1

The document outlines an assignment with various questions related to transcendental equations, roots of equations, algorithm complexities, and methods for finding roots such as Bisection, Secant, and Newton-Raphson. It includes tasks to explain concepts, provide examples, and perform calculations using specified methods. Additionally, it requires graphical approximations and comparisons of different root-finding methods.

Uploaded by

manyapasricha95
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment

Unit: 1
Q1. What is a transcendental equation, explain with example.
Q2. What is meant by simple and multiple roots of an equation. Give examples of each.
Q3. Explain two types of complexities in algorithm. Write an algorithm for Bisection method.
Q4. Define the rate of convergence of an iterative method. Find the rate of convergence of
Newton-Raphson method.
Q5. Find the square root of 5 by fixed point iteration method.
Q6. Find the fourth root of 32 using Secant method up to four decimals.
Q7. Write major differences between secant method and Regula-Falsi method.

Q8. Using Bisection method find the positive root of x = e− x between 0 and 1 to a tolerance
of 0.05%.
Q9. Obtain graphically an approximate value of the lowest root of cos x.cosh x = −1 .

Q10. Using Bisection method find the root of cos x − xe x = 0 .

Q11. Using Newton-Raphson method find the root of x log10 x −1.2 = 0 correct to 10−5 .

Q12. By fixed point iteration method find the positive root of xe x = 1 with initial point x0 = 1 .

Q13. Given a real root of f ( x) = x3 − 5x + 1 = 0 in the interval (0,1). Perform 4 iterations of


each of the following methods and compare the result:
(i) Secant method
(ii) Regula-Falsi method
(iii) Newton Raphson method.

You might also like