CEF 352 Tools and Numerical method for engineering Tutorial 2024
About this paper
CEF 352: 12-question tutorial on root-finding methods: Bisection, Newton-Raphson, and Secant methods, covering convergence-rate comparison, bracketing conditions, iteration-count estimation, worked numerical examples (cubic polynomial, exponential, trigonometric, diode-circuit, and spring-mass equations), and a Python program implementing the Secant method.
Opens this paper in the app on your phone.
University of Buea
Faculty of Engineering and Technology - FET
Tools and Numerical method for engineering
Tutorial · Second Semester · Level 300
From this paper
Why does the Bisection method require f (a) · f (b) < 0? What happens if this condition is violated?
Compare the convergence rates of Bisection, Newton-Raphson, and Secant methods.
At a glance
- Course code
- CEF352 (CEF 352)
- Type
- Tutorial
- Year
- 2024
- Level
- Level 300
- Semester
- Second Semester
- Proposed solution
- Included
Where it's from
University
University of BueaFaculty
Faculty of Engineering and Technology - FET
Other CEF352 papers
Read CEF352 2024 in Shoracy.
- Every page, with zoom for diagrams and small print
- The proposed solution, one tap away
- Stays on your phone after the first open, even offline
Don't have the app yet?