共查询到18条相似文献,搜索用时 125 毫秒
1.
提出一种求解大型区域上电磁场边值问题的多子空间投影分解法,证明其具有几何的收敛速度,并且从理论上分析影响收敛速度的主要因素及收敛特性.该方法非常适合求解多枝区域上的问题,实际算例和理论分析完全一致.结果表明子区域间的连接边界越短,其收敛速度越快,且收敛速度主要取决于子区域间的关联网格点的个数. 相似文献
2.
3.
4.
5.
针对有限周期电磁结构,提出一种高效率的有限元分裂与互连算法.把原求解区域划分成若干个子区域,显著地降低了问题的复杂度.根据广义变分原理,采用拉格朗日乘子在子区域之间交换信息,并建立其相应的粗问题.研究子区域系数矩阵的可逆性.通过引入基本子区域,实现可扩展并行计算,且尤其适合于分析光子晶体等有限周期结构. 相似文献
6.
在确保较高分辩率的前提下,提出了一种相位拼接技术以解决数字全息技术中扩大测量面积的瓶颈问题.在全息数字图记录过程中,确保相邻子孔径间具有重叠区域|拼接中采用相关算法确定重叠区域,并利用再现像重叠区域具有相同信息的特点使用最小二乘方法消除由于孔径的移动所产生的倾斜误差| 相关计算和最小二乘反复迭代把相邻再现像精确统一到一个坐标系下,从而实现测量面积的扩展.以平面物体的测量为例建立了数字全息相位拼接技术的理论模型,完成了对相位物体的2×2拼接模拟,并在对标准相位板2×2的拼接实验中获得了较好的拼接效果. 相似文献
7.
相位拼接技术在数字全息中的应用 总被引:1,自引:0,他引:1
在确保较高分辩率的前提下,提出了一种相位拼接技术以解决数字全息技术中扩大测量面积的瓶颈问题.在全息数字图记录过程中,确保相邻子孔径间具有重叠区域;拼接中采用相关算法确定重叠区域,并利用再现像重叠区域具有相同信息的特点使用最小二乘方法消除由于孔径的移动所产生的倾斜误差;相关计算和最小二乘反复迭代把相邻再现像精确统一到一个坐标系下,从而实现测量面积的扩展.以平面物体的测量为例建立了数字全息相位拼接技术的理论模型,完成了对相位物体的2×2拼接模拟,并在对标准相位板2×2的拼接实验中获得了较好的拼接效果. 相似文献
8.
9.
10.
非定常Navier-Stokes方程基于完全重叠型区域分解的有限元并行算法 总被引:1,自引:0,他引:1
基于完全重叠型区域分解技巧,提出三种求解非定常Navier-Stokes方程的有限元并行算法.其基本思想是首先对空间施行完全重叠区域分解,然后各个处理器使用向后Euler格式独立并行求解关于时间t的常微分方程;对于非线性的对流项,分别采用半隐格式和全隐格式进行处理.算法中每个处理器所负责的子问题是一个全局问题,它定义在整个求解区域上,但绝大部分自由度来自其所负责的子区域,从而使得算法实现简单,通信需求少.数值算例验证了算法的有效性及其良好的并行性能. 相似文献
11.
12.
Because of intrinsic drawbacks of existing algorithm for optical simulation: first, there is an accuracy problem, finite-precision machine arithmetic introduces error into line-surface intersection calculation. Second, these algorithms do not or partially consider process of shadow modeling. In this paper, we present an algorithm based on geometric analysis to simulate fringe projection system, a variable-step-iterative (VSI) algorithm is used to search line-surface intersection point, which can avoid many difficult problems. The proposed algorithm can accurately identify the shadow. Simulation results shows the reconstructed RMS errors obtained by our algorithm are far smaller than those obtained by previous reported algorithm. Simulation results validate our VSI algorithm can obtain more accurate results than many previous intersection point algorithms. Simulation results indicate our shadow modeling algorithm exceeds many existing shadow modeling algorithm, and is equivalent to shadow volumes algorithm, but our shadow algorithm runs faster than shadow volumes algorithm. 相似文献
13.
提出一种数值求解定常不可压缩Stokes方程的并行两水平Grad-div稳定有限元算法。首先在粗网格中求解Grad-div稳定化的全局解, 再在相互重叠的细网格子区域上并行纠正。通过对稳定化参数、粗细网格尺寸恰当的选取, 该方法可得到最优收敛率, 数值结果验证了算法的高效性。 相似文献
14.
According to the essential characters of the image topology, a new hand vein recognition algorithm based on the connection lines of reference point and feature points is proposed. In this method, the intersection points and the endpoints of the vein image are used as feature points. After the intersection points and the endpoints selected as feature points, the reference point for image matching are extracted from these points. The relative distances between the reference point and the feature points and the angles between the adjacent connections of the reference point and feature points are calculated and used as recognition features. Finally these two features are combined for hand vein recognition. This method can effectively overcome the influence on the recognition results caused by image translation and rotation. Experimental results show that the proposed algorithm is able to achieve hand vein recognition reliably and quickly. 相似文献
15.
针对稀疏信号的超分辨方位估计问题,提出一种可变因子的稀疏近似最小方差算法(α-Sparse Asymptotic Minimum Variance,简记为SAMV-α)。该算法利用一个折衷参数进行最大似然估计值和稀疏性能的折衷处理,在迭代过程中改变稀疏近似最小方差算法(Sparse Asymptotic Minimum Variance,SAMV)的指数因子,得到强稀疏性能和超低旁瓣的方位谱图,实现邻近目标的超分辨方位估计和相干处理性能,且无需预估角度和信源数目等先验信息,并且折衷参数的取值为0到1之间,取值区间明确,避免了稀疏信号处理算法中正则因子选取困难的弊端。计算机仿真表明SAMV-α算法方位估计性能明显优于波束扫描类算法和子空间类算法,与同类型稀疏信号处理类算法相比仍具有较高的方位估计精度,同时对于邻近声源分辨能力,SAMV-α算法较SAMV-1算法性能提高约3dB。海上试验数据处理给出了分辨率更高的方位时间历程(Bering-Time Recording,BTR)图,有效验证了SAMV-α算法的性能。 相似文献
16.
非结构网格的并行生成 总被引:1,自引:0,他引:1
研究了非结构网格的并行生成方法.改进了R.Lohner的"波阵面"区域分裂算法以使子网格及其边界更有益于网格并行生成,提出了边界并行优化策略,改善了边界的光滑性;完善了子区域内生成网格时接受新点及新单元的条件,在界面网格生成过程中提出只接受新单元而拒绝新点的策略,节省了机时. 相似文献
17.
三维电磁粒子模拟基于时域有限差分算法(FDTD)和PIC(particle-in-cell)方法.根据FDTD和PIC方法的特点,可以将整个模拟区域分割为多个子区域,每个计算进程模拟计算一个子区域,通过消息传递交换子区域的边界数据从而实现并行计算这一基本思路,完成了并行算法的设计,并分析了并行加速比的影响因素.在三维电磁粒子模拟软件CHIPIC3D上实现了该并行算法并验证了算法的正确性,最后应用CHIPIC3D并行版本对磁绝缘线振荡器和相对论速调管两种典型的高功率微波源器件进行了模拟,证明了该并行算法能取
关键词:
电磁粒子模拟
时域有限差分
并行计算
高功率微波源 相似文献
18.
Y. Pan 《Optics & Laser Technology》1994,26(4)
Processor arrays with an optical bus are introduced for parallel computation in this paper. We use the order statistics problem as an example to demonstrate how to design efficient parallel algorithms on such systems. Besides proposing a new algorithm on the model, some basic data movement operations involved in the algorithm are discussed. We believe that these operations can be used to design other parallel algorithms on the same model. Time analysis indicates that order statistics can be done more efficiently on a linear array with a pipelined optical bus than with an electronic bus. The initial results are promising, and the author believes that optical buses may emerge as a powerful communication mechanism for connecting large parallel computer systems in the near future. 相似文献