期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到2,242篇文章
< 1 2 … 113 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A fast algorithm for solving the scattering problem from an open rectangular cavity 认领 引用
1
作者 HAN Shangqi LI Yuan 《黑龙江大学自然科学学报》 CAS 2026年第1期31-41,共11页
This paper presents a fast algorithm for solving the scattering problem from an open rectangular cavity embedded in the ground plane.The computational region is chosen as the union of two rectangular regions:one is a ... This paper presents a fast algorithm for solving the scattering problem from an open rectangular cavity embedded in the ground plane.The computational region is chosen as the union of two rectangular regions:one is a region above the ground,the other one is a region containing the cavity.The finite difference scheme is constructed in each region.An intermediate layer of the mesh is shared by both regions,which is the key of the algorithm.A cyclic reduction method is employed to solve the difference equation in the region above the ground.Then the numerical solution on the cavity aperture can be obtained.The numerical experiments are provided to verify the feasibility of the proposed algorithm. 展开更多
关键词 scattering problem cavity Helmholtz equation fast algorithm difference equation cyclic reduction method
暂未订购 下载PDF
Fast algorithm for constructing neighbor-joining phylogenetic trees 认领 引用 被引量：4
2
作者 陈宁涛 王能超 施保昌 《Journal of Southeast University(English Edition)》 EI CAS 2006年第2期176-179,共4页
To improve the performance of Saitou and Nei＇s algorithm （SN） and Studier and Keppler＇s improved algorithm （SK） for constructing neighbor-joining phylogenetic trees and reduce the time complexity of the computat... To improve the performance of Saitou and Nei＇s algorithm （SN） and Studier and Keppler＇s improved algorithm （SK） for constructing neighbor-joining phylogenetic trees and reduce the time complexity of the computation, a fast algorithm is proposed. The proposed algorithm includes three techniques. First, a linear array A[N] is introduced to store the sum of every row of the distance matrix （the same as SK）, which can eliminate many repeated computations. Secondly, the value of A [i] is computed only once at the beginning of the algorithm, and is updated by three elements in the iteration. Thirdly, a very compact formula for the sum of all the branch lengths of operational taxonomic units （OTUs） i and j is designed, and the correctness of the formula is proved. The experimental results show that the proposed algorithm is from tens to hundreds times faster than SN and roughly two times faster than SK when N increases, constructing a tree with 2 000 OTUs in 3 min on a current desktop computer. To earn the time with the cost of the space and reduce the computations in the innermost loop are the basic solutions for algorithms with many loops. 展开更多
关键词 phylogenetic tree neighbor-joining method fast algorithm progressive multiple alignment
暂未订购 下载PDF
A Fast Algorithm for Phase Grating Preparation by Real Space Method 认领 引用
3
作者 Qiuxiang LIU and Yuanming WANG Laboratory of Atomic Imaging of Solids, Institute of Metal Research, Chinese Academy of Sciences, Shengyang 110015, China Qibin YANG and Xiaohong YAN Institute of Modern Physics, Xiangtan University, Xiangtan 411105, China 《Journal of Materials Science & Technology》 SCIE EI CAS 2001年第2期240-242,共3页
Making use of this expression to calculate the phase grating in high resolution image simulation can greatly reduce the calculating time. In this paper, the derivation of the expression is introduced, and then the com... Making use of this expression to calculate the phase grating in high resolution image simulation can greatly reduce the calculating time. In this paper, the derivation of the expression is introduced, and then the computer routine is explained in details. Finally the potential projection map of Mg44Rh7 along [001] direction is shown as an illustration. All operations are carried out in real space, so we call the calculation method as the real space method. 展开更多
关键词 A Fast Algorithm for Phase Grating Preparation by Real Space Method
暂未订购 下载PDF
Fast algorithm for simulation of normal and oblique penetration into limestone targets 认领 引用 被引量：3
4
作者 Xuguang CHEN Duo ZHANG +1 位作者 Shujian YAO Fangyun LU 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI CSCD 2017年第5期671-688,共18页
A fast algorithm is proposed to predict penetration trajectory in simulation of normal and oblique penetration of a rigid steel projectile into a limestone target. The algorithm is designed based on the idea of isolat... A fast algorithm is proposed to predict penetration trajectory in simulation of normal and oblique penetration of a rigid steel projectile into a limestone target. The algorithm is designed based on the idea of isolation between the projectile and the target. Corresponding factors of influence are considered, including analytical load model, cratering effect, free surface effect, and separation-reattachment phenomenon. Besides, a method of cavity ring is used to study the process of cavity expansion. Further, description of the projectile＇s three-dimensional gesture is coded for fast calculation, named PENE3D. A presented. As a result, the algorithm is series of cases with selected normal and oblique penetrations are simulated by the algorithm. The predictions agree with the results of tests, showing that the proposed algorithm is fast and effective in simulation of the penetration process and prediction of the penetration trajectory. 展开更多
关键词 fast algorithm isolation between projectile and target analytical loading model ogive-nosed projectile limestone target
暂未订购 下载PDF
A Fast Algorithm for Matching Remote Scene Images 认领 引用
5
作者 LIU Jin YAN Li 《Geo-Spatial Information Science》 EI 2008年第3期197-200,共4页
An iterative algorithm to calculate mutual correlation using hierarchical key points and the search space mark principle is proposed. An effective algorithm is designed to improve the matching speed. By hi-erarchical ... An iterative algorithm to calculate mutual correlation using hierarchical key points and the search space mark principle is proposed. An effective algorithm is designed to improve the matching speed. By hi-erarchical key point algorithm and mutual correlation coefficients of the matching images, the important points can be iteratively calculated in the images hierarchically, and the correlation coefficient can be ob-tained with satisfactory precision. Massive spots in the parameter space which are impossible to match can be removed by the search space mark principle. Two approximate continuities in the correlation image matching process, the image gray level distribution continuity and the correlation coefficient value in the parameter space continuity, are considered in the method. The experiments show that the new algorithm can greatly enhance matching speed and achieve accurate matching results. 展开更多
关键词 image correlation matching fast algorithm iterative algorithm
暂未订购 下载PDF
A fast algorithm for multivariate Hermite interpolation 认领 引用 被引量：2
6
作者 LEI Na TENG Yuan REN Yu-xue 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2014年第4期438-454,共17页
Multivariate Hermite interpolation is widely applied in many fields, such as finite element construction, inverse engineering, CAD etc.. For arbitrarily given Hermite interpolation conditions, the typical method is to... Multivariate Hermite interpolation is widely applied in many fields, such as finite element construction, inverse engineering, CAD etc.. For arbitrarily given Hermite interpolation conditions, the typical method is to compute the vanishing ideal I （the set of polynomials satisfying all the homogeneous interpolation conditions are zero） and then use a complete residue system modulo I as the interpolation basis. Thus the interpolation problem can be converted into solving a linear equation system. A generic algorithm was presented in [18], which is a generalization of BM algorithm [22] and the complexity is O（τ^3） where r represents the number of the interpolation conditions. In this paper we derive a method to obtain the residue system directly from the relative position of the points and the corresponding derivative conditions （presented by lower sets） and then use fast GEPP to solve the linear system with O（（τ ＋ 3）τ^2） operations, where τ is the displacement-rank of the coefficient matrix. In the best case τ = 1 and in the worst case τ = [τ], where n is the number of variables. 展开更多
关键词 vanishing ideal multivariate Hermite interpolation displacement structure fast GEPP algorithm.
暂未订购 下载PDF
A Fast Algorithm for Improving the Visual Distance in Fog 认领 引用
7
作者 YANG Wei XIAO Zhi-tao +1 位作者 YU Jian YAN Zhi-jie 《Semiconductor Photonics and Technology》 2009年第4期241-246,共6页
Images captured outdoor usually degenerate because of the bad weather conditions,among which fog,one of the widespread phenomena,affects the video quality greatly.The physical features of fog make the video blurred an... Images captured outdoor usually degenerate because of the bad weather conditions,among which fog,one of the widespread phenomena,affects the video quality greatly.The physical features of fog make the video blurred and the visible distance shortened,seriously impairing the reliability of the video system.In order to satisfy the requirement of image processing in real-time,the normal distribution curve fitting technology is used to fit the histogram of the sky part and the region growing method is used to segment the region of sky.As for the non-sky part,a method of self-adaptive interpolation to equalize the histogram is adopted to enhance the contrast of the images.Experiment results show that the method works well and will not cause block effect. 展开更多
关键词 fog image interpolation region growing histogram equalization fast algorithm normaldistribution
暂未订购 下载PDF
Fast Algorithms for Computing the Hilbert Transform of a Given Function with Cubic Splines 认领 引用
8
作者 Bo Yu Jiaxin Du Xiaoxiao Qin 《Communications on Applied Mathematics and Computation》 EI CSCD 2026年第1期324-337,共14页
2 It is important to compute the Hilbert transform of a given function defined on a finite interval.In 2013,Micchelli and his collaborators proposed a fast algorithm,which is called the Hilbert spline transform,to cal... 2 It is important to compute the Hilbert transform of a given function defined on a finite interval.In 2013,Micchelli and his collaborators proposed a fast algorithm,which is called the Hilbert spline transform,to calculate the Hilbert transform of a given function on a finite interval with the computational complexity O(n log n),where the spline knots were chosen to be the midpoints of sampling points.A natural question is that,whether or not the spline knots can be chosen to be the same as the sampling points.This paper gives a positive answer to this question.Besides,the analytic expression of the Hilbert transform of B-splines of any order is also established.Furthermore,the problem of how to choose spline coefficients,using the quasi-interpolation method or interpolation method,is also considered,although both make sure an optimal approximation order.Several interesting numerical examples are implemented and compared with most of the existing methods.Numerical results show that the proposed algorithm has a relatively high computational accuracy as well as a relatively low computational complexity. 展开更多
关键词 The Hilbert transform The Hilbert spline transform Quasi-interpolation cubic spline approximation Interpolation cubic spline approximation Fast algorithm
Seismic Data Reconstruction and Noise Suppression Based on an Improved Weighted Fast Projection onto Convex Sets Algorithm 认领 引用
9
作者 Cheng Gao-peng Zhang Hua +3 位作者 Li Hong-xing Song Yu Yue Ming Zhang Kai-dong 《Applied Geophysics》 SCIE CSCD 2026年第1期336-351,433,434,共16页
In eld seismic data acquisition,seismic traces are often aected by substantial data gaps and strong noise interference due to environmental and instrumental factors,thus degrading the resolution and signalto-noise rat... In eld seismic data acquisition,seismic traces are often aected by substantial data gaps and strong noise interference due to environmental and instrumental factors,thus degrading the resolution and signalto-noise ratio(SNR)of the seismic profiles.Effective seismic data reconstruction and noise suppression techniques are therefore essential to recover missing signals and improve data quality.In this study,a fast projection onto convex sets(FPOCS)algorithm is proposed by incorporating an inertial parameter that involves a linear combination of the two preceding iterations based on the traditional projection onto convex sets(POCS)algorithm.Then,a weighting factor is introduced to achieve simultaneous data reconstruction and noise suppression using the weighted fast projection onto convex sets(WFPOCS)algorithm.To further suppress residual random noise in the updated solution,an optimization strategy is adopted by swapping the order of the iterative hard thresholding operator and the projection operator.The nal algorithm,termed the improved weighted fast projection onto convex sets(IWFPOCS),achieves high-efciency reconstruction and effective noise suppression.Compared with WFPOCS,the proposed method maintains fast reconstruction speed while demonstrating superior denoising performance on irregularly missing and noisy datasets.Field data experiments conrm that the proposed method signicantly improves the SNR and resolution of seismic data,oering strong practical potential for subsequent processing and interpretation. 展开更多
关键词 Seismic data reconstruction Fast projection onto convex set algorithm Curvelet transform Weighted fast projection onto convex set algorithm Noise suppression
暂未订购 下载PDF
结合车辆追踪技术与FastDTW算法的桥梁动态称重方法 认领 引用
10
作者 靳阳 杨干 +4 位作者 陈鹏涛 王涛 陈适之 王红霞 韩万水 《中国公路学报》 EI CAS CSCD 北大核心 2026年第6期267-281,共15页
传统桥梁动态称重算法往往假设车辆匀速直线行驶,且默认上下桥时刻已知。然而,在实际工程中,车辆行驶特征复杂,上下桥时刻也难以从监测数据精确获取。为解决这些难题,提出一种融合计算机视觉技术与快速动态时间规整(FastDTW)算法的桥梁... 传统桥梁动态称重算法往往假设车辆匀速直线行驶,且默认上下桥时刻已知。然而,在实际工程中,车辆行驶特征复杂,上下桥时刻也难以从监测数据精确获取。为解决这些难题,提出一种融合计算机视觉技术与快速动态时间规整(FastDTW)算法的桥梁动态称重方法。该方法能充分考虑车辆真实行驶特性,即便上下桥时间存在偏差,仍可实现精准称重。在具体操作流程上,先利用计算机视觉技术识别、追踪车辆,获取其时空信息;接着结合车辆重量统计数据,初始化车辆荷载,为后续迭代求解真实车辆荷载提供原始数据。然后,借助FastDTW算法关联桥梁响应的计算与实测时程曲线,通过不断迭代调整轴距、轴重信息,使两者逐步逼近,进而得到准确的车辆轴距和轴重。经模拟计算与模型试验验证,该方法在考虑车辆加减速、变道等行驶特征时,轴距、轴重识别平均相对误差仅为2.83%和2.67%,最大相对误差分别为5.60%和5.84%,总重最大相对误差为4.28%。此外,在实桥试验验证中,最大轴距、最大轴重识别相对误差分别为10.03%和6.16%,最大总重识别相对误差为5.72%。这充分展现出该算法的准确性与适用性,应用前景十分广阔。 展开更多
关键词 桥梁工程 桥梁动态称重 计算机视觉技术 动态时间规整算法 车辆行驶特征
暂未订购 下载PDF
Fast algorithm for viscous Cahn-Hilliard equation 认领 引用 被引量：1
11
作者 Danxia WANG Yaqian LI +1 位作者 Xingxing WANG Hongen JIA 《Frontiers of Mathematics in China》 SCIE CSCD 2022年第4期689-713,共25页
The main purpose of this paper is to solve the viscous Cahn-Hilliard equation via a fast algorithm based on the two time-mesh(TT-M)finite element(FE)method to ease the problem caused by strong nonlinearities.The TT-M ... The main purpose of this paper is to solve the viscous Cahn-Hilliard equation via a fast algorithm based on the two time-mesh(TT-M)finite element(FE)method to ease the problem caused by strong nonlinearities.The TT-M FE algorithm includes the following main computing steps.First,a nonlinear FE method is applied on a coarse time-meshτc.Here,the FE method is used for spatial discretization and the implicit second-orderθscheme(containing both implicit Crank-Nicolson and second-order backward difference)is used for temporal discretization.Second,based on the chosen initial iterative value,a linearized FE system on time fine mesh is solved,where some useful coarse numerical solutions are found by Lagrange’s interpolation formula.The analysis for both stability and a priori error estimates is made in detail.Numerical examples are given to demonstrate the validity of the proposed algorithm.Our algorithm is compared with the traditional Galerkin FE method and it is evident that our fast algorithm can save computational time. 展开更多
关键词 Fast algorithm two time-mesh(TT-M)finite element(FE)method viscous Cahn-Hilliard equation stability CPU time
暂未订购 下载PDF
A Fast Algorithm for Solving CNOP and Associated Target Observation Tests 认领 引用 被引量：9
12
作者 王斌 谭晓伟 《Acta meteorologica Sinica》 2009年第4期387-402,共16页
Conditional Nonlinear Optimal Perturbation （CNOP） is a new method proposed by Mu et al. in 2003, which generalizes the linear singular vector （LSV） to include nonlinearity. It has become a powerful tool for studyi... Conditional Nonlinear Optimal Perturbation （CNOP） is a new method proposed by Mu et al. in 2003, which generalizes the linear singular vector （LSV） to include nonlinearity. It has become a powerful tool for studying predictability and sensitivity among other issues in nonlinear systems. This is because the CNOP is able to represent, while the LSV is unable to deal with, the fastest developing perturbation in a nonlinear system. The wide application of this new method, however, has been limited due to its large computational cost related to the use of an adjoint technique. In order to greatly reduce the computational cost, we hereby propose a fast algorithm for solving the CNOP based on the empirical orthogonal function （EOF）. The algorithm is tested in target observation experiments of Typhoon Matsa using the Global/Regional Assimilation and PrEdiction System （GRAPES）, an operational regional forecast model of China. The effectivity and feasibility of the algorithm to determine the sensitivity （target） area is evaluated through two observing system simulation experiments （OSSEs）. The results, as expected, show that the energy of the CNOP solved by the new algorithm develops quickly and nonlinearly. The sensitivity area is effectively identified with the CNOP from the new algorithm, using 24 h as the prediction time window. The 24-h accumulated rainfall prediction errors （ARPEs） in the verification region are reduced significantly compared with the ＂true state,＂ when the initial conditions （ICs） in the sensitivity area are replaced with the ＂observations.＂ The decrease of the ARPEs can be achieved for even longer prediction times （e.g., 72 h）. Further analyses reveal that the decrease of the 24-h ARPEs in the verification region is attributable to improved simulations of the typhoon＇s initial warm-core, upper level relative vorticity, water vapor conditions, etc., as a result of the updated ICs in the sensitivity area. 展开更多
关键词 fast algorithm CNOP （Conditional Nonlinear Optimal Perturbation） target observation OSSE （observing system simulation experiment）
A fast algorithm for determining the linear complexity of a binary sequence with period 2~np^m 认领 引用 被引量：4
13
作者 魏仕民 肖国镇 陈钟 《Science in China(Series F)》 2001年第6期453-460,共8页
An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalize... An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2' and the algorithm for computing the linear complexity of a binary sequence with period pn, where 2 is a primitive root modulo p2. 展开更多
关键词 cryptography periodic sequence linear complexity minimal polynomial fast algorithm.
Fast direction of arrival algorithm based on vector-sensor arrays using wideband sources 认领 引用 被引量：1
14
作者 孙国仓 惠俊英 陈阳 《Journal of Marine Science and Application》 2008年第3期195-199,共5页
An acoustic vector sensor(AVS)can capture more information than a conventional acoustic pressure sensor(APS).As a result,more output channels are required when multiple AVS are formed into arrays,making processing the... An acoustic vector sensor(AVS)can capture more information than a conventional acoustic pressure sensor(APS).As a result,more output channels are required when multiple AVS are formed into arrays,making processing the data stream computationally intense.This paper proposes a new algorithm based on the propagator method for wideband coherent sources that eliminates eigen-decomposition in order to reduce the computational burden.Data from simulations and lake trials showed that the new algorithm is valid:it resolves coherent sources,breaks leftight ambiguity,and allows inter element spacing to exceed a half-wavelength. 展开更多
关键词 acoustic vector sensor propagator method coherent processing fast algorithm
暂未订购 下载PDF
Improvement and performance of parallel multilevel fast multipole algorithm 认领 引用 被引量：16
15
作者 Zhanhe Liu Peilin Huang +1 位作者 Zhe Wu Xu Gao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2011年第1期164-169,共6页
The method of establishing data structures plays an important role in the efficiency of parallel multilevel fast multipole algorithm（PMLFMA）.Considering the main complements of multilevel fast multipole algorithm（M... The method of establishing data structures plays an important role in the efficiency of parallel multilevel fast multipole algorithm（PMLFMA）.Considering the main complements of multilevel fast multipole algorithm（MLFMA） memory,a new parallelization strategy and a modified data octree construction scheme are proposed to further reduce communication in order to improve parallel efficiency.For far interaction,a new scheme called dynamic memory allocation is developed.To analyze the workload balancing performance of a parallel implementation,the original concept of workload balancing factor is introduced and verified by numerical examples.Numerical results show that the above measures improve the parallel efficiency and are suitable for the analysis of electrical large-scale scattering objects. 展开更多
关键词 multilevel fast multipole algorithm（MLFMA） electromagnetic scattering parallelization radar cross section（RCS）.
暂未订购 下载PDF
Fast period estimation of X-ray pulsar signals using an improved fast folding algorithm 认领 引用 被引量：2
16
作者 Minzhang SONG Yidi WANG +4 位作者 Wei ZHENG Liansheng LI Yusong WANG Xiaowei HU Yulong WU 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2023年第10期309-316,共8页
An accurate period is important to recover the pulse profile from a recorded photon event series of an X-ray pulsar and to estimate the pulse time of arrival,which is the measurement of X-ray pulsar navigation.Epoch f... An accurate period is important to recover the pulse profile from a recorded photon event series of an X-ray pulsar and to estimate the pulse time of arrival,which is the measurement of X-ray pulsar navigation.Epoch folding is a classical period estimation method in the time domain;however,its computational complexity grows as the number of trail periods increases.In order to reduce the computational complexity,this paper improves the fast folding algorithm through segment correlation and amplitude accumulation,which is based on the post-order traversal of a binary tree.Compared with epoch folding,the improved fast folding algorithm can achieve a similar accuracy at the cost of a lower computational burden.Compared with the original fast folding algorithm,the improved algorithm can be applied to detectors with a much smaller effective area.The performance of the method is investigated by simulation data and observation data from the Neutron star Interior Composition Explorer(NICER). 展开更多
关键词 Epoch folding Fast folding algorithm Pulsar spin period Phase estimation X-ray pulsar
暂未订购 下载PDF
Fast recursive algorithm for two-dimensional Tsallis entropy thresholding method 认领 引用 被引量：2
17
作者 Tang Yinggan Di Qiuyan Guan Xinping 《Journal of Systems Engineering and Electronics》 SCIE EI 2009年第3期619-624,共6页
Recently,a two-dimensional(2-D)Tsallis entropy thresholding method has been proposed as a new method for image segmentation.But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle t... Recently,a two-dimensional(2-D)Tsallis entropy thresholding method has been proposed as a new method for image segmentation.But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle to real time image processing systems.A fast recursive algorithm for 2-D Tsallis entropy thresholding is proposed.The key variables involved in calculating 2-D Tsallis entropy are written in recursive form.Thus,many repeating calculations are avoided and the computation complexity reduces to O(L2)from O(L4).The effectiveness of the proposed algorithm is illustrated by experimental results. 展开更多
关键词 image segmentation thresholding Tsallis entropy fast recursive algorithm
暂未订购 下载PDF
An adaptive reanalysis method for genetic algorithm with application to fast truss optimization 认领 引用 被引量：3
18
作者 Tao Xu Wenjie Zuo +2 位作者 Tianshuang Xu Guangcai Song Ruichuan Li 《Acta Mechanica Sinica》 SCIE EI CAS 2010年第2期225-234,共10页
Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the de... Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures. 展开更多
关键词 Truss structure Adaptive reanalysis ·Genetic algorithm ·Fast optimization
暂未订购 下载PDF
Efficient analysis of dielectric radomes using multilevel fast multipole algorithm with CRWG basis 认领 引用 被引量：2
19
作者 Que Xiaofeng Nie Zaiping Hu Jun 《Journal of Systems Engineering and Electronics》 SCIE EI 2008年第1期81-87,共7页
A full-wave analysis of the electromagnetic problem of a three-dimensional(3-D)antenna radiating through a 3-D dielectric radome is preserued.The problem is formulated using the Poggio-Miller-Chang-Harrington-Wu(PMCHW... A full-wave analysis of the electromagnetic problem of a three-dimensional(3-D)antenna radiating through a 3-D dielectric radome is preserued.The problem is formulated using the Poggio-Miller-Chang-Harrington-Wu(PMCHW)approach for homogeneous dielectric objects and the electric field integral equation for conducting objects.The integral equations are discretized by the method of moment(MoM),in which the conducting and dielectric surface/interfaces are represented by curvilinear triangular patches and the unknown equivalent electric and magnetic currents are expanded using curvilinear RWG basis functions.The resultant matrix equation is then solved by the multilevel fast multipole algorithm(MLFMA)and fast far-field approximation(FAFFA)is used to further accelerate the computation.The radiation patterns of dipole arrays in the presence of radomes are presented.The numerical results demonstrate the accuracy and versatility of this method. 展开更多
关键词 multilevel fast multipole algorithm antenna radome curvilinear RWG basis PMCHW formulation fast far-field approximation.
暂未订购 下载PDF
General and efficient parallel approach of finite element-boundary integral-multilevel fast multipole algorithm 认领 引用 被引量：3
20
作者 Pan Xiaomin Sheng Xinqing 《Journal of Systems Engineering and Electronics》 SCIE EI 2008年第2期207-212,共6页
A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm(FE-BI-MLFMA).Among many algorithms of FE-BI-MLFMA... A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm(FE-BI-MLFMA).Among many algorithms of FE-BI-MLFMA,the decomposition algorithm(DA)is chosen as a basis for the parallelization of FE-BI-MLFMA because of its distinct numerical characteristics suitable for parallelization.On the basis of the DA,the parallelization of FE-BI-MLFMA is carried out by employing the parallelized multi-frontal method for the matrix from the finiteelement method and the parallelized MLFMA for the matrix from the boundary integral method respectively.The programming and numerical experiments of the proposed parallel approach are carried out in the high perfor-mance computing platform CEMS-Liuhui.Numerical experiments demonstrate that FE-BI-MLFMA is efficiently parallelized and its computational capacity is greatly improved without losing accuracy,efficiency,and generality. 展开更多
关键词 finite element-boundary integral-multilevel fast multipole algorithm parallelization.
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 113 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