Search Results for ""

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

The Frobenius norm, sometimes also called the Euclidean norm (a term unfortunately also used for the vector L^2-norm), is matrix norm of an m×n matrix A defined as the square ...

An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables (Ferguson and Bailey 1992). Unfortunately, it is ...

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

A quintic surface is an algebraic surface of degree 5. Togliatti (1940, 1949) showed that quintic surfaces having 31 ordinary double points exist, although he did not ...

Szemerédi's theorem states that every sequence of integers that has positive upper Banach density contains arbitrarily long arithmetic progressions. A corollary states that, ...

The set of graph eigenvalues of the adjacency matrix is called the spectrum of the graph. (But note that in physics, the eigenvalues of the Laplacian matrix of a graph are ...

Zygmund (1988, p. 192) noted that there exists a number alpha_0 in (0,1) such that for each alpha>=alpha_0, the partial sums of the series sum_(n=1)^(infty)n^(-alpha)cos(nx) ...

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...