ph-math/src/main/java/com/helger/numbercruncher/mathutils/SecantRootFinder.java
@Override
  protected void doIterationProcedure (final int n)
  {
    if (n == 1)
      return; // already initialized

    // Use the latest two points.
    m_fXnm1 = m_fXn; // x[n-1] = x[n]
    m_fXn = m_fXnp1; // x[n] = x[n+1]
    m_fFnm1 = m_fFn; // f(x[n-1]) = f(x[n])
    m_fFn = m_fFnp1; // f(x[n]) = f(x[n+1])
  }
@Override
  protected void doIterationProcedure (final int n)
  {
    if (n == 1)
      return; // already initialized

    // Use the latest two points.
    m_fXnm1 = m_fXn; // x[n-1] = x[n]
    m_fXn = m_fXnp1; // x[n] = x[n+1]
    m_fFnm1 = m_fFn; // f(x[n-1]) = f(x[n])
    m_fFn = m_fFnp1; // f(x[n]) = f(x[n+1])
  }
Do the secant iteration procedure.

@param n
the iteration count