Parallel Implementation of the Discrete Green's Function Formulation of the FDTD Method on a Multicore Central Processing Unit

Parallel implementation of the discrete Green's function formulation of the finite-difference time-domain (DGF-FDTD) method was developed on a multicore central processing unit. DGF-FDTD avoids computations of the electromagnetic field in free-space cells and does not require domain termination by absorbing boundary conditions. Computed DGF-FDTD solutions are compatible with the FDTD grid enabling the perfect hybridization of FDTD with the use of time-domain integral equation methods. The developed implementation can be applied to simulations of antenna characteristics. For the sake of example, arrays of Yagi-Uda antennas were simulated with the use of parallel DGF-FDTD. The efficiency of parallel computations was investigated as a function of the number of current elements in the FDTD grid. Although the developed method does not apply the fast Fourier transform for convolution computations, advantages stemming from the application of DGF-FDTD instead of FDTD can be demonstrated for one-dimensional wire antennas when simulation results are post-processed by the near-to-far-field transformation

Regularization matrices for discrete ill-posed problems in several space-dimensions

Many applications in science and engineering require the solution of large linear discrete ill-posed problems that are obtained by the discretization of a Fredholm integral equation of the first kind in several space dimensions. The matrix that defines these problems is very ill conditioned and generally numerically singular, and the right-hand side, which represents measured data, is typically contaminated by measurement error. Straightforward solution of these problems is generally not meaningful due to severe error propagation. Tikhonov regularization seeks to alleviate this difficulty by replacing the given linear discrete ill-posed problem by a penalized least-squares problem, whose solution is less sensitive to the error in the right-hand side and to roundoff errors introduced during the computations. This paper discusses the construction of penalty terms that are determined by solving a matrix nearness problem. These penalty terms allow partial transformation to standard form of Tikhonov regularization problems that stem from the discretization of integral equations on a cube in several space dimensions

Network analysis with the aid of the path length matrix

Let a network be represented by a simple graph G with n vertices. A common approach to investigate properties of a network is to use the adjacency matrix A=[aij]i,j=1n∈Rn×n associated with the graph G , where aij> 0 if there is an edge pointing from vertex vi to vertex vj , and aij= 0 otherwise. Both A and its positive integer powers reveal important properties of the graph. This paper proposes to study properties of a graph G by also using the path length matrix for the graph. The (ij) th entry of the path length matrix is the length of the shortest path from vertex vi to vertex vj ; if there is no path between these vertices, then the value of the entry is ∞ . Powers of the path length matrix are formed by using min-plus matrix multiplication and are important for exhibiting properties of G . We show how several known measures of communication such as closeness centrality, harmonic centrality, and eccentricity are related to the path length matrix, and we introduce new measures of communication, such as the harmonic K-centrality and global K-efficiency, where only (short) paths made up of at most K edges are taken into account. The sensitivity of the global K-efficiency to changes of the entries of the adjacency matrix also is considered

Proposed magneto-electrostatic ring trap for neutral atoms

We propose a novel trap for confining cold neutral atoms in a microscopic ring using a magneto-electrostatic potential. The trapping potential is derived from a combination of a repulsive magnetic field from a hard drive atom mirror and the attractive potential produced by a charged disk patterned on the hard drive surface. We calculate a trap frequency of [29.7, 42.6, 62.8] kHz and a depth of [16.1, 21.8, 21.8] MHz for [133Cs, 87Rb, 40K], and discuss a simple loading scheme and a method for fabrication. This device provides a one-dimensional potential in a ring geometry that may be of interest to the study of trapped quantum degenerate one-dimensional gases.Comment: 4 pages, 2 figures; revised, including new calculations and further discussio

Program user's manual for optimizing the design of a liquid or gaseous propellant rocket engine with the automated combustor design code AUTOCOM

This computer program manual describes in two parts the automated combustor design optimization code AUTOCOM. The program code is written in the FORTRAN 4 language. The input data setup and the program outputs are described, and a sample engine case is discussed. The program structure and programming techniques are also described, along with AUTOCOM program analysis

Cavity-enhanced optical detection of carbon nanotube Brownian motion

Optical cavities with small mode volume are well-suited to detect the vibration of sub-wavelength sized objects. Here we employ a fiber-based, high-finesse optical microcavity to detect the Brownian motion of a freely suspended carbon nanotube at room temperature under vacuum. The optical detection resolves deflections of the oscillating tube down to 50pm/Hz^1/2. A full vibrational spectrum of the carbon nanotube is obtained and confirmed by characterization of the same device in a scanning electron microscope. Our work successfully extends the principles of high-sensitivity optomechanical detection to molecular scale nanomechanical systems.Comment: 14 pages, 11 figure

Trapping cold atoms near carbon nanotubes: thermal spin flips and Casimir-Polder potential

We investigate the possibility to trap ultracold atoms near the outside of a metallic carbon nanotube (CN) which we imagine to use as a miniaturized current-carrying wire. We calculate atomic spin flip lifetimes and compare the strength of the Casimir-Polder potential with the magnetic trapping potential. Our analysis indicates that the Casimir-Polder force is the dominant loss mechanism and we compute the minimum distance to the carbon nanotube at which an atom can be trapped.Comment: 8 pages, 3 figure