Results 91 to 100 of about 244 (170)
On the spectrum of tridiagonal matrices with two-periodic main diagonal
We find the spectrum and eigenvectors of an arbitrary irreducible complex tridiagonal matrix with two-periodic main diagonal. This is expressed in terms of the spectrum and eigenvectors of the matrix with the same sub- and superdiagonals and zero main ...
Dyachenko Alexander, Tyaglov Mikhail
doaj +1 more source
If A Matrix Has Only A Single Eigenvalue How Sensitive Is This Eigenvalue?
. For matrices with a single eigenvalue we analyse the sensitivity of the eigenvalue to perturbations in the matrix. We derive a closed form result that is similar in spirit to an analytical result by Lidskii; improve a bound by Henrici; and express the ...
Grace E. Cho, Ilse C.F. Ipsen
core
Distribution eigenvalues and temperature index of graphs
Let GG be a simple graph on nn vertices with degree sequence d1,…,dn{d}_{1},\ldots ,{d}_{n}. Fajtlowicz (On conjectures of Graffiti, Discrete Math. 72 (1988), 113–118) defined the temperature of a vertex vv of GG as dn−d\frac{d}{n-d}, where dd is the ...
Oboudi Mohammad Reza
doaj +1 more source
Spectral neighbor joining for reconstruction of latent tree Models. [PDF]
Jaffe A +5 more
europepmc +1 more source
An Overview Of Relative sin Theta Theorems For Invariant Subspaces Of Complex Matrices
. Relative perturbation bounds for invariant subspaces of complex matrices are reviewed, with emphasis on bounding the sines of the largest principal angle between two subspaces, i.e. sin \Theta theorems.
Ilse C. F. Ipsen
core
Eigenfunctions on an infinite Schrödinger network
In this article, we show that there is a one-to-one correspondence between the eigenfunctions associated with the perturbed Laplacian operator Δq{\Delta }_{q} on a Schrödinger infinite network {X,t,q}\{X,t,q\} with weight function q(a)q\left(a) and the ...
Bajunaid Ibtesam +2 more
doaj +1 more source
Infinite Eigenvalues and the QZ Algorithm
The implicitly shifted (bulge chasing ) QZ algorithm is the most popular method for solving the generalized eigenvalue problem Av = Bv. This paper explains why the QZ algorithm functions well even in the presence of infinite eigenvalues. The key to rapid
David S. Watkins, Preprint Sfb
core
Perron-Frobenius and Krein-Rutman theorems for tangentially positive operators
Kanigowski Adam, Kryszewski Wojciech
doaj +1 more source
Una condición recursiva para el problema inverso del autovalor para matrices simétricas no negativas
. In this paper we present a sufficient ondition and a necessary condition for Symmetri Nonnegative Inverse Eigenvalue Problem. This condition is independent of the existing realizability criteria.
Lenes, Eber +2 more
core
On the Harary Estrada index of graphs
Let GG be a connected graph with nn vertices v1,…,vn{v}_{1},\ldots ,{v}_{n}. The Harary matrix of GG, denoted by H(G)H\left(G), is an n×nn\times n matrix with a zero main diagonal, where the (i,j)\left(i,j)-entry is 1d(vi,vj)\frac{1}{d\left({v}_{i},{v}_ ...
Oboudi Mohammad Reza
doaj +1 more source

