TOPICS
Search

Search Results for ""


311 - 320 of 1340 for Root Finding AlgorithmSearch Results
The sequence produced by sorting the digits of a number and adding them to the previous number. The values starting with n=1, 2, ... are 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...
Trigonometric functions of npi/7 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 7 is not a ...
If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...
The element in the diagonal of a matrix by which other elements are divided in an algorithm such as Gauss-Jordan elimination is called the pivot element. Partial pivoting is ...
In general, a remainder is a quantity "left over" after performing a particular algorithm. The term is most commonly used to refer to the number left over when two integers ...
The series of Sturm functions arising in application of the Sturm theorem.
1. Find a complete system of invariants, or 2. Decide when two metrics differ only by a coordinate transformation. The most common statement of the problem is, "Given metrics ...
Given a unit disk, find the smallest radius r(n) required for n equal disks to completely cover the unit disk. The first few such values are r(1) = 1 (1) r(2) = 1 (2) r(3) = ...
The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...
A chamfered icosahedron, also called a tritruncated rhombic triacontahedron, is a polyhedron obtained by chamfering a regular icosahedron. The illustration above shows ...
1 ... 29|30|31|32|33|34|35 ... 134 Previous Next

...