共查询到19条相似文献,搜索用时 218 毫秒
1.
2.
3.
4.
5.
对光电器件采用FEM/EFIE仿真分析所产生的线性系统的迭代求解算法进行了研究。与目前普遍使用的迭代法不同,针对FEM/EFIE系数矩阵的特点,提出了采用求解复对称且非正定的线性方程组的共轭正交共轭梯度(COCG)算法来进行高效迭代求解。数值实验基于对波导元件分别采用矢量有限元法(FEM)和电场积分方程法(EFIE)得到的两类典型线性系统进行迭代求解。结果表明:与常规迭代法相比,COCG在求解速度和内存使用上的性能优势非常明显,从而能较大地提高仿真效率。 相似文献
6.
7.
将矢量有限元/边界积分混合方法(FE/BI)用于背腔式贴片天线的输入阻抗建模,在FE/BI方法中,采用基于六面体网格(hexahedron)的高阶矢量基函数(higher order vector basis functions)展开未知场分量;结合高阶矢量FE/BI,采用最近发展起来的WCAWE技术(Well-Conditioned Asymptotic Waveform Evaluation)实现了贴片天线输入阻抗的快速计算;WCAWE技术通过正交化的方式获得低阶模型,这种方式避免了Arnoldi等子空间技术增加矩阵尺度的缺点,同时也确保具有比传统的AWE更好的频带展宽特性;关于输入阻抗计算的数值结果将证明WCAWE技术的优势. 相似文献
8.
针对信源数目未知情况下的DOA估计问题,该文提出了两种基于稀疏表示的DOA估计方法。一种是基于阵列协方差矩阵特征向量稀疏表示的DOA估计方法,首先证明了阵列协方差矩阵的最大特征向量是所有信号导向矢量的线性组合,然后利用阵列协方差矩阵的最大特征向量建立稀疏模型进行DOA估计;另一种是基于阵列协方差矩阵高阶幂稀疏表示的DOA估计方法,根据信号特征值大于噪声特征值的特性,通过对协方差矩阵的高阶幂逼近信号子空间,利用协方差矩阵的高阶幂的列向量建立DOA估计的稀疏模型进行DOA估计。理论分析和仿真实验验证,两种方法都不需要进行信号源数目的估计,具有较高的精度、较好的分辨力,对相干信号也具有优越的适应能力。 相似文献
9.
FEM/BEM混合法计算各向异性不均匀介质柱电磁散射 总被引:1,自引:0,他引:1
应用有限元-边界元(FEM/BEM)混合法计算二维各向异性不均匀介质柱电磁散射,对介质柱内、外区域分别采用有限元和边界元法进行分析,然后应用边界条件建立部分稀疏部分满填充的矩阵方程.应用内观法结合多波前法求解该矩阵方程,分别计算了均匀分布和不均匀分布的各向异性介质柱的雷达散射截面.数值计算表明,有限元-边界元混合法在分析和计算不均匀开放域电磁问题时有一定的优势. 相似文献
10.
11.
12.
Finite element analysis of lossy dielectric waveguides 总被引:1,自引:0,他引:1
This paper presents a full-wave analysis of lossy dielectric waveguides using a hybrid vector finite element method. To avoid the occurrences of spurious modes in the formulation, edge elements and first-order nodal finite element basis functions are used to span the transverse and the z components of the electric field, respectively. Furthermore, the direct matrix solution technique with minimum degree of reordering has been combined with the modified Lanczos algorithm to solve for the resultant sparse generalized eigenmatrix equation efficiently 相似文献
13.
14.
15.
Yi Ren Zaiping Nie Yanwen Zhao Wenmin Ma 《Geoscience and Remote Sensing, IEEE Transactions on》2008,46(7):1975-1981
The higher order vector basis functions defined in large patches have been utilized in the numerical solution of integral equations in this paper to sparsify the impedance matrix and relieve the memory pressure. The physical explanation for the sparsification of the impedance matrix is also elucidated. Furthermore, the maximally orthogonalized bases have been applied to improve the condition number of the impedance matrix. The scaling factor was reformed to speed up the iteration convergence in the numerical solution. Finally, the iterative method for sparse matrix equations is applied to improve the solution efficiency. Some numerical results are provided to illustrate the excellent performance both in the sparsification of the impedance matrix and solution efficiency for numerical analysis of the scattering problem. 相似文献
16.
Differential Forms, Galerkin Duality, and Sparse Inverse Approximations in Finite Element Solutions of Maxwell Equations 总被引:1,自引:0,他引:1
We identify primal and dual formulations in the finite element method (FEM) solution of the vector wave equation using a geometric discretization based on differential forms. These two formulations entail a mathematical duality denoted as Galerkin duality. Galerkin-dual FEM formulations yield identical nonzero (dynamical) eigenvalues (up to machine precision), but have static (zero eigenvalue) solution spaces of different dimensions. Algebraic relationships among the degrees of freedom of primal and dual formulations are explained using a deep-rooted connection between the Hodge-Helmholtz decomposition of differential forms and Descartes-Euler polyhedral formula, and verified numerically. In order to tackle the fullness of dual formulation, algebraic and topological thresholdings are proposed to approximate inverse mass matrices by sparse matrices 相似文献
17.
18.
This paper presents an efficient, simple, hierarchical, and sparse three-dimensional capacitance extraction algorithm, i.e., ICCAP. Most previous capacitance extraction algorithms, such as FastCap and HiCap, introduce intermediate variables to facilitate the hierarchical potential calculation, but still preserve the basic panels as basis. In this paper, we discover that those intermediate variables are a fundamentally much better basis than leaf panels. As a result, we are able to explicitly construct the sparse potential coefficient matrix and solve it with linear memory and linear run time in comparison with the most recent hierarchical O(nlogn) approach in PHiCap. Furthermore, the explicit sparse formulation of a potential matrix not only enables the usage of preconditioned Krylov subspace iterative methods, but also the reordering technique. A new reordering technique, i.e., level-oriented reordering (LOR), is proposed to further reduce over 20% of memory consumption and run time compared with no reordering techniques applied. In fact, LOR is even better than the state-of-the-art minimum degree reordering and more efficient. Without complicated orthonormalization matrix computation, ICCAP is very simple, efficient, and accurate. Experimental results demonstrate the superior run time and memory consumption over previous approaches while achieving similar accuracy. 相似文献
19.
为了实现少快拍、低信噪比(SNR)条件下的水下目标快速方位估计,该文建立矢量水听器阵列方位估计稀疏表示模型。利用实值转化技术将复数方向矩阵转化到实数域,以便利用平滑L0算法对稀疏信号矩阵进行重构从而得到方位估计结果。该文改进平滑L0算法,利用收敛性更好的复合反比例函数(CIPF)函数作为平滑函数以及提出促稀疏加权的方法,该方法通过加权的方式修正噪声条件下L2范数作为迭代初始值偏离稀疏解较远的问题来促进算法快速收敛于稀疏解。通过仿真验证了该文提出的基于实值转换的促稀疏加权平滑L0算法在少快拍、低信噪比的条件下可以实现优于传统子空间类算法的性能,并且在保证性能的同时,显著提高方位估计的速度。 相似文献