Search Results for ""

An m×1 matrix [a_(11); a_(21); |; a_(m1)].

A 1×n matrix [a_(11) a_(12) ... a_(1n)].

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

Given an m×n matrix A and a p×q matrix B, their Kronecker product C=A tensor B, also called their matrix direct product, is an (mp)×(nq) matrix with elements defined by ...

The arithmetic-geometric spectral radius rho_(AG) of a graph is defined as the largest eigenvalue of its arithmetic-geometric matrix.

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

A multilinear form on a vector space V(F) over a field F is a map f:V(F)×...×V(F)->F (1) such that c·f(u_1,...,u_i,...,u_n)=f(u_1,...,c·u_i,...,u_n) (2) and ...

A complicated polynomial root-finding algorithm which is used in the IMSL® (IMSL, Houston, TX) library and which Press et al. (1992) describe as "practically a standard in ...

The mean triangle area of a triangle picked inside a regular n-gon of unit area is A^__n=(9cos^2omega+52cosomega+44)/(36n^2sin^2omega), (1) where omega=2pi/n (Alikoski 1939; ...

The order ideal in Lambda, the ring of integral laurent polynomials, associated with an Alexander matrix for a knot K. Any generator of a principal Alexander ideal is called ...