The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Rank decomposition in zero pattern matrix algebras”

An introduction to hierarchical matrices

Wolfgang Hackbusch, Lars Grasedyck, Steffen Börm (2002)

Mathematica Bohemica

Similarity:

We give a short introduction to a method for the data-sparse approximation of matrices resulting from the discretisation of non-local operators occurring in boundary integral methods or as the inverses of partial differential operators. The result of the approximation will be the so-called hierarchical matrices (or short ℋ -matrices). These matrices form a subset of the set of all matrices and have a data-sparse representation. The essential operations for these matrices (matrix-vector...

Reducing the adjacency matrix of a tree.

Fricke, Gerd H., Hedetniemi, Stephen T., Jacobs, David P., Trevisan, Vilmar (1996)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

Block distance matrices.

Balaji, R., Bapat, R.B. (2007)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix

Hiroshi Kurata, Ravindra B. Bapat (2016)

Special Matrices

Similarity:

By a hollow symmetric matrix we mean a symmetric matrix with zero diagonal elements. The notion contains those of predistance matrix and Euclidean distance matrix as its special cases. By a centered symmetric matrix we mean a symmetric matrix with zero row (and hence column) sums. There is a one-toone correspondence between the classes of hollow symmetric matrices and centered symmetric matrices, and thus with any hollow symmetric matrix D we may associate a centered symmetric matrix...