Secant Method To Solve Nonlinear Equations | Numerical Computing with Python

Рет қаралды 12,693

Күн бұрын

Here's my NumPy mini-course for an 80% discount. Use coupon code: NUMPY80 at rb.gy/pk99l ... I hope you'll find it useful.
Theory of secant method to solve nonlinear equations (quadratic, cubic, trigonometric, etc.). The step-by-step algorithm and a Python code.
*** For the full course, visit: www.udemy.com/course/programm...
Visit my new Python course webpage: mechtutor.thinkific.com/cours...

Пікірлер: 6

@AJ-et3vf 2 жыл бұрын

Awesome video. Thank you.

@negar8221 3 жыл бұрын

Thank you . It was so helpful. I have a question though. What if we wanted to create a table which shows every data of each iterations For example for each no. Of iterations. Cause I saw such table in one of my books but do not know how to code that.

@Tigre- Жыл бұрын

4:00

@student9297 4 жыл бұрын

You are making a bookshelf to carry books that range from 8½"to 11"in height and would take up 29" of space along the length. The material is wood having a Young’s Modulus ofMsi667.3, thickness of 3/8"and width of 12". You want to find the maximum vertical deflection of the bookshelf. The vertical deflection of the shelf is given by where x is the position along the length of the beam. Hence to find the maximum deflection we need to find where and conduct the second derivative test. The equation that gives the position x where the deflection is maximum is given by Implement the secant method of finding roots of equations to find the position x where the deflection is maximum. Conduct three iterations to estimate the root of the above equation.

@vedantgadekar4762 4 жыл бұрын

What if the denominator f(x2)-f(x1) is zero and how do i resolve the division by zero

@mechtutorcom 4 жыл бұрын

This is possible, but not so likely to happen in practice. It might happen only if the two consecutive points are on both sides of a minimum or a maximum point of the curve (imagine that for points B and C in the video,) so the connecting line will be exactly or almost horizontal. This will make the next point xi approach +/- infinity. This can be avoided by a condition that checks equality or closeness of f(x1) and f(x2). If they are equal, an arbitrary small correction value can be added to x2, then restart the trials as if x1 and x2 are newly entered values. This could be a solution.