Search Results for ""

A root of a polynomial P(z) is a number z_i such that P(z_i)=0. The fundamental theorem of algebra states that a polynomial P(z) of degree n has n roots, some of which may be ...

Let L be a finite-dimensional split semisimple Lie algebra over a field of field characteristic 0, H a splitting Cartan subalgebra, and Lambda a weight of H in a ...

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 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 ...

Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...