On the conditions for a Hamiltonian matrix to have an eigen-value density with some prescribed characteristics
نویسندگان
چکیده
منابع مشابه
On the distance from a matrix polynomial to matrix polynomials with two prescribed eigenvalues
Consider an n × <span style="fon...
متن کاملon the distance from a matrix polynomial to matrix polynomials with two prescribed eigenvalues
consider an n × n matrix polynomial p(λ). a spectral norm distance from p(λ) to the set of n × n matrix polynomials that havea given scalar µ ∈ c as a multiple eigenvalue was introducedand obtained by papathanasiou and psarrakos. they computedlower and upper bounds for this distance, constructing an associated perturbation of p(λ). in this paper, we extend this resultto the case of two given di...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملPerturbation of an Eigen-value from a Dense Point Spectrum: a General Floquet Hamiltonian
We consider a perturbed Floquet Hamiltonian −i∂t + H + βV (ωt) in the Hilbert space L([0, T ],H, dt). Here H is a self-adjoint operator in H with a discrete spectrum obeying a growing gap condition, V (t) is a symmetric bounded operator in H depending on t 2π-periodically, ω = 2π/T is a frequency and β is a coupling constant. The spectrum Spec(−i∂t + H) of the unperturbed part is pure point and...
متن کاملSome sufficient conditions on Hamiltonian digraph
Z-mapping graph is a balanced bipartite graph G of a digraph D by split each vertex of D into a pair of vertices of G. Based on the property of the G, it is proved that if D is strong connected and G is Hamiltonian, then D is Hamiltonian. It is also proved if D is Hamiltonian, then G contains at least a perfect matching. Thus some existence sufficient conditions for Hamiltonian digraph and Hami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1976
ISSN: 0377-0427
DOI: 10.1016/0771-050x(76)90046-2