OPTICSFeb 26, 2017
A Unified Hamiltonian Solution to Maxwell-Schrodinger Equations for Modeling Electromagnetic Field-Particle InteractionYongpin P. Chen, Wei E. I. Sha, Li Jun Jiang et al.
A novel unified Hamiltonian approach is proposed to solve Maxwell-Schrodinger equation for modeling the interaction between classical electromagnetic (EM) fields and particles. Based on the Hamiltonian of electromagnetics and quantum mechanics, a unified Maxwell-Schrodinger system is derived by the variational principle. The coupled system is well-posed and symplectic, which ensures energy conserving property during the time evolution. However, due to the disparity of wavelengths of EM waves and that of electron waves, a numerical implementation of the finite-difference time-domain (FDTD) method to the multiscale coupled system is extremely challenging. To overcome this difficulty, a reduced eigenmode expansion technique is first applied to represent the wave function of the particle. Then, a set of ordinary differential equations (ODEs) governing the time evolution of the slowly-varying expansion coefficients are derived to replace the original Schrodinger equation. Finally, Maxwell's equations represented by the vector potential with a Coulomb gauge, together with the ODEs, are solved self-consistently. For numerical examples, the interaction between EM fields and a particle is investigated for both the closed, open and inhomogeneous electromagnetic systems. The proposed approach not only captures the Rabi oscillation phenomenon in the closed cavity but also captures the effects of radiative decay and shift in the open free space. After comparing with the existing theoretical approximate models, it is found that the approximate models break down in certain cases where a rigorous self-consistent approach is needed. This work is helpful for the EM simulation of emerging nanodevices or next-generation quantum electrodynamic systems.
MATH-PHJul 18, 2012
A novel fast solver for Poisson equation with the Neumann boundary conditionZu-Hui Ma, Weng Cho Chew, Lijun Jiang
In this paper we present a novel fast method to solve Poisson equation in an arbitrary two dimensional region with Neumann boundary condition. The basic idea is to solve the original Poisson problem by a two-step procedure: the first one finds the electric displacement field $\mathbf{D}$ and the second one involves the solution of potential $ϕ$. The first step exploits loop-tree decomposition technique that has been applied widely in integral equations within the computational electromagnetics (CEM) community. We expand the electric displacement field in terms of a tree basis. Then, coefficients of the tree basis can be found by the fast tree solver in O(N) operations. Such obtained solution, however, fails to expand the exact field because the tree basis is not completely curl free. Despite of this, the accurate field could be retrieved by carrying out a procedure of divergence free field removal. Subsequently, potential distribution $ϕ$ can be found rapidly at the second stage with another fast approach of O(N) complexity. As a result, the method dramatically reduces solution time comparing with traditional FEM with iterative method. Numerical examples including electrostatic simulations are presented to demonstrate the efficiency of the proposed method.
NADec 8, 2014
Multilevel Fast Multipole Algorithm for Characteristic Mode AnalysisQi I. Dai, Jun Wei Wu, Ling Ling Meng et al.
Characteristic mode (CM) analysis poses challenges in computational electromagnetics (CEM) as it calls for efficient solutions of dense generalized eigenvalue problems (GEP). Multilevel fast multipole algorithm (MLFMA) can greatly reduce the computational complexity and memory cost for matrix-vector product operations, which is powerful in iteratively solving large scattering problems. In this article, we demonstrate that MLFMA can be easily incorporated into the implicit restarted Arnoldi (IRA) method for the calculation of CMs, where MLFMA with the sparse approximate inverse (SAI) preconditioning technique is employed to accelerate the construction of Arnoldi vectors. This work paves the way of CM analysis for large-scale and complicated three-dimensional ($3$-D) objects with limited computational resources.