use algorithmatic.com's in-browser integrated-development-environment here. The IDE offers syntax-highlighting, realtime validation, syntax-autocompletion, autocompletion for external-calls, interpreter and basic debugging.
Account
signin
algorithmatic.com uses OpenID - that means you don't need to register, probably you already have an OpenID, you just need to enable it. Click here to sign in
Runtime Error (0:0): Invalid math expression: unknown charachter found in expression '(2,00000019992006)^2 - 1' at index 2 value ','
May be problem in my russian locale? (uses "," instead of ".")
Newton-Raphson method is used for finding successively better approximations to the zeroes (or roots) of a real-valued function. This implementation is restricted to operate on one-dimensional routines.
The method takes a routine (expression), initial guessed value, and number of steps. The number of steps represents the number of iterations (a.k.a. corrections.) The increase in number of steps should yield better approximations. Note that usually the number of steps is discarded and instead the error (the difference in approximation from subsequent iterations) is examined.
The method is powerful because of its rate of convergence. It can also yield disastrous results if the initial value is too far from the real root. This is especially concerning when the function/expression includes local maximum and local minimum.
May be problem in my russian locale? (uses "," instead of ".")