Nathan Zhao

Nathan Zhao

Auto-generated profile, based on publicly available information

Nathan Zhao

Department of Applied Physics, Stanford University, Stanford, California 94305, United States

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 March 2022 in ACS Photonics
Verified
Journal Article
Closed access
HWHaiwen Wang
Haiwen Wang
WJWeiliang Jin
Weiliang Jin
CGCheng Guo
Cheng Guo
NZNathan Zhao
Nathan Zhao
SRSean P. Rodrigues
Sean P. Rodrigues
SFShanhui Fan
Shanhui Fan

31 January 2019 in ACS Photonics
Verified
Journal Article
Closed access
NZNathan Zhiwen Zhao
Nathan Zhiwen Zhao
ZZZhexin Zhao
Zhexin Zhao
IWIan A. D. Williamson
Ian A. D. Williamson
SBSalim Boutami
Salim Boutami
BZBo Zhao
Bo Zhao
SFShanhui Fan
Shanhui Fan

18 June 2018 in Optics Express
Verified
Journal Article
Open access
PDF file
NZNathan Zhao
Nathan Zhao
SVSacha Verweij
Sacha Verweij
WSWonseok Shin
Wonseok Shin
SFShanhui Fan
Shanhui Fan
We show that iterative solution of Maxwell’s equations using the finite-difference frequency-domain method can be significantly accelerated by using a Schur complement domain decomposition method. We account for the improvement by analyzing the spectral properties of the linear systems resulting from the use of the domain decomposition method.

18 July 2019 in ACS Photonics
Verified
Journal Article
Closed access
NZNathan Z. Zhao
Nathan Z. Zhao
IWIan A. D. Williamson
Ian A. D. Williamson
ZZZhexin Zhao
Zhexin Zhao
SBSalim Boutami
Salim Boutami
SFShanhui Fan
Shanhui Fan

26 February 2020
Verified
Conference Paper
Closed access
PDF file
SBSalim Boutami
Salim Boutami
NZNathan Zhao
Nathan Zhao
SFShanhui Fan
Shanhui Fan
In In this paper, we show two novel approaches for photonic device optimization. Both approaches exploit the Lippmann- Schwinger equation, and can be applied with significant gains in computational efficiency when used with adjoint variable method. The first method optimizes a binarized device by greedily proposing and evaluating the effect of changing different pixels in the design region. Using the update of the Green’s function of the system with Dyson’s equation, one can guarantee the improvement of the figure of merit even for a large discrete binary change. The final structure is binary and guarantees fabricability with varying minimum feature sizes. In the second approach, we develop a fast algorithm to perform a line search for continuous optimization with gradient descent. The algorithm enables the line search to be executed faster than evaluating a new gradient, making such a line search extremely valuable. This line search is based on a Shanks transformation of the series expansion of the Lippmann-Schwinger equation, which enables us to determine the optimal learning rate in the search direction and minimize the number of separate iterations needed to achieve an optimal device.

1 January 2022
Verified
Conference Paper
Closed access
PDF file
PCPeter B. Catrysse
Peter B. Catrysse
NZNathan Zhao
Nathan Zhao
WJWeiliang Jin
Weiliang Jin
SFShanhui Fan
Shanhui Fan
We introduce a subwavelength color router for solid state image sensors. Our design achieves perfect red-green-blue color routing without loss of photons in a subwavelength footprint and has broadband, polarization-independent, and angular robust response.