Showing papers by "Peter M. Young published in 1992"
TL;DR: In this article, the band-to-band Auger and radiative recombination lifetimes of the recently proposed InxGa1−xSb/InAs superlattices (SL) were investigated.
Abstract: Calculations of band‐to‐band Auger and radiative recombination lifetimes of the recently proposed InxGa1−xSb/InAs superlattices (SL) show them to be promising infrared detectors. Several superlattices with energy gaps in the 5–11 μm range exhibit suppressed p‐type Auger recombination rates due to a large light hole–heavy hole splitting. The p‐type Auger lifetime at 77 K of an 11 μm InxGa1−xSb/InAs SL is found to be, respectively, three and five orders of magnitude longer than those of bulk and superlattice HgCdTe with the same energy gap. The n‐type lifetimes are comparable.
159 citations
24 Jun 1992
TL;DR: It appears that one can handle medium size problems (less than 100 perturbations) with reasonable computational requirements, both in terms of accuracy of the resulting bounds, and growth rate in required computation with problem size.
Abstract: Upper and lower bounds for the mixed μ problem have recently been developed, and this paper examines the computational aspects of these bounds. In particular a practical algorithm is developed to compute the bounds. This has been implemented as a Matlab function (m-file), and will be available shortly in a test version in conjunction with the μ-Tools toolbox. The algorithm performance is very encouraging, both in terms of accuracy of the resulting bounds, and growth rate in required computation with problem size. In particular it appears that one can handle medium size problems (less than 100 perturbations) with reasonable computational requirements.
108 citations
16 Dec 1992
TL;DR: In this article, it is shown that, despite its combinatoric nature, branch and bound techniques can give substantially improved solutions with only moderate computational cost, in many cases where the current approximate methods are unsatisfactory, improved solutions can be obtained.
Abstract: The computation of the general structural singular value ( mu ) is NP hard. Therefore, quick solutions to medium sized problems must often be approximate. In many of the cases where the current approximate methods are unsatisfactory, improved solutions can be obtained. It is shown that, despite its combinatoric nature, branch and bound techniques can give substantially improved solutions with only moderate computational cost. >
38 citations
16 Dec 1992
TL;DR: It is shown that the mixed mu lower bound can be addressed by means of a power algorithm, which is computationally inexpensive and developed, including a mixed power/inverse-power iteration that significantly enhances performance over the original scheme.
Abstract: Many robustness analysis problems can be reduced to that of computing the structured singular value, mu . The general mixed mu problem (i.e., including real uncertainty) is now known to be NP complete. This emphasizes the importance of computing good bounds. It is shown that the mixed mu lower bound can be addressed by means of a power algorithm, which is computationally inexpensive. A detailed study of this power algorithm is presented, and several modifications are developed, including a mixed power/inverse-power iteration. This leads to an adaptive power iteration that significantly enhances performance over the original scheme. >
17 citations