Search Results for ""
1381 - 1390 of 2130 for Matrix polynomialSearch Results
Simpson's rule is a Newton-Cotes formula for approximating the integral of a function f using quadratic polynomials (i.e., parabolic arcs instead of the straight line ...
The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...
The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...
An exponential sum of the form sum_(n=1)^Ne^(2piiP(n)), (1) where P(n) is a real polynomial (Weyl 1914, 1916; Montgomery 2001). Writing e(theta)=e^(2piitheta), (2) a notation ...
The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...
The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...
The word polytope is used to mean a number of related, but slightly different mathematical objects. A convex polytope may be defined as the convex hull of a finite set of ...
For a single variate X having a distribution P(x) with known population mean mu, the population variance var(X), commonly also written sigma^2, is defined as ...
Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...
In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...
...
View search results from all Wolfram sites (23669 matches)

