The HP 48 object listed below in ->ASC form is a high-performance polynomial root finder. Those of you who remember the HP 71B Math Pac will recognize this as the same as the PROOT command from that Pac; it is in fact the same assembly-language code, given an RPL front end to operate in the HP 48.
Found on https://www.hpmuseum.org/forum/thread-10967-post-160700.html#pid160700
See also http://www.jeffcalc.hp41.eu/emu71/mathrom.html#src for the uncommented source code of PROOT and other functions of the HP71B math pack.
https://www.johndcook.com/blog/2022/10/21/math-origins/ explains V.I. Arnolds comment
"All mathematics is divided into three parts: cryptography (paid for by CIA, KGB and the like), hydrodynamics (supported by manufacturers of atomic submarines), and celestial mechanics (financed by military and other institutions dealing with missiles, such as NASA)."
The article https://www.johndcook.com/non_central_chi_square.pdf sounds interesting:
John D. Cook Upper bounds on non-central chi-squared tails and truncated normal moments (2010). UT MD Anderson Cancer Center Department of Biostatistics Working Paper Series. Working Paper 62.
Abstract. We show that moments of the truncated normal distribution provide upper bounds on the tails of the non-central chi-squared distribution, then develop upper bounds for the former.
Windows applications or source code for various numerical algorithms, with emphasis on polynomial root finding. Some algorithms can be used via a web interface.
Contains references to B. Smiths ZERPOL and Adam's stopping criterion. SMITH, B.T. ZERPOL, a zero finding algorithm for polynomials using Laguerre's method. Proc. 1967 Army Numerical Analysis Conference, Madison, Wis., May 1967 (Rep. 67-3, US Army Res. O