root-bounds-lmq

▸ function positiveRootUpperBound_LMQ (p: number[]): number

Defined in roots/root-bounds/root-bounds-lmq.ts:30

Returns an upper bound for the positive real roots of the given polynomial.

See algoritm 6 of the paper by Vigklas, Akritas and Strzeboński, specifically the LocalMaxQuadratic algorithm hence LMQ.

example

positiveRootUpperBound_LMQ([2,-3,6,5,-130]); //=> 4.015534272870436
positiveRootUpperBound_LMQ([2,3]); //=> 0
positiveRootUpperBound_LMQ([-2,-3,-4]); //=> 0

Parameters:

NameTypeDescription
pnumber[]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

Returns: number


const positiveRootLowerBound_LMQ: (p: number[]): number

Defined in roots/root-bounds/root-bounds-lmq.ts:83

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.

Parameters:

NameTypeDescription
pnumber[]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

Returns: number


const negativeRootLowerBound_LMQ: (p: number[]): number

Defined in roots/root-bounds/root-bounds-lmq.ts:99

Returns a negative lower (further from zero) 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.

Parameters:

NameTypeDescription
pnumber[]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

Returns: number


const negativeRootUpperBound_LMQ: (p: number[]): number

Defined in roots/root-bounds/root-bounds-lmq.ts:115

Returns a negative upper (closer to zero) 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.

Parameters:

NameTypeDescription
pnumber[]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

Returns: number