東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ null ]

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Accelerating Numerical Methods for Gradient-Based Photonic Optimization and Novel Plasmonic Functionalities.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Accelerating Numerical Methods for Gradient-Based Photonic Optimization and Novel Plasmonic Functionalities./
作者:	Zhao, Nathan Zhiwen.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2022,
面頁冊數:	194 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-11, Section: B.
Contained By:	Dissertations Abstracts International83-11B.
標題:	Sparsity. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29099823
ISBN:	9798426884991

Accelerating Numerical Methods for Gradient-Based Photonic Optimization and Novel Plasmonic Functionalities.
Zhao, Nathan Zhiwen.

Accelerating Numerical Methods for Gradient-Based Photonic Optimization and Novel Plasmonic Functionalities. - Ann Arbor : ProQuest Dissertations & Theses, 2022 - 194 p.

Source: Dissertations Abstracts International, Volume: 83-11, Section: B.

Thesis (Ph.D.)--Stanford University, 2022.

This item must not be sold to any third party vendors.

Optimizing the design and performance of photonic systems has been an active and growing area of research over the past decade with many practical applications such as image sensors, augmented reality and virtual reality, on-chip photonic systems, and more. Moreover, gradient-based methods, such as the adjoint variable method (AVM), have led to very distinctive and complex designs for on-chip multiplexers, tapers, dielectric laser accelerators, and more, while yielding much higher performance metrics which classical design approaches using first principles physics cannot match. However, less research has been dedicated in the photonics community to understanding and improving the underlying numerical methods which are critical for the success of these applications.In this thesis, we will demonstrate four key numerical advancements in the use of gradient-based design methods using frequency domain numerical solvers of Maxwell's equations, particularly finite difference frequency domain (FDFD) solvers. The first is the application of domain decomposition techniques to gradient-based optimization, allowing us to reduce the effective system size for a gain in efficiency. The second exploits the physics of perturbative series expansions to efficiently determine the optimal learning rate essential to gradient-based optimization. The third leverages the fundamental similarities of the previous two methods, allowing us to combine the two to achieve a further multiplicative acceleration. The fourth is exploiting the choice of boundary condition in the context of perfectly matched layers to minimize overhead and optimize the efficiency of the simulations required during the optimization procedure.Furthermore, we will demonstrate one novel practical application in designing a next generation replacement for traditional filter-based image sensors that we term a 'color router'. By using a gradient-based approach, we demonstrate not only can we overcome the traditional limitations of filter-based approaches, but we can approach the absolute physical limit of color separation efficiency. In the context of this problem as well, we also demonstrate one further novel method to accelerate optimization, using an L1-like penalty method inspired by L1-regularization popularized in machine learning to improve the robustness to manufacturing errors and other perturbations to the device design.Finally, as a contrast to the gradient-based technique of optimization, we also showcase two examples of more traditional device optimization using the theoretical principles of Maxwell's equations. The first is to exploit analytic continuation and the band-structure of insulator-metal-insulator waveguides to design a reflector with superior reflection properties to that of a uniform metal but with lower loss (essentially a nearly metal-less metallic metamaterial). The second is to engineer interesting radiative properties and extraordinarily high reflection in atomically-thin monolayer graphene nano-ribbon system.

ISBN: 9798426884991Subjects--Topical Terms:

3680690
Sparsity.

Accelerating Numerical Methods for Gradient-Based Photonic Optimization and Novel Plasmonic Functionalities.
LDR:04186nmm a2200349 4500 001 2346944
005 20220706051330.5
008 241004s2022 ||||||||||||||||| ||eng d
020 $a 9798426884991
035 $a (MiAaPQ)AAI29099823
035 $a (MiAaPQ)STANFORDcy118cz7502
035 $a AAI29099823
040 $a MiAaPQ $c MiAaPQ
100 1 $a Zhao, Nathan Zhiwen. $3 3686151
245 1 0 $a Accelerating Numerical Methods for Gradient-Based Photonic Optimization and Novel Plasmonic Functionalities.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2022
300 $a 194 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-11, Section: B.
500 $a Advisor: Fan, Shanhui;Brongersma, Mark L. ;Fan, Jonathan Albert.
502 $a Thesis (Ph.D.)--Stanford University, 2022.
506 $a This item must not be sold to any third party vendors.
520 $a Optimizing the design and performance of photonic systems has been an active and growing area of research over the past decade with many practical applications such as image sensors, augmented reality and virtual reality, on-chip photonic systems, and more. Moreover, gradient-based methods, such as the adjoint variable method (AVM), have led to very distinctive and complex designs for on-chip multiplexers, tapers, dielectric laser accelerators, and more, while yielding much higher performance metrics which classical design approaches using first principles physics cannot match. However, less research has been dedicated in the photonics community to understanding and improving the underlying numerical methods which are critical for the success of these applications.In this thesis, we will demonstrate four key numerical advancements in the use of gradient-based design methods using frequency domain numerical solvers of Maxwell's equations, particularly finite difference frequency domain (FDFD) solvers. The first is the application of domain decomposition techniques to gradient-based optimization, allowing us to reduce the effective system size for a gain in efficiency. The second exploits the physics of perturbative series expansions to efficiently determine the optimal learning rate essential to gradient-based optimization. The third leverages the fundamental similarities of the previous two methods, allowing us to combine the two to achieve a further multiplicative acceleration. The fourth is exploiting the choice of boundary condition in the context of perfectly matched layers to minimize overhead and optimize the efficiency of the simulations required during the optimization procedure.Furthermore, we will demonstrate one novel practical application in designing a next generation replacement for traditional filter-based image sensors that we term a 'color router'. By using a gradient-based approach, we demonstrate not only can we overcome the traditional limitations of filter-based approaches, but we can approach the absolute physical limit of color separation efficiency. In the context of this problem as well, we also demonstrate one further novel method to accelerate optimization, using an L1-like penalty method inspired by L1-regularization popularized in machine learning to improve the robustness to manufacturing errors and other perturbations to the device design.Finally, as a contrast to the gradient-based technique of optimization, we also showcase two examples of more traditional device optimization using the theoretical principles of Maxwell's equations. The first is to exploit analytic continuation and the band-structure of insulator-metal-insulator waveguides to design a reflector with superior reflection properties to that of a uniform metal but with lower loss (essentially a nearly metal-less metallic metamaterial). The second is to engineer interesting radiative properties and extraordinarily high reflection in atomically-thin monolayer graphene nano-ribbon system.
590 $a School code: 0212.
650 4 $a Sparsity. $3 3680690
650 4 $a Color. $3 533870
650 4 $a Decomposition. $3 3561186
650 4 $a Test systems. $3 3686152
650 4 $a Design optimization. $3 3681984
650 4 $a Numerical analysis. $3 517751
650 4 $a Energy conservation. $3 647269
650 4 $a Engineering. $3 586835
650 4 $a Algorithms. $3 536374
650 4 $a Graphene. $3 1569149
650 4 $a Boundary conditions. $3 3560411
650 4 $a Visualization. $3 586179
650 4 $a Applied mathematics. $3 2122814
650 4 $a Computer science. $3 523869
650 4 $a Energy. $3 876794
650 4 $a Mathematics. $3 515831
690 $a 0537
690 $a 0364
690 $a 0984
690 $a 0791
690 $a 0405
710 2 $a Stanford University. $3 754827
773 0 $t Dissertations Abstracts International $g 83-11B.
790 $a 0212
791 $a Ph.D.
792 $a 2022
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29099823