ترغب بنشر مسار تعليمي؟ اضغط هنا

A Jacobi Algorithm in Phase Space: Diagonalizing (skew-) Hamiltonian and Symplectic Matrices with Dirac-Majorana Matrices

77   0   0.0 ( 0 )
 نشر من قبل Christian Baumgarten
 تاريخ النشر 2020
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Jacobis method is a well-known algorithm in linear algebra to diagonalize symmetric matrices by successive elementary rotations. We report about the generalization of these elementary rotations towards canonical transformations acting in Hamiltonian phase spaces. This generalization allows to use Jacobis method in order to compute eigenvalues and eigenvectors of Hamiltonian (and skew-Hamiltonian) matrices with either purely real or purely imaginary eigenvalues by successive elementary symplectic decoupling-transformations.



قيم البحث

اقرأ أيضاً

For a two-parameter family of Jacobi matrices exhibiting first-order spectral phase transitions, we prove discreteness of the spectrum in the positive real axis when the parameters are in one of the transition boundaries. To this end we develop a met hod for obtaining uniform asymptotics, with respect to the spectral parameter, of the generalized eigenvectors. Our technique can be applied to a wide range of Jacobi matrices.
232 - Roland Abuaf , Ada Boralevi 2013
Using properties of skew-Hamiltonian matrices and classic connectedness results, we prove that the moduli space $M_{ort}^0(r,n)$ of stable rank $r$ orthogonal vector bundles on $mathbb{P}^2$, with Chern classes $(c_1,c_2)=(0,n)$, and trivial splittin g on the general line, is smooth irreducible of dimension $(r-2)n-{r choose 2}$ for specific values of $r$ and $n$.
188 - Albert Much 2018
By using the quasi-determinant the construction of Gelfand et al. leads to the inverse of a matrix with noncommuting entries. In this work we offer a new method that is more suitable for physical purposes and motivated by deformation quantization, wh ere our constructed algorithm emulates the commutative case and in addition gives corrections coming from the noncommutativity of the entries. Furthermore, we provide an equivalence of the introduced algorithm and the construction via quasi-determinants.
We are interested in the phenomenon of the essential spectrum instability for a class of unbounded (block) Jacobi matrices. We give a series of sufficient conditions for the matrices from certain classes to have a discrete spectrum on a half-axis of a real line. An extensive list of examples showing the sharpness of obtained results is provided.
104 - B. Konya , G. Levai , Z. Papp 1997
We propose two ways for determining the Greens matrix for problems admitting Hamiltonians that have infinite symmetric tridiagonal (i.e. Jacobi) matrix form on some basis representation. In addition to the recurrence relation comming from the Jacobi- matrix, the first approach also requires the matrix elements of the Greens operator between the first elements of the basis. In the second approach the recurrence relation is solved directly by continued fractions and the solution is continued analytically to the whole complex plane. Both approaches are illustrated with the non-trivial but calculable example of the D-dimensional Coulomb Greens matrix. We give the corresponding formulas for the D-dimensional harmonic oscillator as well.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا