TOPICS
Search

Search Results for ""


961 - 970 of 1015 for Computational AlgorithmsSearch Results
A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...
The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...
Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...
A Dirichlet L-series is a series of the form L_k(s,chi)=sum_(n=1)^inftychi_k(n)n^(-s), (1) where the number theoretic character chi_k(n) is an integer function with period k, ...
Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...
A doubly periodic function with periods 2omega_1 and 2omega_2 such that f(z+2omega_1)=f(z+2omega_2)=f(z), (1) which is analytic and has no singularities except for poles in ...
An elliptic integral is an integral of the form int(A(x)+B(x)sqrt(S(x)))/(C(x)+D(x)sqrt(S(x)))dx, (1) or int(A(x)dx)/(B(x)sqrt(S(x))), (2) where A(x), B(x), C(x), and D(x) ...
The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...
In antiquity, geometric constructions of figures and lengths were restricted to the use of only a straightedge and compass (or in Plato's case, a compass only; a technique ...
Geometry is the study of figures in a space of a given number of dimensions and of a given type. The most common types of geometry are plane geometry (dealing with objects ...
1 ... 94|95|96|97|98|99|100 ... 102 Previous Next

...