Search Results for ""
691 - 700 of 1340 for Root Finding AlgorithmSearch Results
The term "continued fraction" is used to refer to a class of expressions of which generalized continued fraction of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))) ...
A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...
A minimization of the maximum error for a fixed number of terms.
A sum in which subsequent terms cancel each other, leaving only initial and final terms. For example, S = sum_(i=1)^(n-1)(a_i-a_(i+1)) (1) = ...
A transpose of a doubly indexed object is the object obtained by replacing all elements a_(ij) with a_(ji). For a second-tensor rank tensor a_(ij), the tensor transpose is ...
Consider an n×n (0, 1)-matrix such as [a_(11) a_(23) ; a_(22) a_(34); a_(21) a_(33) ; a_(32) a_(44); a_(31) a_(43) ; a_(42) a_(54); a_(41) a_(53) ; a_(52) a_(64)] (1) for ...
The identity matrix is a the simplest nontrivial diagonal matrix, defined such that I(X)=X (1) for all vectors X. An identity matrix may be denoted 1, I, E (the latter being ...
There are at least three theorems known as Jensen's theorem. The first states that, for a fixed vector v=(v_1,...,v_m), the function |v|_p=(sum_(i=1)^m|v_i|^p)^(1/p) is a ...
The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...
Let a_(n+1) = 1/2(a_n+b_n) (1) b_(n+1) = (2a_nb_n)/(a_n+b_n). (2) Then A(a_0,b_0)=lim_(n->infty)a_n=lim_(n->infty)b_n=sqrt(a_0b_0), (3) which is just the geometric mean.
...
View search results from all Wolfram sites (23349 matches)

