Differentiable Scattering Matrix for Optimization of Photonic Structures
Abstract
The scattering matrix, which quantifies the optical reflection and transmission of a photonic structure, is pivotal for understanding the performance of the structure. In many photonic design tasks, it is also desired to know how the structure’s optical performance changes with respect to design parameters, that is, the scattering matrix’s derivatives (or gradient). Here we address this need. We present a new algorithm for computing scattering matrix derivatives accurately and robustly. In particular, we focus on the computation in semi-analytical methods (such as rigorous coupled-wave analysis). To compute the scattering matrix of a structure, these methods must solve an eigen-decomposition problem. However, when it comes to computing scattering matrix derivatives, differentiating the eigen-decomposition poses significant numerical difficulties. We show that the differentiation of the eigen-decomposition problem can be completely sidestepped, and thereby propose a robust algorithm. To demonstrate its efficacy, we use our algorithm to optimize metasurface structures and reach various optical design goals.
1 introduction
The scattering matrix is a fundamental concept in many fields. It relates the input state and the output state of a physical system undergoing a scattering process. Particularly revealing in optics, the scattering matrix has been widely used for analyzing photonic structures such as waveguides [19, 9, 18] and metasurface units [16, 43, 8]. Once the scattering matrix of a photonic structure is known, the structure’s optical performance (e.g., mode conversion efficiency and phase shift) can be directly obtained.
Because of its vital importance, many numerical methods have been developed to compute the scattering matrix of a photonic structure. Among them, a popular class is the semi-analytical methods, such as the method of lines [28] and rigorous coupled-wave analysis (RCWA) [24]. These methods exploit the fact that many photonic structures in practice (such as waveguides and metasurface units) have a piecewise constant cross-sectional shape along the transmission direction (denoted as -direction). Thus, to solve Maxwell’s equations, they only need to discretize the 2D cross-sectional region, reducing Maxwell’s equations into a set of continuous differential equations along -direction, whose solution can be expressed through an eigenvalue analysis. Thanks to the semi-discretization, these methods often enable faster computation in comparison to full discretization methods (such as finite-element- and finite-volume-based methods). Indeed, methods like RCWA have been widely used in designing various photonic structures, such as metasurfaces [3, 16, 4, 11], metagratings [13, 1], holograms [43, 44], polarimeters [5], solar cells [40], radiative cooling structures [30], color structures [34], photonic crystals[41], and waveguides [19, 9].
In this work, we extend the semi-analytical methods to obtain the higher-order information of scattering matrices, namely the scattering matrix’s derivatives (or gradient). Provided a photonic structure specified by certain design parameters, we aim to compute not only its scattering matrix but its derivatives with respect to the design parameters.
The scattering matrix derivatives depict the changes of the structure’s optical behaviors as its design parameters vary. This higher-order information, if robustly and efficiently computed, finds many applications in photonic design. Most notable is the optimization of photonic structures. The derivatives provide guidance on how we can adjust the parameters (e.g., through the gradient descent algorithm [31]) to improve the structure’s optical performance [20] or to find a design robust to fabrication error [2, 39, 45].
Unfortunately, the computation of scattering matrix derivatives is nontrivial. The difficulty is rooted in the fact that the permissible optical modes in a photonic structure are eigenfunctions of a linear (Hermitian) operator determined by Maxwell’s equations [15]. Thus, to compute the scattering matrix, semi-analytical methods must solve an eigen-decomposition problem: its eigenvalues describe the propagation constants (or effective indices) of the modes and its eigenvectors indicate propagating modal patterns. Differentiating the scattering matrix, by chain rule, requires the derivatives of eigenvalues and eigenvectors. It is the need of eigenvector derivatives that renders the scattering matrix differentiation ill-posed: when there exist repeated eigenvalues, the corresponding eigenvectors are not uniquely defined. As the parameter changes, the numerical results of the eigenvectors may change discontinuously, and their derivatives become undefined (see more discussion in Section 3).
Not merely does this issue exist as a corner case; many photonic structures in practice have geometric and material symmetries, from which repeated eigenvalues and thus ill-defined eigenvector derivatives emerge (see Fig. 2). Consequently, one must carefully choose eigenvectors such that they vary smoothly with respect to the design parameters. This choice, albeit attainable, demands complex and expensive computational effort [38].
In this paper, we question the necessity of eigenvector derivatives for differentiating scattering matrices. We show that while eigen-decompositions are needed for computing a photonic structure’s scattering matrix, eigenvector derivatives can be fully sidestepped for differentiating the scattering matrix. Based on our new derivation, we present a fast and robust algorithm that, without resorting to eigenvector derivatives, computes the scattering matrix derivatives with respect to any design parameters.
Our method is designed for scattering matrices in general, independent from any specific basis representation; nor is it bound to any particular geometric parameterization. To demonstrate the use of our method, we apply the scattering matrix derivatives for optimizing the design of metasurface units. We can choose different design parameterizations and use gradient-based optimization to reach various light transmission goals. We also propose a general parameterization of the meta-unit’s cross-sectional shape that can be optimized using our method.
2 Background: Scattering Matrix
We start by briefly reviewing the classic notion of scattering matrix in computational photonics, to pave the way toward its differentiation.

