TOPICS
Search

Search Results for ""


301 - 310 of 782 for matrices operationSearch Results
A linear algebraic group is a matrix group that is also an affine variety. In particular, its elements satisfy polynomial equations. The group operations are required to be ...
The natural norm induced by the L1-norm is called the maximum absolute column sum norm and is defined by ||A||_1=max_(j)sum_(i=1)^n|a_(ij)| for a matrix A. This matrix norm ...
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 ...
A pseudoinverse is a matrix inverse-like object that may be defined for a complex matrix, even if it is not necessarily square. For any given complex matrix, it is possible ...
A Redheffer matrix is a square (0,1)-matrix with elements a_(ij) equal to 1 if j=1 or i|j (i divides j), and 0 otherwise. For n=1, 2, ..., the first few Redheffer matrices ...
Consider the characteristic equation |lambdaI-A|=lambda^n+b_1lambda^(n-1)+...+b_(n-1)lambda+b_n=0 (1) determining the n eigenvalues lambda of a real n×n square matrix A, ...
Let A be an n×n matrix over a field F. Using the three elementary row and column operations over elements in the field, the n×n matrix xI-A with entries from the principal ...
A solvable Lie group is a Lie group G which is connected and whose Lie algebra g is a solvable Lie algebra. That is, the Lie algebra commutator series ...
The Sombor matrix A_(Sombor) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the graph. In ...
A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...
1 ... 28|29|30|31|32|33|34 ... 79 Previous Next

...