Benchmark: Root finding using the FloPoly JavaScript library.

Root finding using the FloPoly JavaScript library. (version: 18)

Root finding using the FloPoly JavaScript library for various degree polynomials with varying number of roots.

Comparing performance of: 100 cubic polynomials with 3 real roots vs 100 cubic polynomials with random coefficients vs 100 degree 4 polynomials with 4 real roots vs 100 degree 4 polynomials with random coefficients vs 100 degree 7 polynomials with 7 real roots vs 100 degree 7 polynomials with random coefficients vs 100 degree 12 polynomials with 12 real roots vs 100 deg 12 polynomials with random coefficients vs 100 degree 15 polynomials with 15 real roots vs 100 deg 15 polynomials with random coefficients

Created: 7 years ago by: Registered User

Jump to the latest result

HTML Preparation code:

<script src="https://mat-demo.appspot.com/bower_components/flo-poly/dist/flo-poly.js"></script>

Script Preparation code:

var { evaluate, allRoots, hornerErrorBound } = FloPoly;
var { flatRootsArr, flatCoefficientsArr } = FloPoly.random;

const orders = [3,4,7,12,15];
var pssRealRootsOnly = [
  	// Flat random distribution of roots in [-10,10]
	flatRootsArr(100, orders[0], -10, 10, 11111),
	flatRootsArr(100, orders[1], -10, 10, 22222),
	flatRootsArr(100, orders[2], -10, 10, 33333),
	flatRootsArr(100, orders[3], -10, 10, 44444),
	flatRootsArr(100, orders[4], -10, 10, 55555),
];
var pssRandomCoefficients = [
  	// Flat random distribution of coefficients in [-10,10]
	flatCoefficientsArr(100, orders[0], -10, 10, 66666),
	flatCoefficientsArr(100, orders[1], -10, 10, 77777),
	flatCoefficientsArr(100, orders[2], -10, 10, 88888),
	flatCoefficientsArr(100, orders[3], -10, 10, 99999),
	flatCoefficientsArr(100, orders[4], -10, 10, 12121),
];

Tests:

100 cubic polynomials with 3 real roots
for (let i=0; i<pssRealRootsOnly[0].length; i++) { var p = pssRealRootsOnly[0][i]; var roots = allRoots(p); }
100 cubic polynomials with random coefficients
for (let i=0; i<pssRandomCoefficients[0].length; i++) { var p = pssRandomCoefficients[0][i]; var roots = allRoots(p); }
100 degree 4 polynomials with 4 real roots
for (let i=0; i<pssRealRootsOnly[1].length; i++) { var p = pssRealRootsOnly[1][i]; var roots = allRoots(p); }
100 degree 4 polynomials with random coefficients
for (let i=0; i<pssRandomCoefficients[1].length; i++) { var p = pssRandomCoefficients[1][i]; var roots = allRoots(p); }
100 degree 7 polynomials with 7 real roots
for (let i=0; i<pssRealRootsOnly[2].length; i++) { var p = pssRealRootsOnly[2][i]; var roots = allRoots(p); }
100 degree 7 polynomials with random coefficients
for (let i=0; i<pssRandomCoefficients[2].length; i++) { var p = pssRandomCoefficients[2][i]; var roots = allRoots(p); }
100 degree 12 polynomials with 12 real roots
for (let i=0; i<pssRealRootsOnly[3].length; i++) { var p = pssRealRootsOnly[3][i]; var roots = allRoots(p); }
100 deg 12 polynomials with random coefficients
for (let i=0; i<pssRandomCoefficients[3].length; i++) { var p = pssRandomCoefficients[3][i]; var roots = allRoots(p); }
100 degree 15 polynomials with 15 real roots
for (let i=0; i<pssRealRootsOnly[4].length; i++) { var p = pssRealRootsOnly[4][i]; var roots = allRoots(p); }
100 deg 15 polynomials with random coefficients
for (let i=0; i<pssRandomCoefficients[4].length; i++) { var p = pssRandomCoefficients[4][i]; var roots = allRoots(p); }

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
100 cubic polynomials with 3 real roots
100 cubic polynomials with random coefficients
100 degree 4 polynomials with 4 real roots
100 degree 4 polynomials with random coefficients
100 degree 7 polynomials with 7 real roots
100 degree 7 polynomials with random coefficients
100 degree 12 polynomials with 12 real roots
100 deg 12 polynomials with random coefficients
100 degree 15 polynomials with 15 real roots
100 deg 15 polynomials with random coefficients

Fastest: N/A

Slowest: N/A

Latest run results:

Run details: (Test run date: 7 years ago)

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/60.0.3112.113 Safari/537.36

Browser/OS: Chrome 60 on Windows

View result in a separate tab

Test name	Executions per second
100 cubic polynomials with 3 real roots	1307.6 Ops/sec
100 cubic polynomials with random coefficients	13637.7 Ops/sec
100 degree 4 polynomials with 4 real roots	514.6 Ops/sec
100 degree 4 polynomials with random coefficients	1896.0 Ops/sec
100 degree 7 polynomials with 7 real roots	136.6 Ops/sec
100 degree 7 polynomials with random coefficients	393.3 Ops/sec
100 degree 12 polynomials with 12 real roots	36.8 Ops/sec
100 deg 12 polynomials with random coefficients	125.9 Ops/sec
100 degree 15 polynomials with 15 real roots	21.6 Ops/sec
100 deg 15 polynomials with random coefficients	77.9 Ops/sec

Autogenerated LLM Summary (model llama3.2:3b, generated 2 months ago):

LLMs can make mistakes. Check important info.

Related benchmarks:

Root finding using the FloPoly JavaScript library. (version: 18)

Root finding using the FloPoly JavaScript library for various degree polynomials with varying number of roots.

Created: 7 years ago by: Registered User

Jump to the latest result

100 cubic polynomials with 3 real roots

100 cubic polynomials with random coefficients

100 degree 4 polynomials with 4 real roots

100 degree 4 polynomials with random coefficients

100 degree 7 polynomials with 7 real roots

100 degree 7 polynomials with random coefficients

100 degree 12 polynomials with 12 real roots

100 deg 12 polynomials with random coefficients

100 degree 15 polynomials with 15 real roots

100 deg 15 polynomials with random coefficients

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

Autogenerated LLM Summary (model llama3.2:3b, generated 2 months ago):