اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn $O(N^3)$ algorithm for the calculation of far field radiation patterns
76
0
0.0
(
0
)
تأليف
Travis Garrett
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a new method for computing the Near-To-Far-Field (NTFF) transformation in FDTD simulations which has an overall scaling of $O(N^3)$ instead of the standard $O(N^4)$. By mapping the far field with a cartesian coordinate system the 2D surface integral can be split into two successive 1D integrals. For a near field spanned by $N_X times N_Y$ discrete sample points, and a far field spanned by $N_{theta} times N_{phi}$ points, the calculation can then be performed in $O(N_{theta}N_X N_Y) + O(N_{theta}N_{phi}N_Y)$ operations instead of $O(N_{theta}N_{phi}N_X N_Y)$.
قيم البحث
اقرأ أيضاً
This paper briefly highlights the features of the software tool [RadPat4W], named after Radiation Patterns for Windows but also compatible with the [Wine] environment of Linux. The tool is a stand-alone part of a freeware suite that is based on an al
ternative exposition of fundamental Antenna Theory and is under active development for many years now. Nevertheless, [RadPat4W] source code has been now released as FLOSS Free Libre Open Source Software and thus it may be freely used, copied, modified or redistributed, individually or cooperatively, by the interested user to suit her/his personal needs for reliable antenna applications from the simplest to the more complex.
In the Survivable Network Design problem (SNDP), we are given an undirected graph $G(V,E)$ with costs on edges, along with a connectivity requirement $r(u,v)$ for each pair $u,v$ of vertices. The goal is to find a minimum-cost subset $E^*$ of edges,
that satisfies the given set of pairwise connectivity requirements. In the edge-connectivity version we need to ensure that there are $r(u,v)$ edge-disjoint paths for every pair $u, v$ of vertices, while in the vertex-connectivity version the paths are required to be vertex-disjoint. The edge-connectivity version of SNDP is known to have a 2-approximation. However, no non-trivial approximation algorithm has been known so far for the vertex version of SNDP, except for special cases of the problem. We present an extremely simple algorithm to achieve an $O(k^3 log n)$-approximation for this problem, where $k$ denotes the maximum connectivity requirement, and $n$ denotes the number of vertices. We also give a simple proof of the recently discovered $O(k^2 log n)$-approximation result for the single-source version of vertex-connectivity SNDP. We note that in both cases, our analysis in fact yields slightly better guarantees in that the $log n$ term in the approximation guarantee can be replaced with a $log tau$ term where $tau$ denotes the number of distinct vertices that participate in one or more pairs with a positive connectivity requirement.
We implement two recently developed fast Coulomb solvers, HSMA3D [J. Chem. Phys. 149 (8) (2018) 084111] and HSMA2D [J. Chem. Phys. 152 (13) (2020) 134109], into a new user package HSMA for molecular dynamics simulation engine LAMMPS. The HSMA package
is designed for efficient and accurate modeling of electrostatic interactions in 3D and 2D periodic systems with dielectric effects at the O(N) cost. The implementation is hybrid MPI and OpenMP parallelized and compatible with existing LAMMPS functionalities. The vectorization technique following AVX512 instructions is adopted for acceleration. To establish the validity of our implementation, we have presented extensive comparisons to the widely used particle-particle particle-mesh (PPPM) algorithm in LAMMPS and other dielectric solvers. With the proper choice of algorithm parameters and parallelization setup, the package enables calculations of electrostatic interactions that outperform the standard PPPM in speed for a wide range of particle numbers.
Using an Environmentally Friendly Renormalization Group we derive an ab initio universal scaling form for the equation of state for the O(N) model, y=f(x), that exhibits all required analyticity properties in the limits $xto 0$, $xtoinfty$ and $xto -
1$. Unlike current methodologies based on a phenomenological scaling ansatz the scaling function is derived solely from the underlying Landau-Ginzburg-Wilson Hamiltonian and depends only on the three Wilson functions $gamma_lambda$, $gamma_phi$ and $gamma_{phi^2}$ which exhibit a non-trivial crossover between the Wilson-Fisher fixed point and the strong coupling fixed point associated with the Goldstone modes on the coexistence curve. We give explicit results for N=2, 3 and 4 to one-loop order and compare with known results.
Tree comparison metrics have proven to be an invaluable aide in the reconstruction and analysis of phylogenetic (evolutionary) trees. The path-length distance between trees is a particularly attractive measure as it reflects differences in tree shape
as well as differences between branch lengths. The distance equals the sum, over all pairs of taxa, of the squared differences between the lengths of the unique path connecting them in each tree. We describe an $O(n log n)$ time for computing this distance, making extensive use of tree decomposition techniques introduced by Brodal et al. (2004).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
