Results 41 to 50 of about 1,935 (133)
One-site density matrix renormalization group and alternating minimum energy algorithm
, 2013 Given in the title are two algorithms to compute the extreme eigenstate of a high-dimensional Hermitian matrix using the tensor train (TT) / matrix product states (MPS) representation.
E. Jeckelmann +7 more
core +1 more source
Special Matrices, 2019 Given a combinatorially symmetric matrix A whose graph is a tree T and its eigenvalues, edges in T can be classified in four categories, based upon the change in geometric multiplicity of a particular eigenvalue, when the edge is removed.
Toyonaga Kenji
doaj +1 more source
Power Partial Isometry Index and Ascent of a Finite Matrix [PDF]
, 2013 We give a complete characterization of nonnegative integers $j$ and $k$ and a positive integer $n$ for which there is an $n$-by-$n$ matrix with its power partial isometry index equal to $j$ and its ascent equal to $k$.
Gau, Hwa-Long, Wu, Pei Yuan
core
On the minimum spectral radius of connected graphs of given order and size
Special MatricesIn this article, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size.
Cioaba Sebastian M. +2 more
doaj +1 more source
Changes in signature induced by the Lyapunov mapping LA : X → AX + XAA±
, 1989 International Journal of Mathematics and Mathematical Sciences, Volume 12, Issue 3, Page 503-506, 1989.
Tyler Haynes
wiley +1 more source
Bordering method to compute Core-EP inverse
Special Matrices, 2018 Following the work of Kentaro Nomakuchi[10] and Manjunatha Prasad et.al., [7] which relate various generalized inverses of a given matrix with suitable bordering,we describe the explicit bordering required to obtain core-EP inverse, core-EP generalized ...
Prasad K. Manjunatha, Raj M. David
doaj +1 more source
A Geršgorin-type eigenvalue localization set with n parameters for stochastic matrices
Open Mathematics, 2018 A set in the complex plane which involves n parameters in [0, 1] is given to localize all eigenvalues different from 1 for stochastic matrices. As an application of this set, an upper bound for the moduli of the subdominant eigenvalues of a stochastic ...
Wang Xiaoxiao, Li Chaoqian, Li Yaotang
doaj +1 more source
Open Mathematics, 2016 Some convergent sequences of the lower bounds of the minimum eigenvalue for the Hadamard product of a nonsingular M-matrix B and the inverse of a nonsingular M-matrix A are given by using Brauer’s theorem.
Zhao Jianxing, Sang Caili
doaj +1 more source
Special Matrices, 2017 We take as given a real symmetric matrix A, whose graph is a tree T, and the eigenvalues of A, with their multiplicities. Each edge of T may then be classified in one of four categories, based upon the change in multiplicity of a particular eigenvalue ...
Toyonaga Kenji, Johnson Charles R.
doaj +1 more source
Fractional Revival of Threshold Graphs Under Laplacian Dynamics
Discussiones Mathematicae Graph Theory, 2020 We consider Laplacian fractional revival between two vertices of a graph X. Assume that it occurs at time τ between vertices 1 and 2. We prove that for the spectral decomposition L=∑r=0qθrErL = \sum\nolimits_{r = 0}^q {{\theta _r}{E_r}} of the Laplacian
Kirkland Steve, Zhang Xiaohong
doaj +1 more source