Mostrar el registro sencillo del ítem

dc.contributor.authorBlanes, Sergio
dc.contributor.authorCasas, Fernando
dc.contributor.authorMurua, Ander
dc.date.accessioned2016-06-07T10:46:14Z
dc.date.available2016-06-07T10:46:14Z
dc.date.issued2015-12
dc.identifier.citationBLANES, Sergio; CASAS, Fernando; MURUA, Ander. An efficient algorithm based on splitting for the time integration of the Schrödinger equation. Journal of Computational Physics, 2015, vol. 303, p. 396-412.ca_CA
dc.identifier.urihttp://hdl.handle.net/10234/160400
dc.description.abstractWe present a practical algorithm based on symplectic splitting methods intended for the numerical integration in time of the Schrödinger equation when the Hamiltonian operator is either time-independent or changes slowly with time. In the later case, the evolution operator can be effectively approximated in a step-by-step manner: first divide the time integration interval in sufficiently short subintervals, and then successively solve a Schrödinger equation with a different time-independent Hamiltonian operator in each of these subintervals. When discretized in space, the Schrödinger equation with the time-independent Hamiltonian operator obtained for each time subinterval can be recast as a classical linear autonomous Hamiltonian system corresponding to a system of coupled harmonic oscillators. The particular structure of this linear system allows us to construct a set of highly efficient schemes optimized for different precision requirements and time intervals. Sharp local error bounds are obtained for the solution of the linear autonomous Hamiltonian system considered in each time subinterval. Our schemes can be considered, in this setting, as polynomial approximations to the matrix exponential in a similar way as methods based on Chebyshev and Taylor polynomials. The theoretical analysis, supported by numerical experiments performed for different time-independent Hamiltonians, indicates that the new methods are more efficient than schemes based on Chebyshev polynomials for all tolerances and time interval lengths. The algorithm we present automatically selects, for each time subinterval, the most efficient splitting scheme (among several new optimized splitting methods) for a prescribed error tolerance and given estimates of the upper and lower bounds of the eigenvalues of the discretized version of the Hamiltonian operator.ca_CA
dc.description.sponsorShipThe authors acknowledge Ministerio de Economía y Competitividad (Spain) for Financial support through the coordinated project MTM2013-46553-C3. AM is additionally partially supported by the Basque Government (Consolidated Research Group IT649-13), and FC by NPRP GRANT #5-674-1-114 from the Qatar National Research Fund. We are grateful to the anonymous referees, whose comments have helped us to improve this paper.ca_CA
dc.format.extent16 p.ca_CA
dc.format.mimetypeapplication/pdfca_CA
dc.language.isoengca_CA
dc.publisherElsevierca_CA
dc.relation.isPartOfJournal of Computational Physics Volume 303, 15 December 2015ca_CA
dc.rightsCopyright © 2015 Elsevier Inc. All rights reserved.ca_CA
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/*
dc.subjectSymplectic splitting methodsca_CA
dc.subjectTime-dependent Schrödinger equationca_CA
dc.subjectError analysisca_CA
dc.titleAn efficient algorithm based on splitting for the time integration of the Schrödinger equationca_CA
dc.typeinfo:eu-repo/semantics/articleca_CA
dc.identifier.doihttp://dx.doi.org/10.1016/j.jcp.2015.09.047
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca_CA
dc.relation.publisherVersionhttp://www.sciencedirect.com/science/article/pii/S0021999115006555ca_CA
dc.type.versioninfo:eu-repo/semantics/sumittedVersion


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem