Spinning thermal radiation is a unique phenomenon observed in condensed astronomical objects, including the Wolf-Rayet star EZ-CMa and the red degenerate star G99-47, due to the existence of strong magnetic fields. Here, by designing symmetry-broken metasurfaces, we demonstrate that spinning thermal radiation with a nonvanishing optical helicity can be realized even without applying a magnetic field. We design nonvanishing optical helicity by engineering a dispersionless band that emits omnidirectional spinning thermal radiation, where our design reaches 39% of the fundamental limit. Our results firmly suggest that metasurfaces can impart spin coherence in the incoherent radiation excited by thermal fluctuations. The symmetry-based design strategy also provides a general pathway for controlling thermal radiation in its temporal and spin coherence.
15 August 2017 in IEEE Transactions on Microwave Theory and Techniques
The dense matrix resulting from an integral equation (IE)-based solution of Maxwell's equations can be compactly represented by an H 2 -matrix. Given a general dense H 2 -matrix, prevailing fast direct solutions involve approximations whose accuracy can only be indirectly controlled. In this paper, we propose new direct solution algorithms whose accuracy is directly controlled, including both factorization and inversion, for solving general H 2 -matrices. Different from the recursive inverse performed in existing H 2 -based direct solutions, this new direct solution is a one-way traversal of the cluster tree from the leaf level all the way up to the root level. The underlying multiplications and additions are carried out as they are without using formatted multiplications and additions whose accuracy cannot be directly controlled. The cluster bases and their rank of the original matrix are also updated level by level based on prescribed accuracy, without increasing computational complexity, to take into account the contributions of fill-ins generated during the direct solution procedure. For constant-rank H 2 -matrices, the proposed direct solution has a strict O(N) complexity in both time and memory. For rank that linearly grows with the electrical size, the complexity of the proposed direct solution is O(N logN) in factorization and inversion time, and O(N) in solution time and memory for solving volume IEs (VIEs). Rapid direct solutions of electrodynamic VIEs involving millions of unknowns have been obtained on a single CPU core with directly controlled accuracy. Comparisons with state-of-the-art H 2 -based direct VIE solvers have also demonstrated the advantages of the proposed direct solution in accuracy control, as well as achieving better accuracy with much less CPU time.
12 April 2017 in IEEE Transactions on Microwave Theory and Techniques
In this paper, a fast explicit and unconditionally stable finite-difference time-domain (FDTD) method is developed, which does not require a partial solution of a global eigenvalue problem. In this method, a patch-based single-grid representation of the FDTD algorithm is developed to facilitate both theoretical analysis and efficient computation. This representation results in a natural decomposition of the curl-curl operator into a series of rank-1 matrices, each of which corresponds to one patch in a single grid. The relationship is then theoretically analyzed between the fine patches and unstable modes, based on which an accurate and fast algorithm is developed to find unstable modes from fine patches with a bounded error. These unstable modes are then upfront eradicated from the numerical system before performing an explicit time marching. The resultant simulation is absolutely stable for the given time step irrespective of how large it is, the accuracy of which is also ensured. In addition, both lossless and general lossy problems are addressed in the proposed method. The advantages of the proposed method are demonstrated over the conventional FDTD and the state-of-the-art explicit and unconditionally stable FDTD methods by numerical experiments.
9 February 2015 in IEEE Transactions on Microwave Theory and Techniques
An H 2 -matrix based linear complexity direct matrix solution is developed for the volume integral equation (VIE) based broadband full-wave extraction of general 3-D circuits. Such circuits are in general electrically small or moderate, but contain arbitrarily shaped lossy conductors immersed in inhomogeneous dielectrics with ports located anywhere in the physical layout of the circuit. In the proposed direct solver, we first develop a well-conditioned VIE formulation without sacrificing the rigor and the advantages of the prevailing formulations. This formulation facilitates a robust direct solution of good accuracy even with a rank-1 representation. We then overcome the numerical challenge of solving the resultant highly unstructured system matrix mixed with both square and rectangular dense and sparse matrices by developing a fast linear complexity direct solution. This direct solution is capable of inverting dense matrices involving over 2 million unknowns in less than 1 h on a single CPU core running at 3 GHz. Numerical simulations of large-scale 3-D circuits and comparisons with state-of-the-art linear complexity iterative VIE solvers have demonstrated the accuracy, efficiency, and linear complexity of the proposed direct VIE solver.
27 November 2017 in IEEE Transactions on Microwave Theory and Techniques
Instability has been a major problem in finite-difference time-domain (FDTD) subgridding methods. Reciprocity has been proposed to overcome the problem but with limited success in producing a symmetric positive semidefinite (SPD) system without compromising accuracy. In this paper, we algebraically derive both 2- and 3-D FDTD subgridding operators, which are SPD by construction, and independent of the grid ratio. Such operators have only nonnegative real eigenvalues, and hence the stability of the resulting explicit time marching is guaranteed. The 3-D operator, the algorithm of which is also applicable to 2-D analysis, further permits the use of a local time step, thus achieving a natural subgridding in both space and time. In addition, the interpretation of the proposed operators in the original FDTD formulation is also provided. Interestingly, not only interface unknowns but also subgrid unknowns are generated in a different way, as compared to the original FDTD, to simultaneously obtain an SPD system and to ensure accuracy. Extensive numerical simulations have demonstrated the accuracy, stability, and efficiency of the proposed new subgridding algorithms.
11 May 2018 in IEEE Transactions on Antennas and Propagation
To preserve accuracy in a grid with arbitrary subgrids, an FDTD subgridding scheme, in general, would result in an unsymmetric numerical system. Such a numerical system can have complex-valued eigenvalues, which will render a traditional explicit time marching of FDTD absolutely unstable. In this work, we develop an accurate FDTD subgridding algorithm suitable for arbitrary subgridding settings with arbitrary contrast ratios between the normal gird and the subgrid. Although the resulting system matrix is also unsymmetric, we develop a time marching method to overcome the stability problem without sacrificing the matrix-free merit of the original FDTD. This method is general, which is also applicable to other subgridding algorithms whose underlying numerical systems are unsymmetric. The proposed FDTD subgridding algorithm is then further made unconditionally stable, thus permitting the use of a time step independent of space step. Extensive numerical experiments involving both 2- and 3-D subgrids with various contrast ratios have demonstrated the accuracy, stability, and efficiency of the proposed subgridding algorithm.