TOPICS
Search

Search Results for ""


711 - 720 of 1330 for Singular Value DecompositionSearch Results
The supremum is the least upper bound of a set S, defined as a quantity M such that no member of the set exceeds M, but if epsilon is any positive quantity, however small, ...
A surface (or "space") of section, also called a Poincaré section (Rasband 1990, pp. 7 and 93-94), is a way of presenting a trajectory in n-dimensional phase space in an ...
Given a regular tetrahedron of unit volume, consider the lengths of line segments connecting pairs of points picked at random inside the tetrahedron. The distribution of ...
A variable is a symbol on whose value a function, polynomial, etc., depends. For example, the variables in the function f(x,y) are x and y. A function having a single ...
The conjecture that, for any triangle, 8omega^3<ABC (1) where A, B, and C are the vertex angles of the triangle and omega is the Brocard angle. The Abi-Khuzam inequality ...
Analysis
A cube can be divided into n subcubes for only n=1, 8, 15, 20, 22, 27, 29, 34, 36, 38, 39, 41, 43, 45, 46, and n>=48 (OEIS A014544; Hadwiger 1946; Scott 1947; Gardner 1992, ...
The Delannoy numbers D(a,b) are the number of lattice paths from (0,0) to (b,a) in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., ->, ^, ...
An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...
Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...
1 ... 69|70|71|72|73|74|75 ... 133 Previous Next

...