TOPICS
Search

Search Results for ""


361 - 370 of 1388 for matrix multiplicationSearch Results
The graph difference of graphs G and H is the graph with adjacency matrix given by the difference of adjacency matrices of G and H. A graph difference is defined when the ...
A tensor-like object which reverses sign under inversion. Given a transformation matrix A, A_(ij)^'=det|A|a_(ik)a_(jl)A_(kl), where det is the determinant. A pseudotensor is ...
The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...
A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...
Let A=a_(ij) be a matrix with positive coefficients and lambda_0 be the positive eigenvalue in the Frobenius theorem, then the n-1 eigenvalues lambda_j!=lambda_0 satisfy the ...
If all elements a_(ij) of an irreducible matrix A are nonnegative, then R=minM_lambda is an eigenvalue of A and all the eigenvalues of A lie on the disk |z|<=R, where, if ...
The element in the diagonal of a matrix by which other elements are divided in an algorithm such as Gauss-Jordan elimination is called the pivot element. Partial pivoting is ...
A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...
Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...
The identity element of an additive group G, usually denoted 0. In the additive group of vectors, the additive identity is the zero vector 0, in the additive group of ...
1 ... 34|35|36|37|38|39|40 ... 139 Previous Next

...