TOPICS
Search

Search Results for ""


11941 - 11950 of 13135 for Computational GeometrySearch Results
The American Mathematical Society awards two prizes named in honor of Prof. Frank Nelson Cole, a senior member of the AMS who made a bequest to the society in 1928 upon his ...
A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...
In December 1920, M. Schönfinkel presented in a report to the Mathematical Society in Göttingen a new type of formal logic based on the concept of a generalized function ...
The complete elliptic integral of the first kind K(k), illustrated above as a function of the elliptic modulus k, is defined by K(k) = F(1/2pi,k) (1) = ...
A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...
A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...
The nesting of two or more functions to form a single new function is known as composition. The composition of two functions f and g is denoted f degreesg, where f is a ...
The confluent hypergeometric function of the second kind gives the second linearly independent solution to the confluent hypergeometric differential equation. It is also ...
The conjugate gradient method can be applied on the normal equations. The CGNE and CGNR methods are variants of this approach that are the simplest methods for nonsymmetric ...
In the biconjugate gradient method, the residual vector r^((i)) can be regarded as the product of r^((0)) and an ith degree polynomial in A, i.e., r^((i))=P_i(A)r^((0)). (1) ...

...