Search Results for ""

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...

A symmetric bilinear form on a vector space V is a bilinear function Q:V×V->R (1) which satisfies Q(v,w)=Q(w,v). For example, if A is a n×n symmetric matrix, then ...

The molecular topological index is a graph index defined by MTI=sum_(i=1)^nE_i, where E_i are the components of the vector E=(A+D)d, with A the adjacency matrix, D the graph ...

Given a set y=f(x) of n equations in n variables x_1, ..., x_n, written explicitly as y=[f_1(x); f_2(x); |; f_n(x)], (1) or more explicitly as {y_1=f_1(x_1,...,x_n); |; ...

The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...

An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...

The Wiener sum index WS is a graph index defined for a graph on n nodes by WS=1/2sum_(i=1)^nsum_(j=1)^n((d)_(ij))/((Omega)_(ij)), where (d)_(ij) is the graph distance matrix ...

The norm of a mathematical object is a quantity that in some (possibly abstract) sense describes the length, size, or extent of the object. Norms exist for complex numbers ...

For every even dimension 2n, the symplectic group Sp(2n) is the group of 2n×2n matrices which preserve a nondegenerate antisymmetric bilinear form omega, i.e., a symplectic ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...