Results 21 to 30 of about 3,732,510 (304)
On Matrix Nearness Problems: Distance to Delocalization [PDF]
This paper introduces two new matrix nearness problems that are intended to generalize the distance to instability and the distance to stability. They are named the distance to delocalization and the distance to localization due to their applicability in analyzing the robustness of eigenvalues with respect to arbitrary localization sets (domains) in ...
Vladimir R. Kostic +2 more
openaire +3 more sources
Distance (signless) Laplacian spectrum of dumbbell graphs [PDF]
In this paper, we determine the distance Laplacian and distance signless Laplacian spectrum of generalized wheel graphs and a new class of graphs called dumbbell graphs.
Sakthidevi Kaliyaperumal +1 more
doaj +1 more source
Bounds for the Distance to the Nearest Correlation Matrix [PDF]
Summary: In a wide range of practical problems correlation matrices are formed in such a way that, while symmetry and a unit diagonal are ensured, they may lack semidefiniteness. We derive a variety of new upper bounds for the distance from an arbitrary symmetric matrix to the nearest correlation matrix.
Nicholas J. Higham, Natasa Strabic
openaire +3 more sources
matrix-toolbox/CHM_CATALOG: v2.2.0
Sinkhorn matrices, symmetric and Hermitian ...
matrix-toolbox
core +1 more source
On the distance eigenvalues of Cayley graphs
In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Use of Dynamic Time Warping for Description of Combustion Process in a Biomass Boiler
The efficient biomass energy use is a key prerequisite for the implementation of renewable energy development strategies on a regional level. For the highly efficient energy use in the combustion process, it is necessary to properly regulate the process ...
Kucín Martin +3 more
doaj +1 more source
Determining finite connected graphs along the quadratic embedding constants of paths
The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two.
Edy Tri Baskoro, Nobuaki Obata
doaj +1 more source
matrix-toolbox/CHM_scripts: Sinkhorn Algorithm
Several CHM matrices (M-scripts) obtained by the Sinkhorn Algorithm are ...
matrix-toolbox
core +1 more source

