اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMatrix algorithm for solving Schroedinger equations with position-dependent mass or complex optical potentials
95
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are neither Hermitian nor PT symmetric and thus allows to investigate whether or not the spectra in such cases are still real. Furthermore, the approach is especially useful for problems in which a position-dependent mass is adopted, for example in effective-mass models in solid-state physics or in the approximate treatment of coupled nuclear motion in molecular physics or quantum chemistry. The performance of the algorithm is demonstrated by considering the inversion motion of different isotopes of ammonia molecules within a position-dependent-mass model and some other examples of one- and two-dimensional Hamiltonians that allow for the comparison to analytical or numerical results in the literature.
قيم البحث
اقرأ أيضاً
The following comparison rules for the discrete spectrum of the position-dependent mass (PDM) Schroedinger equation are established. (i) If a constant mass $m_0$ and a PDM $m(x)$ are ordered everywhere, that is either $m_0leq m(x)$ or $m_0geq m(x)$,
then the corresponding eigenvalues of the constant-mass Hamiltonian and of the PDM Hamiltonian with the same potential and the BenDaniel-Duke ambiguity parameters are ordered. (ii) The corresponding eigenvalues of PDM Hamiltonians with the different sets of ambiguity parameters are ordered if $ abla^2 (1/m(x))$ has a definite sign. We prove these statements by using the Hellmann-Feynman theorem and offer examples of their application.
Cooling methods and particle slowers as well as accelerators are basic tools for fundamental research and applications in different fields and systems. We put forward a generic mechanism to scale the momentum of a particle, regardless of its initial
position and momentum, by means of a transient harmonic potential. The design of the time-dependent frequency makes use of a linear invariant and inverse techniques drawn from shortcuts to adiabaticity. The timing of the process may be decided beforehand and its influence on the system evolution and final features is analyzed. We address quantum systems but the protocols found are also valid for classical particles. Similar processes are possible as well for position scaling.
We study the $(1+1)$ dimensional generalized Dirac oscillator with a position-dependent mass. In particular, bound states with zero energy as well as non zero energy have been obtained for suitable choices of the mass function/oscillator interaction.
It has also been shown that in the presence of an electric field, bound states exist if the magnitude of the electric field does not exceed a critical value.
We study wave equations with energy dependent potentials. Simple analytical models are found useful to illustrate difficulties encountered with the calculation and interpretation of observables. A formal analysis shows under which conditions such equ
ations can be handled as evolution equation of quantum theory with an energy dependent potential. Once these conditions are met, such theory can be transformed into ordinary quantum theory.
This paper introduces and analyzes a preconditioned modified of the Hermitian and skew-Hermitian splitting (PMHSS). The large sparse continuous Sylvester equations are solved by PMHSS iterative algorithm based on nonHermitian, complex, positive defin
ite/semidefinite, and symmetric matrices. We prove that the PMHSS is converged under suitable conditions. In addition, we propose an accelerated PMHSS method consisting of two preconditioned matrices and two iteration parameters {alpha}, b{eta}. Theoretical analysis showed that the convergence speed of the accelerated PMHSS is faster compared to the PMHSS. Also, the robustness and efficiency of the proposed two iterative algorithms were demonstrated in numerical experiments.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
