Semi-spectral Chebyshev method in quantum mechanics
نویسندگان
چکیده
منابع مشابه
Semi-spectral Chebyshev method in Quantum Mechanics
Traditionally, finite differences and finite element methods have been by many regarded as the basic tools for obtaining numerical solutions in a variety of quantum mechanical problems emerging in atomic, nuclear and particle physics, astrophysics, quantum chemistry, etc. In recent years, however, an alternative technique based on the semi-spectral methods has focused considerable attention. Th...
متن کاملSuperconvergence of a Chebyshev Spectral Collocation Method
We reveal the relationship between a Petrov–Galerkin method and a spectral collocation method at the Chebyshev points of the second kind (±1 and zeros of Uk) for the two-point boundary value problem. Derivative superconvergence points are identified as the Chebyshev points of the first kind (Zeros of Tk). Super-geometric convergent rate is established for a special class of solutions.
متن کاملStructure-Activity Relationship of Imidazobenzodiazepines, an AM1 Semi-Empirical Quantum Mechanics Study
Conformations and electronic properties of a series of imidazobenzodiazepines are investigated by AM1 semi-empirical quantum mechanics method. It is shown that substitution of Cl in position 7 instead of 8, changes the geometry of the seven membered lactam ring; this may put the N5 nitrogen in a better positon to act as a hydrogen bond acceptor, and the phenyl ring in position 6 is probably...
متن کاملOn the spectral viscosity method in multidomain Chebyshev discretizations
This paper describes how one can use the spectral vanishing viscosity method pro posed by Tadmor in multidomain solution of hyperbolic systems Interface conditions are derived using a variational approach and open boundary conditions are derived using the approach used in for incomplete parabolic systems Introduction Filtering of the solution is a very common technique when using spectral metho...
متن کاملChebyshev semi-iteration in Preconditioning
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterative methods. When the solution of a linear system with a symmetric and positive definite coefficient matrix is required then the Conjugate Gradient method will compute the optimal approximate solution from the appropriate Krylov subspace, that is, it will implicitly compute the optimal polynomial. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Physics
سال: 2007
ISSN: 0003-4916
DOI: 10.1016/j.aop.2006.07.004