首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We present a new high-order integral algorithm for the solution of scattering problems by heterogeneous bodies under TE radiation. Here, a scatterer is represented by a (continuously or discontinuously) varying refractive index n(x) within a two-dimensional (2-D) bounded region. Solutions of the associated Helmholtz equation under given incident fields are then obtained by high-order inversion of the Lippmann-Schwinger integral equation. The algorithm runs in O(N log(N)) operations, where N is the number of discretization points. Our method provides highly accurate solutions in short computing times, even for problems in which the scattering bodies contain complex geometric singularities  相似文献   

2.
3.
4.
5.
We present the linear-linear (LL) basis functions to improve the accuracy of the magnetic-field integral equation (MFIE) and the combined-field integral equation (CFIE) for three-dimensional electromagnetic scattering problems involving closed conductors. We consider the solutions of relatively large scattering problems by employing the multilevel fast multipole algorithm. Accuracy problems of MFIE and CFIE arising from their implementations with the conventional Rao-Wilton-Glisson (RWG) basis functions can be mitigated by using the LL functions for discretization. This is achieved without increasing the computational requirements and with only minor modifications in the existing codes based on the RWG functions  相似文献   

6.
We present a fast solver for the Helmholtz equation on long, thin structures. It operates on an integral equation formulation of the problem, in which the solution is represented as a superposition of fields generated by sources on the structure (usually on the boundary or boundaries of the structure). It uses a standard iterative solver for linear equations, in conjunction with a novel method for applying the forward matrix, whose computational complexity is O(N), where N is the number of points on which the integral equation is solved. The algorithm is suitable for structures in either two dimensions (2-D) or three dimensions. It does not depend in any great detail on the specifics of the Helmholtz equation, and, thus, is also suitable for similar equations. We demonstrate the algorithm by using it to simulate scattering in 2-D from dielectric structures, using an integral equation formulation constructed using a combination of single-layer and double-layer potentials, yielding a second-kind integral equation. Numerical results show the algorithm to be efficient and accurate.  相似文献   

