Search Results for "x root"

Application for polynomial roots calculation. The application does the job by supposing the roots of the derivative function are known. This way, we can delimit the range where each possible root is in, and by applying Bolzano's theorem, we can find the zeroes. It is not a very eficient way, as we must calculate al the derivatives of the polinomial, implying very high numbers (n!), that make the needed precision increase, making the computational complexity for high-degree polinomials poor. But I have been able to make it work with a 40-degree polynomial, with two very proximal zeroes arround x=1000. ...

...The library manages the 5 operators (+, -, /, %, *) together with the following functions: - "abs" - "cos" - "sin" - "acos" - "asin" - "cosh" - "sinh" - "tan", - "tanh" - "atan" - "sqrt" - "cbrt" - "root" - "log" - "log10" - "log1p" - "exp" - "expm1" - "atan2" - "pow" The library supports variables (case insensitive), custom and pre-loaded ("e" and "pi"). Example: int num_variations = 100; int init_value = 10; MathParser mathParser = new MathParser(); mathParser.putVariable("x", init_value); mathParser.parse("2 + (7 - 5) * 3.14159 * pow(x, (12-10)) + sin(-3.141)"); for(int i = init_value; i < num_variations; ++i) { Double result = mathParser.execute(); mathParser.putVariable("x", i); }

MESH is a tool that measures distortion between two discrete surfaces (triangular meshes) using the Hausdorff distance to compute a maximum, mean and root-mean-square errors between two given surfaces. It also displays the error values on the surface.

"tdsp" is a C++ based framework for the simulation and evaluation of various signal processing aspects. It is completly written in C++ and is based on "root" framework (http://root.cern.ch). TDSP includes C++-classes which extents the root-class-f