https://newrpl.wiki.hpgcc3.org/ 2026-05-06T04:10:49+00:00 https://newrpl.wiki.hpgcc3.org/ https://newrpl.wiki.hpgcc3.org/lib/tpl/bootstrap3/images/favicon.ico text/html 2021-10-01T05:28:04+00:00 Anonymous (anonymous@undisclosed.example.com) https://newrpl.wiki.hpgcc3.org/doku.php?id=manual:chapter8:msolveopt&rev=1633091284&do=diff Multiple equation solving and optimization Introduction newRPL includes an implementation of the Nelder-Mead Simplex Algorithm, which is a generic search algorithm for multiple variables. The implementation provides a very flexible framework for the user to experiment with root searching for anything from a single linear equation to a system of multiple non-linear equations. text/html 2021-10-01T12:35:52+00:00 Anonymous (anonymous@undisclosed.example.com) https://newrpl.wiki.hpgcc3.org/doku.php?id=manual:chapter8:numinteg&rev=1633116952&do=diff Numerical integration Numeric integration of symbolic expressions is performed in newRPL via the NUMINT command which implements the Adaptive Simpson's method. NUMINT accepts four arguments: * the mono-variate function to integrate, either in symbolic or program form; * the lower integration limit;$ θ=θ_{r}\, $$ θ=\frac{\pi}{180}{θ_°}\, $$ θ=\frac{\pi}{200}{θ_g}\, $$θ_{r}\,$$θ_{°}$$θ_{g}$$θ$$ f(θ)=\sin{θ} $$ f(θ_r) $$ f(θ) $$ f(θ_r)\,dθ_r=\sin{θ}\,d{θ} $$ F(θ)=-\cos{θ}\, $$ f(θ_°) $$ f\le…