Abstract
In this paper, we propose an efficient numerical scheme with linear complexity for the one-dimensional time-dependent Schrödinger equation on unbounded domains. The artificial boundary method is used to address the unboundedness of the domain. By applying the two-step backward difference formula for time discretization and performing the Z-transform, we derive an exact semi-discrete artificial boundary condition of the Dirichlet-to-Neumann type. To expedite the discrete temporal convolution involved in the exact semi-discrete artificial boundary conditions, we design a fast algorithm based on the best relative Chebyshev approximation of the square-root function. The Galerkin finite element method is used for spatial discretization. By introducing a constant damping term to the original Schrödinger equation, we present a complete error estimate for the fully discrete problem. Several numerical examples are provided to demonstrate the accuracy and efficiency of the proposed numerical scheme.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
