// Progrem to demonstrate calling Brent zero-finder

#include <iostream>
#include <iomanip>
#include "brent.h"

using namespace std;
using namespace brent;

int main(){
  monicPoly Hbalance(3);                     // a cubic polynomial
  Hbalance.coeff[1] = -1;
  Hbalance.coeff[2] = 2;
  for (int ii = 0; ii <=6; ii++) {
    double prod = 2. + ii/1e5;
// the polynomial is something like:  -2.000001 - x + 2x^2 + x^3
    Hbalance.coeff[0] = -prod;
    double root = zero(0.5, 1.5, 1e-13, Hbalance);
    cout << "Prod of roots: " << setprecision(6) << setw(7) << prod
        << "  Pos root: "    << setprecision(12) << setw(13) << root
        << "  Y val: "        << setprecision(2) << Hbalance(root)
        << endl;
  }
}