Results 31 to 40 of about 596,753 (209)
The bipartite Laplacian matrix of a nonsingular tree
Special Matrices, 2023 For a bipartite graph, the complete adjacency matrix is not necessary to display its adjacency information. In 1985, Godsil used a smaller size matrix to represent this, known as the bipartite adjacency matrix.
Bapat Ravindra B. +2 more
doaj +1 more source
Distance spectrum and energy in single valued neutrosophic graphs [PDF]
Neutrosophic Sets and SystemsThis study introduces the concept of distance matrix and distance energy in the context of single valued neutrosophic graphs (SVNGs), which extend classical graph theory by incorporating uncertainty and indeterminacy through neutrosophic sets.
A. S. Sasipriya, Lakshmi Madireddy
doaj +1 more source
Genalex-distance-matrix-and-PCA
, 2017 Distance matrix input file for the program GenAlEx, and output from PCA analysis using default ...
Oyler-McCance, Sara J. +7 more
core +1 more source
A semismooth newton method for the nearest Euclidean distance matrix problem
, 2013 The Nearest Euclidean distance matrix problem (NEDM) is a fundamentalcomputational problem in applications such asmultidimensional scaling and molecularconformation from nuclear magnetic resonance data in computational chemistry.Especially in the latter ...
Qi, Houduo
core +1 more source
Proceedings of the International Conference on Applied Innovations in IT, 2018 The process automation is one of the effective approaches to process management based on the use of information technology at the present stage of the society development.
Julia Dubrovskaya +3 more
doaj +1 more source
An algorithm for computing the distance to uncontrollability
, 1991 Elsner L, He C. An algorithm for computing the distance to uncontrollability. Systems & Control Letters. 1991;17(6):453-464.In this paper, we present an algorithm to compute the distance to uncontrollability.
He, Chunyang, Elsner, Ludwig
core +1 more source
The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue
, 2008 For a matrix polynomial P(λ) and a given complex number μ, we introduce a (spectral norm) distance from P(λ) to the matrix polynomials that have μ as an eigenvalue of geometric multiplicity at least κ, and a distance from P(λ) to the matrix polynomials ...
Papathanasiou, Nikolaos +3 more
core +1 more source
Random matrix-improved estimation of covariance matrix distances [PDF]
Journal of Multivariate Analysis, 2019 Given two sets $x_1^{(1)},\ldots,x_{n_1}^{(1)}$ and $x_1^{(2)},\ldots,x_{n_2}^{(2)}\in\mathbb{R}^p$ (or $\mathbb{C}^p$) of random vectors with zero mean and positive definite covariance matrices $C_1$ and $C_2\in\mathbb{R}^{p\times p}$ (or $\mathbb{C}^{p\times p}$), respectively, this article provides novel estimators for a wide range of distances ...
Couillet, Romain +3 more
openaire +3 more sources
, 2022 The supplemental data includes distance matrix images (grayscale, PNG format) and a Matlab script. (DOC)
Nuwan Tharanga Attygalle (12046997) +1 more
core +1 more source
Distance Matrix of a Class of Completely Positive Graphs: Determinant and Inverse
Special Matrices, 2020 A real symmetric matrix A is said to be completely positive if it can be written as BBt for some (not necessarily square) nonnegative matrix B. A simple graph G is called a completely positive graph if every matrix realization of G that is both ...
Das Joyentanuj +2 more
doaj +1 more source