Search Results for ""

Ellipsoidal calculus is a method for solving problems in control and estimation theory having unknown but bounded errors in terms of sets of approximating ellipsoidal-value ...

Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...

A formula for numerical solution of differential equations, (1) where k_1 = hf(x_n,y_n) (2) k_2 = hf(x_n+1/2h,y_n+1/2k_1) (3) k_3 = ...

Let f be a nonnegative and continuous function on the closed interval [a,b], then the solid of revolution obtained by rotating the curve f(x) about the x-axis from x=a to x=b ...

Let R be a plane region bounded above by a continuous curve y=f(x), below by the x-axis, and on the left and right by x=a and x=b, then the volume of the solid of revolution ...

Let f and g be nonnegative and continuous functions on the closed interval [a,b], then the solid of revolution obtained by rotating the curves f(x) and g(x) about the x-axis ...

A procedure for finding the quadratic factors for the complex conjugate roots of a polynomial P(x) with real coefficients. (1) Now write the original polynomial as ...

A root-finding algorithm used in LU decomposition. It solves the N^2 equations i<j l_(i1)u_(1j)+l_(i2)u_(2j)+...+l_(ii)u_(ij)=a_(ij)i=j ...

An algorithm for finding roots for quartic equations with complex roots.

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...