1 / 25

MATH 175: Numerical Analysis II

MATH 175: Numerical Analysis II. Lecturer: Jomar Fajardo Rabajante IMSP, UPLB 2 nd Sem AY 2012-2013. Question:. What if we do not have means of getting an initial bracket? Let’s start with SECANT METHOD …

elwyn
Download Presentation

MATH 175: Numerical Analysis II

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. MATH 175: Numerical Analysis II Lecturer: Jomar Fajardo Rabajante IMSP, UPLB 2ndSem AY 2012-2013

  2. Question: • What if we do not have means of getting an initial bracket? Let’s start with SECANT METHOD… Suppose that f is a continuous function . Pick two initial points (not necessarily forming a bracket), then do linear interpolation (not inverse).

  3. 4th Method: SECANT METHOD Initial points: Interpolating line: Use x-intercept:

  4. 4th Method: SECANT METHOD Approximate: • Same as the formula for RegulaFalsi • In an iteration, if the points form a bracket, then the method is similar to RegulaFalsi; else the method uses extrapolation. In whatever case, the new points will be Old x2

  5. 4th Method: SECANT METHOD In short: Pick any two distinct points, draw the secant through them, and use the x-intercept (x3) of that secant line as the new estimate of the zero of the function. For the next iteration, discard the oldest point and add (x3, f(x3)) as the new point. WE DO NOT NEED IZT (IVT) ANYMORE!

  6. 4th Method: SECANT METHOD Secant method can be considerably faster than the previous methods. However, it may fail to converge. Example: if f(x1)=f(x2), then what would happen?

  7. 4th Method: SECANT METHOD Notice that can be written as

  8. 4th Method: SECANT METHOD and can also be written as You can use any of these formulas for RegulaFalsi and Secant Method

  9. 4th Method: SECANT METHOD For Secant Method (not for RegulaFalsi), we can generalize the formulas as follows (k=1,2,3,…)

  10. 4th Method: SECANT METHOD Example: Find a zero of Use 0 & 1 as initial values. =(A1*(A2^3+A2-1)-A2*(A1^3+A1-1))/((A2^3+A2-1)-(A1^3+A1-1)) =B2

  11. 4th Method: SECANT METHOD Assuming that the secant method converges to the root, the order of convergence of the method is SUPERLINEAR!!! (but not yet quadratic)

  12. 4th Method: SECANT METHOD Stopping criterion: You can use tol=10^(-m): accurate at least up to m decimal places

  13. 5th Method: Newton’s Method/Newton-Raphson Iteration • What if we make the secant line is a tangent line? • Hence, we only need one initial point. • But we add another assumption: f should be differentiable!

  14. 5th Method: Newton’s Method/Newton-Raphson Iteration From Secant Method: If we use tangent lines: as xk-2 approaches xk-1

  15. 5th Method: Newton’s Method/Newton-Raphson Iteration Hence:

  16. Newton’s Method: To be continued… • Assignment: List the advantages and disadvantages of the discussed methods. Research other disadvantages that we did not mention in the class.

More Related