Search Results for ""
251 - 260 of 1340 for Root Finding AlgorithmSearch Results
Parallel computing is the execution of a computer program utilizing multiple computer processors (CPU) concurrently instead of using one processor exclusively. Let T(n,1) be ...
An orientable surface with one boundary component such that the boundary component of the surface is a given knot K. In 1934, Seifert proved that such a surface can be ...
A reciprocity theorem for the case n=3 solved by Gauss using "integers" of the form a+brho, when rho is a root of x^2+x+1=0 (i.e., rho equals -(-1)^(1/3) or (-1)^(2/3)) and ...
Given two univariate polynomials of the same order whose first p coefficients (but not the first p-1) are 0 where the coefficients of the second approach the corresponding ...
The heptanacci constant is the limiting ratio of adjacent heptanacci numbers. It is the algebraic number P = (x^7-x^6-x^5-x^4-x^3-x^2-x-1)_1 (1) = 1.99196419660... (2) (OEIS ...
The hexanacci constant is the limiting ratio of adjacent hexanacci numbers. It is the algebraic number P = (x^6-x^5-x^4-x^3-x^2-x-1)_2 (1) = 1.98358284342... (2) (OEIS ...
The necessary and sufficient condition that an algebraic curve has an algebraic involute is that the arc length is a two-valued algebraic function of the coordinates of the ...
The pentanacci constant is the limiting ratio of adjacent pentanacci numbers. It is the algebraic number P = (x^5-x^4-x^3-x^2-x-1)_1 (1) = 1.96594823... (2) (OEIS A103814), ...
A Lie algebra is said to be simple if it is not Abelian and has no nonzero proper ideals. Over an algebraically closed field of field characteristic 0, every simple Lie ...
The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...
...
View search results from all Wolfram sites (23349 matches)

