Scribd Logo
Upload

Welcome to Scribd!

  • 70 views

    Sacant Method

    Uploaded by

    Diego Rangel Rangel
    The secant method is an iterative method for finding the zeros, or roots, of a function by using secant lines instead of tangents like in Newton's method. It does not require calculating derivatives. The method starts with two initial points and finds successive approximations as the intersection of the secant line through the two points with the x-axis, converging closer to the root at each step. It is simpler than Newton's method but converges slower, though it almost never fails to find a solution if given reasonable starting points.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Sacant Method

    Uploaded by

    Diego Rangel Rangel
    70 views20 pages
    The secant method is an iterative method for finding the zeros, or roots, of a function by using secant lines instead of tangents like in Newton's method. It does not require calculating derivatives. The method starts with two initial points and finds successive approximations as the intersection of the secant line through the two points with the x-axis, converging closer to the root at each step. It is simpler than Newton's method but converges slower, though it almost never fails to find a solution if given reasonable starting points.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The secant method is an iterative method for finding the zeros, or roots, of a function by using secant lines instead of tangents like in Newton's method. It does not require calculating derivatives. The method starts with two initial points and finds successive approximations as the intersection of the secant line through the two points with the x-axis, converging closer to the root at each step. It is simpler than Newton's method but converges slower, though it almost never fails to find a solution if given reasonable starting points.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    70 views20 pages

    Sacant Method

    Uploaded by

    Diego Rangel Rangel
    The secant method is an iterative method for finding the zeros, or roots, of a function by using secant lines instead of tangents like in Newton's method. It does not require calculating derivatives. The method starts with two initial points and finds successive approximations as the intersection of the secant line through the two points with the x-axis, converging closer to the root at each step. It is simpler than Newton's method but converges slower, though it almost never fails to find a solution if given reasonable starting points.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 20

    Iván Manuel Saucedo Luna

    Jorge André Alcocer Mujica


    Luis Enrique Ortega Cantú
    Alejandro Andrade López
    Héctor Campos de Anda
    The secant method is a
    method for iteratively finding
    the zeros of a function.
    One of the objectives of this method is to
    eliminate the problem of the derivative of
    the function, since there are functions
    that describe physical phenomena in
    real life, whose derivative is very
    complex.

    It´s important to mention that the secant


    method is very similar to Newton's with the
    main difference that this secant method
    does not require the second derivative.
    This line is called secant
    because it cuts the graph of the
    The method is based on
    function. Subsequently, the
    obtaining the equation of the
    intersection of the secant line
    line that passes through the
    with the abscissa axis is chosen
    points ( xn - 1 ) , f ( xn - 1 ) )
    as the next element of the
    and ( xn , f ( xn ) ) .
    recurrence relation, xn + 1,
    obtaining the formula .
    Is a line that cuts a circle at two points. As these intersection
    points get closer, this line approaches a point and, when there is
    only one point that touches the circumference, it is called a
    tangent.
    Given the points of intersection A and B, the equation of the
    secant line can be calculated using to know the answer to this
    operation, the equation of the line that passes through two points
    is used in mathematics:
    𝒚𝑨 − 𝒚𝑩 𝒙𝑨 ∙ 𝒚𝑩 − 𝒙𝑩 ∙ 𝒚𝑨
    𝒙𝒊+𝟏 = ∙𝒙+
    𝒙𝑨 − 𝒙 𝑩 𝒙𝑨 − 𝒙𝑩
    This method, unlike the bisection and false rule method, almost never
    fails since it only requires 2 points at the beginning, and then the same
    method feeds back.
    Basically, what it does is draw intersecting lines to the curve of the
    equation that we originally have, and it checks the intersection of those
    lines with the X axis to see if it is the root that we are looking for.
    The secant method starts from two points (and not just one like
    Newton's method) and estimates the tangent (that is, the slope of the
    line) by an approximation according to the expression:
    Substituting this expression into the
    Newton's method equation, we get
    the secant method expression that
    gives us the following iteration point:
    ❑ Thanks to this method, the problem of calculating the derivative of the function
    can be eliminated, since there are functions that describe physical phenomena
    in real life, and whose derivative is very complex.
    ❑ With the secant method it is not required to know the value of the first
    derivative of the function at the point , that is, it avoids the calculation of the
    derivative .
    ❑ This method almost never fails since it only requires 2 points at the beginning ,
    and then the same method feeds back , that is , it accommodates itself until it
    finds the root .
    ❑ In this method the second derivative is not required. In many cases the value of
    the root cannot be calculated analytically, and a numerical method must be
    used.
    ❑ There are several forms in this method, for example the Iterative Method, which
    is the most robust. In this method it is not necessary to accommodate each of
    the data in columns, but the simplification of concepts is used.
    ❑ Here only 2 columns are used, one of Xn and one of f(Xn). The secant method
    proceeds regardless of the signs of the function, that is, the sign of the function
    is not taken into account to estimate the next point.
    ❑ This method almost never fails since it only requires 2 points at the beginning ,
    and then the same method feeds back , that is , it accommodates itself until it
    finds the root .
    ❑ The secant method starts from two points (and not just one like Newton's
    method) and estimates the tangent (that is, the slope of the line).
    ❑ With this method it is easier to evaluate the computational cost of deriving the
    study function.
    ❑ The secant method is an iterative process and therefore finds the approximation
    almost as quickly as the Newton - Raphson method .
    ❑ The secant method, being an iterative process, runs the same risk as the
    Newton-Raphson method of not converging to the root, while the false rule
    method plays it safe.
    ❑ The rate of convergence is slower than the Newton-Raphson rate. It is not
    ensured that the first approximation is close to the root that could be the
    divergence index.
    Xi=7 Xi-1=5

    Xi Xi-1 f(Xi) f(Xi-1) Xi+1 Error f(Xa)


    7 5 --------- --------- --------- ---------------
    I X1 X0 f(Xi) f(Xi+1) X2 Error f(Xa)->
    (X(i+1)-X(i)/X(i+1))*100
    Xi=7 Xi-1=5
    1 7 5 24 6 4.33 -61.66%

    𝑓(𝑥_𝑖)=(7)^2−3(7)−4=24
    2
    𝑓 𝑥𝑖 − 1 = 5 − 3 5 − 4 = 6
    𝑥𝑖 + 1 = 𝑋2 = 7 − (24 ∗ (5 − 7))/(6 − 24) = 4.33
    4.33 − 7
    𝐸𝑟𝑟𝑜𝑟 = ∗ 100
    4.33

    𝐸𝑟𝑟𝑜𝑟 = −61.66%
    I X1 X0 f(Xi) f(Xi+1) X2 Error f(Xa)->
    (X(i+1)-X(i)/X(i+1))*100
    Xi=7 Xi-1=5
    2 4.33 7 1.76 24 4.12 -5.097%

    𝑋𝑖 + 1 = 4.33 − (1.76 ∗ (7 − 4.33))/(24 − 1.76)


    = 4.12𝑓(𝑋𝑖 − 1) = (7)^2 − 3(7) − 4 = 24𝑓(𝑋𝑖)
    = (4.33)^2 − 3(4.33) − 4 = 1.76
    4.12 − 4.33
    𝐸𝑟𝑟𝑜𝑟 = ∗ 100
    4.12

    𝐸𝑟𝑟𝑜𝑟 = −5.097%
    I X1 X0 f(Xi) f(Xi+1) X2 Error f(Xa)->
    (X(i+1)-X(i)/X(i+1))*100
    Xi=7 Xi-1=5
    3 --------------- --------------- --------------- --------------- --------------- ---------------

    𝑋𝑖 + 1 = 𝑓(𝑋𝑖 − 1) = 𝑓(𝑋𝑖) =

    𝐸𝑟𝑟𝑜𝑟 =
    I X1 X0 f(Xi) f(Xi+1) X2 Error f(Xa)->
    (X(i+1)-X(i)/X(i+1))*100
    Xi=7 Xi-1=5
    4 --------------- --------------- --------------- --------------- --------------- ---------------

    𝑋𝑖 + 1 = 𝑓(𝑋𝑖 − 1) = 𝑓(𝑋𝑖) =

    𝐸𝑟𝑟𝑜𝑟 =
    The secant method is based on Newton's method, where computing the
    derivative is not required.
    It is easier to calculate the roots with the secant method than with Newton's
    method because with the secant we start from two points (and not just one
    like Newton's method) estimate the tangent (that is, the slope of the
    straight).
    You can perform the algorithm in MATLab or Octave to find the roots using
    the secant method.

    You might also like