Search Results for ""
21 - 30 of 752 for Geometric OptimizationSearch Results
The arithmetic-geometric index of a graph is defined as half the sum of the matrix elements of its arithmetic-geometric matrix.
The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...
Let alpha_(n+1) = (2alpha_nbeta_n)/(alpha_n+beta_n) (1) beta_(n+1) = sqrt(alpha_nbeta_n), (2) then H(alpha_0,beta_0)=lim_(n->infty)a_n=1/(M(alpha_0^(-1),beta_0^(-1))), (3) ...
The arithmetic-geometric energy of a graph is defined as the graph energy of its arithmetic-geometric matrix, i.e., the sum of the absolute values of the eigenvalues of its ...
The Greek problems of antiquity were a set of geometric problems whose solution was sought using only compass and straightedge: 1. circle squaring. 2. cube duplication. 3. ...
The statistical index P_G=[product((p_n)/(p_0))^(v_0)]^(1/Sigmav_0), where p_n is the price per unit in period n, q_n is the quantity produced in period n, and v_n=p_nq_n the ...
Given a planar graph G, its geometric dual G^* is constructed by placing a vertex in each region of G (including the exterior region) and, if two regions have an edge x in ...
The arithmetic-geometric mean agm(a,b) of two numbers a and b (often also written AGM(a,b) or M(a,b)) is defined by starting with a_0=a and b_0=b, then iterating a_(n+1) = ...
Let E be a compact connected subset of d-dimensional Euclidean space. Gross (1964) and Stadje (1981) proved that there is a unique real number a(E) such that for all x_1, ...
For positive numbers a and b with a!=b, (a+b)/2>(b-a)/(lnb-lna)>sqrt(ab).
...
View search results from all Wolfram sites (6922 matches)

