MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Guaranteed global optimization of thin-film optical systems

Author(s)
Azunre, Paul; Jean, Joel; Rotschild, Carmel; Bulovic, Vladimir; Johnson, Steven G; Baldo, Marc A; ... Show more Show less
Thumbnail
DownloadPublished version (2.340Mb)
Terms of use
Creative Commons Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/
Metadata
Show full item record
Abstract
© 2019 The Author(s). Published by IOP Publishing Ltd on behalf of the Institute of Physics and Deutsche Physikalische Gesellschaft. A parallel deterministic global optimization algorithm for thin-film multilayer optical coatings is developed. This algorithm enables locating a global solution to an optimization problem in this class to within a user-specified tolerance. More specifically, the algorithm is a parallel branch-And-bound method with applicable bounds on the merit function computed using Taylor models. This study is the first one, to the best of our knowledge, to attempt guaranteed global optimization of this important class of problems, thereby providing an overview and an assessment of the current state of such techniques in this domain. As a proof of concept on a small scale, the method is illustrated numerically and experimentally in the context of antireflection coatings for silicon solar cells-we design and fabricate a three-layer dielectric stack on silicon that exhibits an average reflectance of (2.53 0.10)%, weighted over a broad range of incident angles and the solar spectrum. The practicality of our approach is assessed by comparing its computational cost relative to traditional stochastic global optimization techniques which provide no guarantees on their solutions. While our method is observed to be significantly more computationally expensive, we demonstrate via our proof of concept that it is already feasible to optimize sufficiently simple practical problems at a reasonable cost, given the current accessibility of cloud computing resources. Ongoing advances in distributed computing are likely to bring more design problems within the reach of deterministic global optimization methods, yielding rigorous guaranteed solutions in the presence of practical manufacturing constraints.
Date issued
2019
URI
https://hdl.handle.net/1721.1/135557
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
Journal
New Journal of Physics
Publisher
IOP Publishing

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.