IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v238y2025icp45-64.html
   My bibliography  Save this article

Convergence analysis of a Schrödinger problem with moving boundary

Author

Listed:
  • Alfaro Vigo, Daniel G.
  • Gomes, Daniele C.R.
  • do Carmo, Bruno A.
  • Rincon, Mauro A.

Abstract

In this article, we present the mathematical analysis of the convergence of the linearized Crank–Nicolson Galerkin method for a nonlinear Schrödinger problem related to a domain with a moving boundary. The convergence analysis of the numerical method is carried out for both semidiscrete and fully discrete problems. We establish an optimal error estimate in the L2-norm with order O(τ2+hs),2≤s≤r, where h is the finite element mesh size, τ is the time step, and r−1 represents the degree of the finite element polynomial basis. Numerical simulations are provided to confirm the consistency between theoretical and numerical results, validating the method and the order of convergence for different degrees p≥1 of the Lagrange polynomials and also for Hermite polynomials (degree p=3), which form the basis of the approximate solution.

Suggested Citation

  • Alfaro Vigo, Daniel G. & Gomes, Daniele C.R. & do Carmo, Bruno A. & Rincon, Mauro A., 2025. "Convergence analysis of a Schrödinger problem with moving boundary," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 238(C), pages 45-64.
    • Handle: RePEc:eee:matcom:v:238:y:2025:i:c:p:45-64
    DOI: 10.1016/j.matcom.2025.04.042
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425001806
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2025.04.042?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:238:y:2025:i:c:p:45-64. 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.