IDEAS home Printed from https://ideas.repec.org/a/alk/ijbpcs/v8y2026i2id13484.html

A Numerical Approach to Bound-State Eigenvalues of the One-Dimensional Finite Square Quantum Well

Author

Listed:
  • Mohammad Muhsen Hewadmal

    (Department of Physics, Education Faculty, Badakhshan University, Badakhshan, Afghanistan)

  • Khudaidad Wasiq

    (Department of Physics, Education Faculty, Badakhshan University, Badakhshan, Afghanistan)

  • Sayed Abdul Saboor Mosamem

    (Department of Physics, Education Faculty, Baghlan University, Baghlan, Afghanistan)

Abstract

The one-dimensional finite quantum well is one of the fundamental problems in quantum mechanics, illustrating the formation of bound states, the penetration of the wave function into classically forbidden regions, and the quantization of energy. Unlike the infinite potential well, the finite quantum well requires the solution of transcendental equations, which cannot be solved analytically. This study presents the derivation of the transcendental equations for a finite quantum well, and their numerical solution through an implementation in the Fortran programming language. The transcendental equations were derived by analyzing the Schrödinger equation inside and outside the potential well. These equations were then solved using the Newton–Raphson method, leading to the development of an algorithm for determining the energies of the bound states. The algorithm was implemented as a Fortran program and compiled to obtain the roots of the transcendental equations for a quantum well of depth and 2nm width, which were subsequently used to calculate the corresponding energy eigenvalues. The obtained results show excellent agreement with theoretical predictions. This efficient and portable implementation is suitable for educational and research applications in computational physics.

Suggested Citation

Handle: RePEc:alk:ijbpcs:v:8:y:2026:i:2:id:13484
DOI: 10.32996/ijbpcs.2026.8.23
as

Download full text from publisher

File URL: https://al-kindipublisher.com/index.php/ijbpcs/article/view/13484
File Function: Abstract page
Download Restriction: no

File URL: https://al-kindipublisher.com/index.php/ijbpcs/article/download/13484/12251
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.32996/ijbpcs.2026.8.23?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
---><---

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:alk:ijbpcs:v:8:y:2026:i:2:id:13484. 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: Al-Kindi Center for Research and Development (email available below). General contact details of provider: https://al-kindipublisher.com/index.php/ijbpcs .

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.