polynomial-real-root-finding

WebRootfinding

Polynomial real root-finding within the browser using javascript

References

@article{article,
author = {Akritas, Alkiviadis},
year = {2009},
month = {01},
pages = {523-537},
title = {Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials},
volume = {15},
journal = {J. UCS}
}
https://www.jucs.org/jucs_15_3/linear_and_quadratic_complexity/jucs_15_03_0523_0537_akritas.pdf

@misc{dai2012logcf,
      title={logcf: An Efficient Tool for Real Root Isolation}, 
      author={Liyun Dai and Bican Xia},
      year={2012},
      eprint={1209.3555},
      archivePrefix={arXiv},
      primaryClass={cs.SC}
}
https://arxiv.org/abs/1209.3555

@article{TSIGARIDAS2013120,
title = {Improved bounds for the CF algorithm},
journal = {Theoretical Computer Science},
volume = {479},
pages = {120-126},
year = {2013},
note = {Symbolic-Numerical Algorithms},
issn = {0304-3975},
doi = {https://doi.org/10.1016/j.tcs.2012.10.022},
url = {https://www.sciencedirect.com/science/article/pii/S0304397512009437},
author = {Elias P. Tsigaridas}
}
https://www.sciencedirect.com/science/article/pii/S0304397512009437

https://en.wikipedia.org/wiki/Sturm%27s_theorem https://en.wikipedia.org/wiki/Real-root_isolation#Continued_fraction_method https://en.wikipedia.org/wiki/Vincent%27s_theorem https://arxiv.org/abs/1605.00410 https://arxiv.org/abs/0805.3194

License

GNU General Public License v3.0