— FFTW is an implementation of the discrete Fourier transform (DFT) that adapts to the hardware in order to maximize performance. This paper shows that such an approach can yield an implementation that is competitive with hand-optimized libraries, and describes the software structure that makes our current FFTW3 version flexible and adaptive. We further… (More)
FFT literature has been mostly concerned with minimizing the number of floating-point operations performed by an algorithm. Unfortunately, on present-day microprocessors this measure is far less important than it used to be, and interactions with the processor pipeline and the memory hierarchy have a larger impact on performance. Consequently, one must know… (More)
No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher, except for reading and browsing via the World Wide Web. Users are not permitted to mount this file on any network servers.
This paper describes FFTW, a portable C package for computing the one-and multidimen-sional complex discrete Fourier transform (DFT). FFTW is typically faster than all other publicly available DFT software, including the well-known FFTPACK and the code from Numerical Recipes. More interestingly, FFTW is competitive with or better than proprietary ,… (More)
We describe a fully-vectorial, three-dimensional algorithm to compute the definite-frequency eigenstates of Maxwell's equations in arbitrary periodic dielectric structures, including systems with anisotropy (birefringence) or magnetic materials, using preconditioned block-iterative eigensolvers in a planewave basis. Favorable scaling with the system size… (More)
—Recent results by Van Buskirk et al. have broken the record set by Yavne in 1968 for the lowest exact count of real additions and multiplications to compute a power-of-two discrete Fourier transform (DFT). Here, we present a simple recursive modification of the split-radix algorithm that computes the DFT with asymptotically about 6% fewer operations than… (More)
We describe an all-angle negative refraction effect that does not employ a negative effective index of refraction and involves photonic crystals. A few simple criteria sufficient to achieve this behavior are presented. To illustrate this phenomenon, a microsuperlens is designed and numerically demonstrated. Negative refraction of electromagnetic waves in… (More)
This note is intended as a brief introduction to the theory and practice of per fectly matched layer (PML) absorbing boundaries for wave equations, intended for future use in the courses 18.369 and 18.336 at MIT. It focuses on the complex stretched-coordinate viewpoint, and also discusses the limitations of PML.
Perturbation theory permits the analytic study of small changes on known solutions, and is especially useful in electromagnetism for understanding weak interactions and imperfections. Standard perturbation-theory techniques, however, have difficulties when applied to Maxwell's equations for small shifts in dielectric interfaces (especially in… (More)
We present the light-propagation characteristics of OmniGuide fibers, which guide light by concentric multi-layer dielectric mirrors having the property of omnidirectional reflection. We show how the lowest-loss TE_01 mode can propagate in a single-mode fashion through even large-core fibers, with other modes eliminated asymptotically by their higher losses… (More)