Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2108.02762

Fast and Accurate Optimization of Metasurfaces with Gradient Descent and the Woodbury Matrix Identity

Jordan Budhu·Anthony Grbic
View original source ↗Read source document ↗Export metadata ↓

Abstract

A fast metasurface optimization strategy for finite-size metasurfaces modeled using integral equations is presented. The metasurfaces considered are constructed from finite patterned metallic claddings supported by grounded dielectric spacers. Integral equations are used to model the response of the metasurface to a known excitation and solved by Method of Moments. An accelerated gradient descent optimization algorithm is presented that enables the direct optimization of such metasurfaces. The gradient is normally calculated by solving the method of moments problem N+1 times where N is the number of homogenized elements in the metasurface. Since the calculation of each component of the N-dimensional gradient involves perturbing the moment method impedance matrix along one element of its diagonal and inverting the result, this numerical gradient calculation can be accelerated using the Woodbury Matrix Identity. The Woodbury Matrix Identity allows the inverse of the perturbed impedance matrix to be computed at a low cost by forming a rank-r correction to the inverse of the unperturbed impedance matrix. Timing diagrams show up to a 26.5 times improvement in algorithm times when the acceleration technique is applied. An example of a passive and lossless wide-angle reflecting metasurface designed using the accelerated optimization technique is reported.

Explore related subjects

math.NAcs.NAphysics.app-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jordan Budhu, Anthony Grbic. 2021-07-07. Fast and Accurate Optimization of Metasurfaces with Gradient Descent and the Woodbury Matrix Identity. https://doi.org/10.1109/tap.2023.3281667

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