7.
This paper presents the adaptive cross approximation (ACA) algorithm to reduce memory and CPU time overhead in the method of moments (MoM) solution of surface integral equations. The present algorithm is purely algebraic; hence, its formulation and implementation are integral equation kernel (Green's function) independent. The algorithm starts with a multilevel partitioning of the computational domain. The interactions of well-separated partitioning clusters are accounted through a rank-revealing LU decomposition. The acceleration and memory savings of ACA come from the partial assembly of the rank-deficient interaction submatrices. It has been demonstrated that the ACA algorithm results in O(NlogN) complexity (where N is the number of unknowns) when applied to static and electrically small electromagnetic problems. In this paper the ACA algorithm is extended to electromagnetic compatibility-related problems of moderate electrical size. Specifically, the ACA algorithm is used to study compact-range ground planes and electromagnetic interference and shielding in vehicles. Through numerical experiments, it is concluded that for moderate electrical size problems the memory and CPU time requirements for the ACA algorithm scale as N/sup 4/3/logN.  相似文献   

8.
This paper presents a single-level matrix compression algorithm, termed IE-QR, based on a low-rank approximation to speed up the electric field integral equation (EFIE) formulation. It is shown, with the number of groups chosen to be proportional to N/sup 1/2/, where N is the number of unknowns, the memory and CPU time for the resulting algorithm are both O(N/sup 1.5/). The unique features of the algorithm are: a. The IE-QR algorithm is based on the near-rank-deficiency property for well-separated groups. This near-rank-deficiency assumption holds true for many integral equation methods such as Laplacian, radiation, and scattering problems in electromagnetics (EM). The same algorithm can be adapted to other applications outside EM with few or no modifications; and, b. The rank estimation is achieved by a dual-rank process, which ranks the transmitting and receiving groups, respectively. Thus, the IE-QR algorithm can achieve matrix compression without assembling the entire system matrix. Also, a "geometric-neighboring" preconditioner is presented in this paper. This "geometric-neighboring" preconditioner when used in conjunction with GMRES is proven to be both efficient and effective for solving the compressed matrix equations.  相似文献   

9.
Numerical solutions of volume integral equations with high contrast inhomogeneous materials require extremely fine discretization rates making their utility very limited. Given the application of such materials for antennas and metamaterials, it is extremely important to explore computationally efficient modeling methods. In this paper, we propose a novel volume integral equation technique where the domain is divided into different material regions each represented by a corresponding uniform background medium coupled with a variation, together representing the overall inhomogeneity. This perturbational approach enables us to use different Green's functions for each material region. Hence, the resulting volume-surface integral equation alleviates the necessity for higher discretizations within the higher contrast regions. With the incorporation of a junction resolution algorithm for the surface integral equations defined on domain boundaries, we show that the proposed volume-surface integral equation formulation can be generalized to model arbitrary composite structures incorporating conducting bodies as well as highly inhomogeneous material regions.  相似文献   

10.
利用积分方程法计算三维目标单站RCS时,需要逐个角度地进行矩阵方程的求解。为了提高计算效率,本文采用自适应交叉近似算法(ACA)对多角度照射时生成的激励矩阵进行低秩压缩,减少了矩阵方程的求解次数;进一步基于单站角度上的分组方式提出了双层ACA算法,该算法对内存占用极小,提高了算法的并行性,而且更有效地实现了激励矩阵的降秩;最后结合多层快速多极子算法(MLFMA)实现电大尺寸目标的快速求解。数值计算结果表明,该算法能大幅减少大宽角条件下的单站RCS计算时间,具有较高的计算精度和计算效率。  相似文献   

11.
We consider electromagnetics problems involving composite geometries with coexisting open and closed conductors. Hybrid integral equations are presented to improve the efficiency of the solutions, compared to the conventional electric-field integral equation. We investigate the convergence characteristics of iterative solutions of large composite problems with the multilevel fast multipole algorithm. Following a thorough study of how the convergence characteristics depends on the problem geometry, formulation, and iterative solvers, we provide concrete guidelines for efficient solutions.   相似文献   

12.
A numerical algorithm for the analysis of transient electromagnetic fields in planar structures is proposed based on the time-domain magnetic-field integral equation (MFIE), electric-field integral equation (EFIE), and the marching-on-in-time approach. The field vectors are represented in terms of vector potential functions which are calculated either by integration or by the three-dimensional (3-D) wave equation according to the geometry of the structure. Thus, the algorithm combines the advantages of integral equation techniques and finite-difference schemes. While this approach is applicable to any geometries, it is especially suitable for multilayered planar structures and is competitive to the finite-difference time-domain (FDTD) method in the case of open and radiating problems. Theoretical results are verified by the analysis of a pulse propagation in a homogeneous open-end microstrip line  相似文献   

13.
We demonstrate a new inverse scattering algorithm for reconstructing the structure of highly reflecting fiber Bragg gratings. The method, called integral layer-peeling (ILP), is based on solving the Gel'fand-Levitan-Marchenko (GLM) integral equation in a layer-peeling procedure. Unlike in previously published layer-peeling algorithms, the structure of each layer in the ILP algorithm can have a nonuniform profile. Moreover, errors due to the limited bandwidth used to sample the reflection coefficient do not rapidly accumulate along the grating. Therefore, the error in the new algorithm is smaller than in previous layer peeling algorithms. The ILP algorithm is compared to two discrete layer-peeling algorithms and to an iterative solution to the GLM equation. The comparison shows that the ILP algorithm enables one to solve numerically difficult inverse scattering problems, where previous algorithms failed to give an accurate result. The complexity of the ILP algorithm is of the same order as in previous layer peeling algorithms. When a small error is acceptable, the complexity of the ILP algorithm can be significantly reduced below the complexity of previously published layer-peeling algorithms.  相似文献   

14.
Numerical solutions to the impedance boundary condition (IBC) combined source integral equation (CSIE) for scattering from impedance spheres are presented. The CSIE formulation is a well-posed alternative to the IBC electric and magnetic field integral equations which can be contaminated by spurious resonant modes. Compared with the IBC combined field integral equation (CFIE), CSIE solutions have the same accuracy when the combined source coupling admittance is chosen to be the same value as the combined field coupling admittance. However, the CSIE formulation is better suited than the CFIE for creating a general purpose computer code capable of handling aperture radiation problems and/or a scatterer which has a spatially varying surface impedance.  相似文献   

15.
This paper presents new singular curl- and divergence-conforming vector bases that incorporate the edge conditions. Singular bases complete to arbitrarily high order are described in a unified and consistent manner for curved triangular and quadrilateral elements. The higher order basis functions are obtained as the product of lowest order functions and Silvester-Lagrange interpolatory polynomials with specially arranged arrays of interpolation points. The completeness properties are discussed and these bases are proved to be fully compatible with the standard, high-order regular vector bases used in adjacent elements. The curl (divergence) conforming singular bases guarantee tangential (normal) continuity along the edges of the elements allowing for the discontinuity of normal (tangential) components, adequate modeling of the curl (divergence), and removal of spurious modes (solutions). These singular high-order bases should provide more accurate and efficient numerical solutions of both surface integral and differential problems. Sample numerical results confirm the faster convergence of these bases on wedge problems.  相似文献   

16.
研究精确和高效的数值方法是现代纳米器件建模和优化的重要目标之一,而分析大部分纳米器件特性的切入点是确定器件结构的能量本征值和能量本征态。本文提出了一种新的算法—高阶辛时域有限差分法(SFDTD(3,4): symplectic finite-difference time-domain)求解含时薛定谔方程。在时间上采用三阶辛积分格式离散,空间上采用四阶精度的同位差分格式离散,建立了求解含时薛定谔方程的高阶辛时域有限差分算法。将高阶辛算法SFDTD(3,4)用于一维量子阱中盒中粒子和谐振子的仿真中,实验结果表明SFDTD(3,4)法比传统的时域有限差分算法以及高阶时域有限差分算法更加准确,适用于对纳米器件本征问题的长时间仿真。  相似文献   

17.
An accurate and efficient technique called the thin-stratified medium fast-multipole algorithm (TSM-FMA) is presented for solving integral equations pertinent to electromagnetic analysis of microstrip structures, which consists of the full-wave analysis method and the application of the multilevel fast multipole algorithm (MLFMA) to thin stratified structures. In this approach, a new form of the electric-field spatial-domain Green's function is developed in a symmetrical form which simplifies the discretization of the integral equation using the method of moments (MoM). The patch may be of arbitrary shape since their equivalent electric currents are modeled with subdomain triangular patch basis functions. TSM-FMA is introduced to speed up the matrix-vector multiplication which constitutes the major computational cost in the application of the conjugate gradient (CG) method. TSM-FMA reduces the central processing unit (CPU) time per iteration to O(N log N) for sparse structures and to O(N) for dense structures, from O(N3) for the Gaussian elimination method and O(N2) per iteration for the CG method. The memory requirement for TSM-FMA also scales as O(N log N) for sparse structures and as O(N) for dense structures. Therefore, this approach is suitable for solving large-scale problems on a small computer  相似文献   

18.
胡建超  王忠  张维 《通信技术》2009,42(12):226-228
为了更有效的解决高阶非线性非自治系统的求解问题,提出基于等效小参数法的高阶非线性非自治系统的求解方法,应用分解法原理,通过引入谐波平衡和同阶小量相等,建立一类非线性动态系统周期解的逆算符表达的递推算法,将高阶非线性非自治系统转化成一个通用方程,然后利用Matlab开发出相应的软件系统,实现计算机自动求解。对包含sin(t)或cos(t)的非线性非自治GENESIO系统和非线性非自治COULLET系统使用等效小参数法进行详细推导,分别求解非自治GENESIO系统和非自治COULLET系统的周期解,该算法具有较高的计算精度和较大的普适性,是求解一类非线性非自治系统周期解的有效方法。  相似文献   

19.
A reconstruction procedure for electrical conductance tomography developed by solving a linear Fredholm integral equation of the first kind is discussed. The integral equation is obtained from a linearized Poisson's equations. Properties of the integral equation are discussed, and problems associated with numerical solution of the equation are treated. The reconstruction requires only one matrix multiplication and therefore can be computed in a short time. Test results of the algorithm using both simulated and measured data are presented.  相似文献   

20.
众所周知,在内谐振条件下,用积分方程法分析导体的散射特性时,不论是电场积分方程还是磁场积分方程,所求得的解都是不唯一或者不稳定的。本文提出了一种新的方案,通过引入一个微小的复频率,并结合逼近理论求得导体表面的真实电流密度,从而得到正确的导体散射特性。此方法具有实现简单和概念清晰的优点。文中分别以无限长理想导体正方柱和两个理想导体球为例,并将计算结果与混合场积分方程法所得的结果进行比较,它们之间良好的一致性说明了本文所提方法的正确性和有效性。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号