The k.p. method for electronic structure of semiconductors

Download
014606.pdf
1991
Nassar, Ahmad
Show full item record
86
views
0
downloads
https://hdl.handle.net/11511/3730
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

The K.P. method.
Akıncı, Gülden; Department of Physics (1976)
The method of lines solution of discrete ordinates method for Nongray media experimental
Çayan, Fatma Nihan; Selçuk, Nevin; Department of Chemical Engineering (2006)
A radiation code based on method of lines (MOL) solution of discrete ordinates method (DOM) for the prediction of radiative heat transfer in nongray absorbing-emitting media was developed by incorporation of two different gas spectral radiative property models, namely wide band correlated-k (WBCK) and spectral line-based weighted sum of gray gases (SLW) models. Predictive accuracy and computational efficiency of the developed code were assessed by applying it to the predictions of source term distributions ...
The Laguerre pseudospectral method for the reflection symmetric Hamiltonians on the real line
Taşeli, Hasan (Springer Science and Business Media LLC, 2007-05-01)
Hermite-Weber functions provide a natural expansion basis for the numerical treatment of the Schrodinger equation on the whole real line. For the reflection symmetric Hamiltonians, however, it is shown here that the transformation of the problem over the half line and use of a Laguerre basis is computationally much more efficient in a pseudospectral scheme.
The method of lines solution of discrete ordinates method for non-grey media
Cayan, Fatma Nihan; Selçuk, Nevin (2007-03-01)
A radiation code based on method of lines (MOL) solution of discrete ordinates method (DOM) for radiative heat transfer in non-grey absorbing-emitting media was developed by incorporation of a gas spectral radiative property model, namely wide band correlated-k (WBCK) model, which is compatible with MOL solution of DOM. Predictive accuracy of the code was evaluated by applying it to 1-D parallel plate and 2-D axisymmetric cylindrical enclosure problems containing absorbing-emitting medium and benchmarking i...
The Floyd-Warshall all-pairs shortest paths algorithm for disconnected and very sparse graphs
Toroslu, İsmail Hakkı (2023-01-01)
The Floyd-Warshall algorithm is the most popular algorithm for determining the shortest paths between all vertex pairs in a graph. It is a very simple and an elegant algorithm. However, for graphs without any negative weighted edges, using Dijkstra's shortest path algorithm for every vertex as a source vertex to produce all-pairs shortest paths works significantly better than the Floyd-Warshall algorithm, especially for large graphs. Furthermore, for graphs with negative weighted edges, with no negative cyc...
Citation Formats
A. Nassar, “The k.p. method for electronic structure of semiconductors,” Middle East Technical University, 1991.
METU IIS - Integrated Information Service open@metu.edu.tr