The algebraic Bethe Ansatz and vacuum vectors.
Dragović, Vladimir (1994)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Dragović, Vladimir (1994)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Vladimir Dragović (2012)
Publications de l'Institut Mathématique
Similarity:
Zagorodnyuk, S. M. (2011)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 15A29. In this paper we introduced a notion of the generalized spectral function for a matrix J = (gk,l)k,l = 0 Ґ, gk,l О C, such that gk,l = 0, if |k-l | > N; gk,k+N = 1, and gk,k-N № 0. Here N is a fixed positive integer. The direct and inverse spectral problems for such matrices are stated and solved. An integral representation for the generalized spectral function is obtained.
Xiaogen Chen (2015)
Special Matrices
Similarity:
Let B2m denote the Brualdi-Li matrix of order 2m, and let ρ2m = ρ(B2m ) denote the spectral radius of the Brualdi-Li Matrix. Then [...] . where m > 2, e = 2.71828 · · · , [...] and [...] .
Jorma K. Merikoski, Pentti Haukkanen, Mika Mattila, Timo Tossavainen (2018)
Special Matrices
Similarity:
Consider the recursion g0 = a, g1 = b, gn = gn−1 + gn−2, n = 2, 3, . . . . We compute the Frobenius norm of the r-circulant matrix corresponding to g0, . . . , gn−1. We also give three lower bounds (with equality conditions) for the spectral norm of this matrix. For this purpose, we present three ways to estimate the spectral norm from below in general.
Mostafa Mbekhta, Jaroslav Zemánek (2007)
Banach Center Publications
Similarity:
Irene Rousseau (2001)
Visual Mathematics
Similarity:
Lihua You, Yujie Shu, Xiao-Dong Zhang (2016)
Czechoslovak Mathematical Journal
Similarity:
We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance Laplacian spectral radius, the distance signless Laplacian spectral radius of an undirected graph or a digraph. These results are new or generalize some known results.
Sadkane, Miloud (2004)
Applied Mathematics E-Notes [electronic only]
Similarity:
Adam Czornik, Piotr Jurgas (2006)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this paper we show new formulas for the spectral radius and the spectral subradius of a set of matrices. The advantage of our results is that we express the spectral radius of any set of matrices by the spectral radius of a set of symmetric positive definite matrices. In particular, in one of our formulas the spectral radius is expressed by singular eigenvalues of matrices, whereas in the existing results it is expressed by eigenvalues.
E. N. Antoniou, Antonis I. G. Vardulakis, Nikolas P. Karampetakis (1998)
Kybernetika
Similarity:
In this paper we investigate the behavior of the discrete time AR (Auto Regressive) representations over a finite time interval, in terms of the finite and infinite spectral structure of the polynomial matrix involved in the AR-equation. A boundary mapping equation and a closed formula for the determination of the solution, in terms of the boundary conditions, are also gived.
D. Hinrichsen, A.J. Pritchard (1991/92)
Numerische Mathematik
Similarity:
Constantin Costara (2005)
Studia Mathematica
Similarity:
We give several characterizations of the symmetrized n-disc Gₙ which generalize to the case n ≥ 3 the characterizations of the symmetrized bidisc that were used in order to solve the two-point spectral Nevanlinna-Pick problem in ℳ ₂(ℂ). Using these characterizations of the symmetrized n-disc, which give necessary and sufficient conditions for an element to belong to Gₙ, we obtain necessary conditions of interpolation for the general spectral Nevanlinna-Pick problem. They also allow us...
Benalili, Mohammed, Lansari, Azzedine (2005)
Lobachevskii Journal of Mathematics
Similarity: