Computing leaky modes of optical fibers using a FEAST algorithm for polynomial eigenproblems
Jay Gopalakrishnan, Benjamin Quanah Parker, Pieter Vandenberge

TL;DR
This paper introduces an efficient contour integral method using a FEAST algorithm to accurately compute leaky modes in optical fibers, overcoming computational challenges in complex fiber structures.
Contribution
It presents a novel contour integral approach with a FEAST algorithm for polynomial eigenproblems, improving the accuracy of leaky mode computations in complex optical fibers.
Findings
Accurate computation of leaky modes using the proposed method.
Overcoming large-scale computational difficulties in complex fiber models.
Demonstration of the method's effectiveness on a microstructured antiresonant fiber.
Abstract
An efficient contour integral technique to approximate a cluster of nonlinear eigenvalues of a polynomial eigenproblem, circumventing certain large inversions from a linearization, is presented. It is applied to the nonlinear eigenproblem that arises from a frequency-dependent perfectly matched layer. This approach is shown to result in an accurate method for computing leaky modes of optical fibers. Extensive computations on an antiresonant fiber with a complex transverse microstructure are reported. This structure is found to present substantial computational difficulties: Even when employing over one million degrees of freedom, the fiber model appears to remain in a preasymptotic regime where computed confinement loss values are likely to be off by orders of magnitude. Other difficulties in computing mode losses, together with practical techniques to overcome them, are detailed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