To numerically analyze a photonic structure (such as a waveguide), the structure is often discretized along the wave propagation direction (i.e., -direction) into a series of layers each with a uniform cross-sectional material distribution (Fig. 1-b). Consider optical waves of a specific frequency. Their propagation in each layer is characterized by a scattering matrix , which relates waves incident on the layer from left and right sides (Fig. 1-a) to the waves scattered out in either direction.
Concretely, let and denote vectors describing incident waves on the layer from left and right sides, respectively. Here and stack coefficients that represent the waves under a chosen basis, whose construction will be outlined shortly. Under the same basis, we use and to denote the scattered waves in left and right directions. With these notations, the incident and scattered waves are related through
(1) |
Here is decomposed into four submatrices: and indicate how the incident wave from left or right direction is reflected by the layer, while and describe how the incident wave (from either direction) transmits through the layer.

The computation of scattering matrix starts with a semi-discretization of the frequency-domain Maxwell’s equations of a photonic layer, namely,
(2) |
where is the free-space wave number, and the vectors and describe the electric and magnetic fields of the photonic structure under a chosen basis—for example, RCWA uses the 2D Fourier basis on the cross-section of the wave propagation direction. The matrices and encode the cross-sectional distributions of material permeability and permittivity.
The semi-discretization (2) is a common form in many numerical analysis methods for photonic structures (such as the method of line [28] and RCWA [24]). The difference across those methods only lies in the specific ways of constructing and (e.g., see Supplement 1 for their construction in RCWA).
Once and are determined, the scattering matrix can be constructed. A key step of this construction is to solve an eigenvalue problem, , to obtain eigenvectors and the diagonal eigenvalue matrix . As we will discuss in Section 3, it is this eigenproblem that renders the differentiation of the scattering matrix ill-posed. To understand the challenges and how we overcome them, we first present the recipe of computing from and , as follows.
Let . Then, its eigenvalue matrix is . As derived in [32], the formulas of computing the scattering matrix defined in (1) are
(3a) | ||||
(3b) |
where the matrices , , and have the following forms:
(4a) | ||||
(4b) |
Here we use to denote the layer thickness (Fig. 1), and the matrix is related to through . and together form a basis of electric and magnetic components for the optical waves in the layer. Similarly, and form a basis for free space propagation, independent from the photonic structure. They are constant values for computing the derivatives of . The vectors, , , and , in (1) are coefficients under this free-space basis to describe incident and scattered waves.
Once the scattering matrices of individual layers are computed, they are combined using the Redheffer star product [29] into the total scattering matrix, one that indicates the optical response of the entire photonic structure.
Remark. The formulas in Eqs. (3) and (4) assume that the current photonic layer is sandwiched by two free-space layers. This assumption is by no means a limitation. In an arbitrary photonic structure, the layers can be treated as if they are interleaved with free-space layers—each of which has a zero thickness.
3 Differentiable Scattering Matrix
The geometry or material distribution of photonic structure is specified by its structural (design) parameters (e.g., see Fig. 2). These parameters determine the structure’s permittivity and permeability distributions described by and in (2). Thus, one can compute their derivatives, and , with respect to an arbitrary parameter. Given and , we now address the question of how to compute the scattering matrix derivative with respect to the same parameter.
3.1 Challenges in Scattering Matrix Differentiation
The construction of scattering matrix needs to solve an eigenvalue problem , as the eigenvalues and eigenvectors appear in Eqs. (3) and (4) for computing . Thus, for the differentiation of , it seems also needed to compute the derivatives of the eigenvalues and eigenvectors .
Unfortunately, the derivatives of eigenvectors in many cases are ill-defined. Most notable is when there exist repeated eigenvalues. Repeated eigenvalues are not uncommon: many photonic devices have certain structural symmetries, from which eigenvalue repetition naturally emerges (see Fig. 2). For those repeated eigenvalues, their eigenvectors (up to a scale) are not uniquely determined; any set of linearly independent vectors that span the same subspace are valid eigenvectors. Because of the ambiguity, as the structural parameter changes, those eigenvectors may change discontinuously (see an examples in Supplement 1), and thus their derivatives may not be well-defined.
As a result, one must carefully choose eigenvectors in the subspace of repeated eigenvalues such that the eigenvectors change continuously with respect to the structural parameter. This choice, however, is computationally expensive. As derived in [38], to ensure well-defined eigenvector derivatives, one must compute higher-order derivatives of the eigenvalues and the matrix : if the repeated eigenvalues have repeated derivatives up to the -th order (see Fig. 2), then derivatives up to the -th order of both eigenvalues and the matrix must be computed to determine first-order eigenvector derivatives.
3.2 Differentiation without Resort to Eigenvector Derivatives
We now present a new algorithm for computing the scattering matrix derivative . Even in the presence of repeated eigenvalues and their derivatives, our method requires only the first-order derivatives of the matrices and , completely sidestepping the differentiation of eigenvalues and eigenvectors. In comparison to the way that takes eigenvalue derivatives (as described above), our method is more robust and efficient.
First, we rewrite the commonly used expressions of scattering matrix components, shown in (3), in new forms,
(5a) | ||||
(5b) |
where , , and denote the following matrix multiplications, respectively:
(6a) | ||||
(6b) | ||||
(6c) |
The derivation of these new expressions (5) and (6) are provided in Supplement 1. In Eqs. (6), the equalities are reached by applying (4) and using that denotes .
The expressions in (5) present a new route for computing scattering matrix derivative. They indicate that the scattering matrix is determined by the three matrices, , , and . As a result, to compute its derivative using the chain rule, we need to compute the derivatives of , , and with respect to the structural parameter.
In Eqs. (6), both and (introduced in (4)) are constant matrices. Thus, the derivatives of , , and only depend on the derivatives of two other matrices in Eqs. (6), namely and . We now describe how to compute the derivatives of the two matrices, respectively.
Derivative of .
The matrix is related to and but not the eigenvalues and eigenvectors. Its derivative can be expressed as
(7) |
where depends on the material permittivity distributions of the photonic structure, and therefore its derivative with respect to a design parameter can be directly computed (see examples in Section 4). The way of computing can be derived by taking the derivatives on both sides of the relation , which yields
(8) |
Given and , the right-hand side of this equation can be directly computed. To compute , we rewrite the left-hand side by denoting as for some unknown , where is the eigenvector matrix of . Using the fact that , we obtain a simplified form of (8):
(9) |
From (9), can be easily solved by noticing that is a diagonal matrix, and therefore (9) can be written element-wise as , where is the -th eigenvalue in , and denote the matrix on the right-hand side of (9). In other words, the elements of can be obtained by solving 1D linear equations in parallel. Once is obtained, is computed using .
We note that while this process of computing requires the eigenvectors and eigenvalues , they are also needed for computing the scattering matrix in the first place. Our solving process does not require the derivatives of eigenvectors. Therefore, it introduces no additional effort in terms of eigen-decomposition.
Derivative of .
In the first glance, the derivative of depends on the eigenvectors . However, from the definition of in (4a), we notice that , which suggests an alternative approach: take the derivative of the matrix exponential with respect to .
A common approach of computing the matrix exponential is through the eigen-decomposition of followed by the exponential of the resulting eigenvalues. If we take this approach, the derivative computation must involve the derivatives of eigenvectors, which might not be well-defined. Another approach, used by Feynman [12] and others [17, 7, 35], expresses the derivative of a matrix exponential using an integral that in itself involves matrix exponentials. Yet, numerically evaluating the matrix exponentials and the integral are expensive.
Instead, our proposed method for computing the derivative is based on the following proposition originally proved in [25].
Proposition 1.
Consider an matrix and its derivative with respect to an arbitrary parameter. If
(10) |
where the top-right block matrix in is the derivative of the matrix exponential .
In our problem, is computed as described above (by solving (9)), and the common way of computing is by taking the eigen-decomposition of , which is again what we wish to avoid. We therefore take a different approach, the scaling and squaring method [14], to compute —without the need of eigen-decomposition.
The scaling and squaring method exploits the relation for any matrix . In practice, is chosen to be for some non-negative integer . The idea is to have the norm of sufficiently small such that can be well approximated by a Padé approximant near the origin. The Padé approximant is a rational polynomial of . Its evaluation requires only matrix multiplications and inverse, but no eigen-decomposition. The scaling and squaring method is robust and accurate, and has been used in many numerical tools (such as MATLAB’s expm function).
When applying this method, we further exploit the specific structure of (i.e., its bottom-left block matrix vanishes, and its two diagonal block matrices are identical) to tailor the method for improving computational performance. Supplement 1 presents our detailed derivations and computational steps.

