Search Results for ""

The twistor equation states that del _(A^')^((A)phi^(B...E))=0, where the parentheses denote symmetrization, in a Lorentz transformation, primed spinors transform under the ...

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

Let |z| be a vector norm of a vector z such that ||A||=max_(|z|=1)||Az||. Then ||A|| is a matrix norm which is said to be the natural norm induced (or subordinate) to the ...

Rodrigues' rotation formula gives an efficient method for computing the rotation matrix R in SO(3) corresponding to a rotation by an angle theta about a fixed axis specified ...

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...

An efficient version of the Walsh transform that requires O(nlnn) operations instead of the n^2 required for a direct Walsh transform (Wolfram 2002, p. 1072).

A general integral transform is defined by g(alpha)=int_a^bf(t)K(alpha,t)dt, where K(alpha,t) is called the integral kernel of the transform.

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

The Sherman-Morrison formula is a formula that allows a perturbed matrix to be computed for a change to a given matrix A. If the change can be written in the form u tensor v ...