<?xml version="1.0"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-28T20:28:47Z</responseDate><request verb="GetRecord" metadataPrefix="oai_dc">https://keep.lib.asu.edu/oai/request</request><GetRecord><record><header><identifier>oai:keep.lib.asu.edu:node-158866</identifier><datestamp>2024-12-23T18:01:48Z</datestamp><setSpec>oai_pmh:all</setSpec><setSpec>oai_pmh:repo_items</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>158866</dc:identifier>
          <dc:identifier>https://hdl.handle.net/2286/R.I.63056</dc:identifier>
                  <dc:rights>http://rightsstatements.org/vocab/InC/1.0/</dc:rights>
                  <dc:date>2020</dc:date>
                  <dc:format>82 pages</dc:format>
                  <dc:type>Masters Thesis</dc:type>
          <dc:type>Academic theses</dc:type>
          <dc:type>Text</dc:type>
                  <dc:language>eng</dc:language>
                  <dc:contributor>Baikadi, Pranay Kumar Reddy</dc:contributor>
          <dc:contributor>Vasileska, Dragica</dc:contributor>
          <dc:contributor>Goodnick, Stephen</dc:contributor>
          <dc:contributor>Povolotskyi, Mykhailo</dc:contributor>
          <dc:contributor>Arizona State University</dc:contributor>
                  <dc:description>Masters Thesis Electrical Engineering 2020</dc:description>
          <dc:description>The quest to find efficient algorithms to numerically solve differential equations isubiquitous in all branches of computational science. A natural approach to address&lt;br/&gt;this problem is to try all possible algorithms to solve the differential equation and&lt;br/&gt;choose the one that is satisfactory to one&#039;s needs. However, the vast variety of algorithms&lt;br/&gt;in place makes this an extremely time consuming task. Additionally, even&lt;br/&gt;after choosing the algorithm to be used, the style of programming is not guaranteed&lt;br/&gt;to result in the most efficient algorithm. This thesis attempts to address the same&lt;br/&gt;problem but pertinent to the field of computational nanoelectronics, by using PETSc&lt;br/&gt;linear solver and SLEPc eigenvalue solver packages to efficiently solve Schrödinger&lt;br/&gt;and Poisson equations self-consistently.&lt;br/&gt;In this work, quasi 1D nanowire fabricated in the GaN material system is considered&lt;br/&gt;as a prototypical example. Special attention is placed on the proper description&lt;br/&gt;of the heterostructure device, the polarization charges and accurate treatment of the&lt;br/&gt;free surfaces. Simulation results are presented for the conduction band profiles, the&lt;br/&gt;electron density and the energy eigenvalues/eigenvectors of the occupied sub-bands&lt;br/&gt;for this quasi 1D nanowire. The simulation results suggest that the solver is very&lt;br/&gt;efficient and can be successfully used for the analysis of any device with two dimensional&lt;br/&gt;confinement. The tool is ported on www.nanoHUB.org and as such is freely&lt;br/&gt;available.</dc:description>
                  <dc:subject>Electrical Engineering</dc:subject>
          <dc:subject>Computational Physics</dc:subject>
          <dc:subject>AlGaN-GaN</dc:subject>
          <dc:subject>Heterostructures</dc:subject>
          <dc:subject>PETSc</dc:subject>
          <dc:subject>Schrödinger-Poisson solver</dc:subject>
          <dc:subject>self-consistent</dc:subject>
          <dc:subject>SLEPc</dc:subject>
                  <dc:title>Efficient Schrödinger-Poisson Solvers for Quasi 1D Systems That Utilize PETSc and SLEPc</dc:title></oai_dc:dc></metadata></record></GetRecord></OAI-PMH>