4 Results
This section presents our numerical results. First, we validate our algorithm for computing scattering matrix derivatives. Next, to demonstrate the use of scattering matrix derivatives in photonics, we optimize the geometry of photonic metasurface units (also called meta-atoms).
Meta-atoms are the building blocks of a metasurface, often designed based on physical intuitions and manually crafted libraries [42, 27, 26]. More recently, inverse design methods of meta-atom structures have also been explored—e.g., through finite-difference-based gradient descent [6], adjoint-based level-set method [23], and topological optimization [33, 22].
Due to fabrication constraints, meta-atoms often have constant cross-sectional shapes along one direction (i.e., -direction, as shown in Fig. 3-a). Thus, the semi-analytical methods (such as RCWA) are particularly efficient for simulating meta-atoms, thanks to their ability of not discretizing along -direction [24]. Our method, for the first time, enables the semi-analytical methods to also compute scattering matrix derivatives with respect to design parameters. Here, in the framework of RCWA, we demonstrate automatic discovery of meta-atom structures that reach various amplitude and phase goals.
4.1 Validation
To validate our algorithm, we consider a dielectric meta-atom used in metasurface holography [26, 27]. Its structure is shown in Fig. 3-a. We use Eqs. (5) to compute the scattering matrix, for which the matrices and (introduced in (2)) are constructed using RCWA. The scattering matrix allows us to compute light propagation properties of the meta-atom, which are in turn compared to the results from finite difference time domain (FDTD) method implemented in Lumerical [36].
We first scan the light wavelength from to . For each wavelength, we compute, using our scattering matrix and FDFD respectively, the effective index of the fundamental mode propagating in the meta-atom. The results from our method agree with FDFD results (see Fig. 3-b). Furthermore, we consider the far-field light transmission through the meta-atom, and compute the phase shift and amplitude change for each wavelength. Again, the results from our method and FDTD match closely, as shown in Fig. 3-c.
These experiments confirm that our scattering matrix computation is as accurate as FDTD in Lumerical. In terms of computational cost, our method takes about 0.15 seconds for each monochromatic simulation, and a few seconds for the entire - wavelength range, whereas the FDTD simulation takes several minutes.
Next, we validate our derivative computation. We consider again the meta-atom structure shown in Fig. 3-a, and choose the parameter to be the size of the hollow square. Using our method, we compute the derivative of the structure’s scattering matrix with respect to . Meanwhile, since there is no analytic expression of the scattering matrix derivative, we approximate it using finite difference (FD) estimation, that is,
(11) |
We estimate using a sweeping range of values, and compare them to the derivative resulted from our method.


