IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v247y2026icp225-243.html

Relaxation Crank–Nicolson compact finite difference schemes for Schrödinger–Poisson systems

Author

Listed:
  • Cui, Mingrong

Abstract

Relaxation Crank–Nicolson compact finite difference schemes for solving both one- and two dimensional Schrödinger–Poisson systems are given and analyzed in this paper. Using the idea of relaxation scheme, that is, after introducing an auxiliary variable, we get an additional equation that decouples the nonlinear term in the original system. We discretize the time derivative by Crank–Nicolson scheme with the newly added variable approximated on the staggered time mesh, while compact finite differences are employed to approximate the second-order spatial derivatives, then we obtain the fully discrete relaxation Crank–Nicolson compact finite difference schemes. The resulting linear relaxation schemes have the properties of discrete mass conservation and discrete energy conservation. Numerical experiments demonstrate second-order accuracy in time and fourth-order accuracy in space, confirming the accuracy and efficiency of the proposed algorithm.

Suggested Citation

  • Cui, Mingrong, 2026. "Relaxation Crank–Nicolson compact finite difference schemes for Schrödinger–Poisson systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 247(C), pages 225-243.
    • Handle: RePEc:eee:matcom:v:247:y:2026:i:c:p:225-243
    DOI: 10.1016/j.matcom.2026.03.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475426000959
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2026.03.014?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:247:y:2026:i:c:p:225-243. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.