import { positiveRootUpperBound_LMQ } from "./positive-root-upper-bound-lmq.js";
import { upperToLowerBound } from "../upper-to-lower-bound.js";


/** 
 * Returns a positive lower bound of the real roots of the given polynomial
 * 
 * See algoritm 6 of the paper by Vigklas, Akritas and Strzeboński, 
 * specifically the LocalMaxQuadratic algorithm hence LMQ.
 * 
 * @param p a polynomial with coefficients given densely as an array of double
 * floating point numbers from highest to lowest power, e.g. `[5,-3,0]` 
 * represents the polynomial `5x^2 - 3x`
 * 
 * @doc
 */
const positiveRootLowerBound_LMQ = upperToLowerBound(positiveRootUpperBound_LMQ);


export { positiveRootLowerBound_LMQ }