The results are illustrated in Fig. 4. The accuracy of FD approximation largely depends on the choice of . Only when is chosen within a certain range, FD approximation is accurate enough to agree with our derivative results. This agreement confirms the correctness of our method. But for different elements in the scattering matrix, the valid range varies (indicated in light green in Fig. 4), suggesting that FD approximation is impractical: it is hard, if not impossible, to choose a proper to produce accurate derivative estimations for all elements in the scattering matrix. In contrast, our method is robust for computing the derivatives.

Computational cost.
In addition to the robustness, our method is also faster than the FD method. In the FD method, computing a matrix derivative requires the computation of two scattering matrices and . In contrast, our method, in addition to computing , only requires a few matrix multiplications and inverses (recall Section 3.3.2). On our workstation computer, the overhead of computing a scattering matrix derivative is about of the cost for computing the scattering matrix itself.

4.2 Use Case: Optimization of Meta-atom Structure
Controlling phase and amplitude of monochromatic light.
First, we optimize meta-atom structures to reach specific transmitted amplitudes and phases for a monochromatic light (at 1.55 wavelength, -polarized). The cross-sectional shape is shown in Fig. 5-a, determined by two parameters. The objective function for the inverse design is defined as
(12) |
where is the transmission submatrix in the scattering matrix (recall (1)), is the mode index for the incident and outgoing light in free space, thus denotes the -th diagonal element of the matrix. Also, is a complex constant specifying the target amplitude and phase of the transmission. Here we consider the fundamental mode (the way to choose corresponding is given in Supplemental 1), which describes the far-field light transmission along the -direction.
To verify the robustness of our method and the enabled optimization, we evenly sample different targets on a circle on the complex plane (see Fig. 5-b). For each target, we find meta-atom’s shape parameters by minimizing (12) through a gradient-descent algorithm [31], for which the gradients of (12) with respect to the design parameters are computed using our method. As shown in Fig. 5-b, we are able to automatically discover structures that reach these targets closely.
Controlling phases for both and polarized light.
Next, we optimize meta-atom structures to obtain target responses for - and -polarized light, simultaneously. This type of meta-atoms has been used to construct metasurface holograms [10]. In our example, the light wavelength is 1.3; the meta-atoms have a fixed height of 2.0 and a period of 2.5 along - and -direction. The cross-sectional shape of the meta-atoms are specified by two parameters shown in Fig. 7-a. We determine the parameters by minimizing the following objective function:
(13) |
where the subscript (and ) indicates light polarization; (and ) are the target phase changes from -polarized (and -polarized) incident light to the outgoing light with the same polarization (i.e., for some ). The first term in (13) measures, for the -polarized light, the cosine difference (through dot product on complex plane) between the -th mode’s phase change and the target phase change, and similarly for the second term. The optimized structures for different - and -polarized phase targets are shown in Fig. 7. In all cases, the residual between the target and the resulting phase change is within 7% of one period (), and in most cases within 1%.
Controlling amplitudes for multiple wavelengths.
We also demonstrate inverse design of meta-atoms for another type of optical response: obtain two target amplitude responses at two separate wavelengths, simultaneously. This type of responses have proven useful for making colored metasurface holograms [26, 27]. Here we consider two archetypes used in [27], each described by two parameters (see Fig. 6-a). The two wavelengths under consideration are 1.2 (labeled as blue) and 1.6 (red), and the objective function is defined as
(14) |
Here the subscript “1” and “2” indicate the blue (1.2) and red (1.6) wavelength, respectively. The first term accounts for the blue wavelength: is the transmission submatrix of the scattering matrix and is the desired amplitude. Similar is the second term. More terms can be added in (14) to incorporate more than two wavelengths.
For each archetype, we find its parameter values via a gradient-descent algorithm that minimizes (14), and choose between the two archetypes one that produces a smaller objective value. The optimized structures and their performances are shown in Fig. 6. For almost all the experiments (each with a different amplitude target), the resulting amplitudes by the inversely designed meta-atoms match closely to their targets.
General cross-sectional shape design.
Lastly, we introduce a new way to inverse design the meta-atom’s cross-sectional shape under a general representation. We use the star-convex polygon [37] to represent the cross-sectional shape. Such a shape can be discretized by sampling points on its boundary so that the polar angles of these points are evenly distributed over . In other words, the -th point has the coordinate , where is a non-negative value (see Fig. 8-a), and the shape is specified by parameters . A large offers many degrees of freedom to represent a complex shape, but meanwhile renders exhaustive search through the entire parameter space too expensive—one must rely on numerical optimization methods to determine the parameter values.

