function [ x, ierror, k ] = newton_secant ( x, abserr, kmax, f )

%*****************************************************************************80
%
%% newton_secant() implements the Newton - secant method.
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    15 May 2024
%
%  Author:
%
%    John Burkardt
%
%  Reference:
%
%    Joseph Traub,
%    Iterative Methods for the Solution of Equations,
%    ISBN: 0828403120,
%    LC: QA297.T7.
%    Prentice Hall, 1964, page 236.
%
%  Input:
%
%    real X: an estimate for the root of the equation.
%
%    real ABSERR: an error tolerance.
%
%    integer KMAX: the maximum number of iterations allowed.
%
%    real external F: the name of the routine that
%    evaluates the function or its derivatives, of the form
%      function f ( x, ider )
%
%  Output:
%
%    real X: an approximate root for which abs ( F(X) ) <= ABSERR.
%
%    integer IERROR: error indicator.
%    0, no error occurred.
%    nonzero, an error occurred, and the iteration was halted.
%
%    integer K: the number of steps taken.
%

%
%  Initialization.
%
  ierror = 0;
  k = 0;
  fx = f ( x, 0 );
%
%  Iteration loop:
%
  while ( true )
%
%  If the error tolerance is satisfied, then exit.
%
    if ( abs ( fx ) <= abserr )
      break;
    end

    k = k + 1;

    if ( kmax < k )
      ierror = 2;
      return
    end

    dfx = f ( x, 1 );

    if ( dfx == 0.0 )
      ierror = 3;
      return
    end

    x1 = x - fx / dfx;
    fxu = f ( x1, 0 );

    if ( fxu - fx == 0.0 )
      ierror = 3;
      return
    end
%
%  Set the increment.
%
    dx = - ( fx / dfx ) * ( 1.0 - fxu / ( fxu - fx ) );
%
%  Remember current data for next step.
%
    x1 = x;
%
%  Update the iterate and function values.
%
    x = x + dx;
    fx = f ( x, 0 );

  end

  return
end
