Search Results for ""
421 - 430 of 1340 for Root Finding AlgorithmSearch Results
The p×p square matrix formed by setting s_(ij)=xi^(ij), where xi is a pth root of unity. The Schur matrix has a particularly simple determinant given by ...
The silver constant is the algebraic number given by S = (x^3-5x^2+6x-1)_3 (1) = 2+2cos(2/7pi) (2) = 3.246979603... (3) (OEIS A116425), where (P(x))_n denotes a polynomial ...
Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...
Trigonometric functions of npi/11 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 11 is not a ...
Trigonometric functions of npi/13 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 13 is not a ...
Trigonometric functions of npi/9 radians for n an integer not divisible by 3 (e.g., 40 degrees and 80 degrees) cannot be expressed in terms of sums, products, and finite root ...
A transformation of a polynomial equation f(x)=0 which is of the form y=g(x)/h(x) where g and h are polynomials and h(x) does not vanish at a root of f(x)=0. The cubic ...
Let points A^', B^', and C^' be marked off some fixed distance x along each of the sides BC, CA, and AB. Then the lines AA^', BB^', and CC^' concur in a point U known as the ...
The constants C_n defined by C_n=[int_0^infty|d/(dt)((sint)/t)^n|dt]-1. (1) These constants can also be written as the sums C_n=2sum_(k=1)^infty(1+x_k^2)^(-n/2), (2) and ...
An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).
...
View search results from all Wolfram sites (23349 matches)