This shape representation is particularly suitable for RCWA-based analysis, as it allows for a closed-form 2D Fourier transform of the shape (and thus the permittivity distribution) [21]. In RCWA framework, 2D Fourier transform of the cross-sectional permittivity distribution is needed for computing the matrices, and , as well as their derivatives with respect to the parameters. Supplemental 1 provides the details of this process.
As examples, we optimize octagons () to obtain desired optical responses in different scattering directions. First, we specify the target scattering directions. Notice that to predict optical behavior of a single meta-atom in simulation, periodic boundary condition is often used. Under this condition, the meta-atom is effectively a 2D grating structure, for which we can use diffraction orders to specify different scattering directions: the output light with diffraction order is along the direction
(15) |
where and are periods along - and -axis, respectively ( in our examples).
We consider -polarized light with the wavelength of 1.55. The goal here is to obtain specified far-field phases and amplitudes at two scattering directions—ones that correspond to the diffraction orders, and , as shown in Fig. 8-b. We further restrict to be in the range , and determine values by minimizing
(16) |
where and are mode indices for the diffraction orders and , respectively; and and specify the target phases and amplitudes (as complex values) in the two outgoing directions. We perform two experiments for two sets of and goals. The optimization convergence curves and resulting shapes are shown in Fig. 8.
5 Conclusion
We have presented an algorithm for computing the derivatives of the scattering matrices of a photonic structure with respect to its structural parameters. Our method is built on the framework of semi-analytical methods for analyzing photonic structures. A key step in semi-analytical methods for computing scattering matrices is the eigen-decomposition. However, to compute scattering matrix derivatives, directly differentiating the eigenvalue analysis poses significant difficulties. We show a new route to compute scattering matrix derivatives without the need of differentiating the eigen-decomposition process.
The scattering matrix derivatives present how a photonic structure’s performance changes as its structural parameters vary. While we demonstrated their use in the optimization of meta-atom units, they are useful in many other applications. Therefore, our method may serve as a useful analysis tool in a wide range of photonic design tasks.
Funding
National Science Foundation (CAREER-1453101, 1717178, 1816041).
Acknowledgments
We thank Nanfang Yu for valuable suggestions.
Disclosures
The authors declare no conflicts of interest.
See Supplement 1 for supporting content.
References
- [1] Ahmed, A., Liscidini, M., and Gordon, R. Design and analysis of high-index-contrast gratings using coupled mode theory. IEEE Photonics Journal 2, 6 (2010), 884–893.
- [2] Akel, H., and Webb, J. Design sensitivities for scattering-matrix calculation with tetrahedral edge elements. IEEE transactions on magnetics 36, 4 (2000), 1043–1046.
- [3] Arbabi, A., Horie, Y., Bagheri, M., and Faraon, A. Dielectric metasurfaces for complete control of phase and polarization with subwavelength spatial resolution and high transmission. Nature nanotechnology 10, 11 (2015), 937–943.
- [4] Arbabi, E., Arbabi, A., Kamali, S. M., Horie, Y., and Faraon, A. Multiwavelength polarization-insensitive lenses based on dielectric metasurfaces with meta-molecules. Optica 3, 6 (2016), 628–633.
- [5] Arbabi, E., Kamali, S. M., Arbabi, A., and Faraon, A. Full-stokes imaging polarimetry using dielectric metasurfaces. ACS Photonics 5, 8 (2018), 3132–3140.
- [6] Backer, A. S. Computational inverse design for cascaded systems of metasurface optics. Optics express 27, 21 (2019), 30308–30331.
- [7] Bellman, R. Introduction to matrix analysis, vol. 19. Siam, 1997.
- [8] Blau, Y., Eitan, M., Egorov, V., Boag, A., Hanein, Y., and Scheuer, J. In situ real-time beam monitoring with dielectric meta-holograms. Optics express 26, 22 (2018), 28469–28483.
- [9] Cao, Q., Lalanne, P., and Hugonin, J.-P. Stable and efficient bloch-mode computational method for one-dimensional grating waveguides. JOSA A 19, 2 (2002), 335–338.
- [10] Chen, W. T., Yang, K.-Y., Wang, C.-M., Huang, Y.-W., Sun, G., Chiang, I.-D., Liao, C. Y., Hsu, W.-L., Lin, H. T., Sun, S., Zhou, L., Liu, A. Q., and Tsai, D. P. High-efficiency broadband meta-hologram with polarization-controlled dual images. Nano letters 14, 1 (2014), 225–230.
- [11] Colburn, S., Zhan, A., and Majumdar, A. Varifocal zoom imaging with large area focal length adjustable metalenses. Optica 5, 7 (2018), 825–831.
- [12] Feynman, R. P. An operator calculus having applications in quantum electrodynamics. Physical Review 84, 1 (1951), 108.
- [13] Fitio, V., Yaremchuk, I., Bendzyak, A., and Bobitski, Y. Application rcwa for studying plasmon resonance under diffraction by metal gratings. In 2017 IEEE First Ukraine Conference on Electrical and Computer Engineering (UKRCON) (2017), IEEE, pp. 667–670.
- [14] Higham, N. J. The scaling and squaring method for the matrix exponential revisited. SIAM Journal on Matrix Analysis and Applications 26, 4 (2005), 1179–1193.
- [15] Joannopoulos, J., Meade, R., and Winn, J. Photonic crystals. Molding the flow of light (1995).
- [16] Kamali, S. M., Arbabi, E., Arbabi, A., Horie, Y., Faraji-Dana, M., and Faraon, A. Angle-multiplexed metasurfaces: encoding independent wavefronts in a single metasurface under different illumination angles. Physical Review X 7, 4 (2017), 041056.
- [17] Karplus, R., and Schwinger, J. A note on saturation in microwave spectroscopy. Physical Review 73, 9 (1948), 1020.
- [18] Kwiecien, P., Richter, I., and Čtyrokỳ, J. Rcwa/arcwa-an efficient and diligent workhorse for nanophotonic/nanoplasmonic simulations-can it work even better? In 2015 17th International Conference on Transparent Optical Networks (ICTON) (2015), IEEE, pp. 1–8.
- [19] Lalanne, P., and Silberstein, E. Fourier-modal methods applied to waveguide computational problems. Optics Letters 25, 15 (2000), 1092–1094.
- [20] Lalau-Keraly, C. M., Bhargava, S., Miller, O. D., and Yablonovitch, E. Adjoint shape optimization applied to electromagnetic design. Optics express 21, 18 (2013), 21693–21701.
- [21] Lee, S.-W., and Mittra, R. Fourier transform of a polygonal shape function and its application in electromagnetics. IEEE Transactions on Antennas and Propagation 31, 1 (1983), 99–103.
- [22] Lin, Z., Liu, V., Pestourie, R., and Johnson, S. G. Topology optimization of freeform large-area metasurfaces. Optics express 27, 11 (2019), 15765–15775.
- [23] Mansouree, M., and Arbabi, A. Metasurface design using level-set and gradient descent optimization techniques. In 2019 International Applied Computational Electromagnetics Society Symposium (ACES) (2019), IEEE, pp. 1–2.
- [24] Moharam, M., and Gaylord, T. Rigorous coupled-wave analysis of planar-grating diffraction. JOSA 71, 7 (1981), 811–818.
- [25] Najfeld, I., and Havel, T. F. Derivatives of the matrix exponential and their computation. Advances in applied mathematics 16, 3 (1995), 321–375.
- [26] Overvig, A., Shrestha, S., Xiao, C., Zheng, C., and Yu, N. Two-color and 3d phase-amplitude modulation holograms. In CLEO: QELS_Fundamental Science (2018), Optical Society of America, pp. FF1F–6.
- [27] Overvig, A. C., Shrestha, S., Malek, S. C., Lu, M., Stein, A., Zheng, C., and Yu, N. Dielectric metasurfaces for complete and independent control of the optical amplitude and phase. Light: Science & Applications 8, 1 (2019), 1–12.
- [28] Pregla, R., and Pascher, W. The method of lines. Numerical techniques for microwave and millimeter wave passive structures 1 (1989), 381–446.
- [29] Redheffer, R. Difference equations and functional equations in transmission-line theory. Modern mathematics for the engineer 12 (1961), 282–337.
- [30] Rephaeli, E., Raman, A., and Fan, S. Ultrabroadband photonic structures to achieve high-performance daytime radiative cooling. Nano letters 13, 4 (2013), 1457–1461.
- [31] Ruder, S. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747 (2016).
- [32] Rumpf, R. C. Improved formulation of scattering matrices for semi-analytical methods that is consistent with convention. Progress In Electromagnetics Research 35 (2011), 241–261.
- [33] Sell, D., Yang, J., Doshay, S., Yang, R., and Fan, J. A. Large-angle, multifunctional metagratings based on freeform multimode geometries. Nano letters 17, 6 (2017), 3752–3757.
- [34] Shen, Y., Rinnerbauer, V., Wang, I., Stelmakh, V., Joannopoulos, J. D., and Soljacic, M. Structural colors from fano resonances. Acs Photonics 2, 1 (2015), 27–32.
- [35] Snider, R. Perturbation variation methods for a quantum boltzmann equation. Journal of Mathematical Physics 5, 11 (1964), 1580–1587.
- [36] Solutions, F. Lumerical solutions inc. Vancouver, Canada (2003).
- [37] Stanek, J. C. A characterization of starshaped sets. Canadian Journal of Mathematics 29, 4 (1977), 673–680.
- [38] van der Aa, N., Ter Morsche, H., and Mattheij, R. Computation of eigenvalue and eigenvector derivatives for a general complex-valued eigensystem. The electronic journal of linear algebra 16 (2007).
- [39] Veronis, G., Dutton, R. W., and Fan, S. Method for sensitivity analysis of photonic crystal devices. Optics letters 29, 19 (2004), 2288–2290.
- [40] Wang, K. X., Yu, Z., Liu, V., Cui, Y., and Fan, S. Absorption enhancement in ultrathin crystalline silicon solar cells with antireflection and light-trapping nanocone gratings. Nano letters 12, 3 (2012), 1616–1619.
- [41] Wang, Z., and Yu, Z. Spectral analysis based on compressive sensing in nanophotonic structures. Optics Express 22, 21 (2014), 25608–25614.
- [42] Yu, N., Aieta, F., Genevet, P., Kats, M. A., Gaburro, Z., and Capasso, F. A broadband, background-free quarter-wave plate based on plasmonic metasurfaces. Nano letters 12, 12 (2012), 6328–6333.
- [43] Zhao, R., Sain, B., Wei, Q., Tang, C., Li, X., Weiss, T., Huang, L., Wang, Y., and Zentgraf, T. Multichannel vectorial holographic display and encryption. Light: Science & Applications 7, 1 (2018), 1–9.
- [44] Zhou, Y., Kravchenko, I. I., Wang, H., Zheng, H., Gu, G., and Valentine, J. Multifunctional metaoptics based on bilayer metasurfaces. Light: Science & Applications 8, 1 (2019), 1–9.
- [45] Zhu, Z., Dave, U. D., Lipson, M., and Zheng, C. Inverse geometric design of fabrication-robust nanophotonic waveguides. In CLEO: Science & Innovations (2020), Optical Society of America.
See pages - of supplement.pdf