Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees.
Mikhail V. GoubkoAlexander VeremyevPublished in: Discret. Appl. Math. (2021)
Keyphrases
- singular value decomposition
- distance matrix
- singular values
- weighted distance
- coefficient matrix
- square matrices
- matrix representation
- positive definite
- eigenvalues and eigenvectors
- linear algebra
- perturbation theory
- quadratic form
- measurement matrix
- projection matrices
- data matrix
- low rank
- tree edit distance
- correlation matrix
- projection matrix
- positive semidefinite
- decision trees
- sparse matrix
- symmetric positive definite
- block diagonal
- distance measure
- matrix multiplication
- pseudo inverse
- heat kernel
- low rank approximation
- factorization method
- least squares
- null space
- low rank matrix
- linear complementarity problem
- euclidean distance
- edge detection
- dimensionality reduction
- spectral decomposition
- weight matrix
- laplacian matrix
- matrix inversion
- matrix factorization
- distance transform
- weighted graph
- distance function
- sparse matrices
- semidefinite