Search Results for ""

Watson (1939) considered the following three triple integrals, I_1 = 1/(pi^3)int_0^piint_0^piint_0^pi(dudvdw)/(1-cosucosvcosw) (1) = (4[K(1/2sqrt(2))]^2)/(pi^2) (2) = ...

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

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 ...

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.

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

Let P=a_1x+a_2x^2+... be an almost unit in the integral domain of formal power series (with a_1!=0) and define P^k=sum_(n=k)^inftya_n^((k))x^n (1) for k=+/-1, +/-2, .... If ...

For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...

In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...

According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...

Steiner gave and Droz-Farny (1901) proved that if equal circles are drawn about the vertices of a triangle (dashed circles in the above figure), they cut the lines joining ...