期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Improved algorithm of multi-mainlobe interference suppression under uncorrelated and coherent conditions 被引量:1
1
作者 CAI Miaohong CHENG Qiang +1 位作者 MENG Jinli ZHAO Dehua 《Journal of Southeast University(English Edition)》 2025年第1期84-90,共7页
A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the s... A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the spatial spectrum and the directions of arrival(DOA)of interferences to overcome the drawbacks associated with conventional adaptive beamforming(ABF)methods.The mainlobe interferences are identified by calculating the correlation coefficients between direction steering vectors(SVs)and rejected by the BMP pretreatment.Then,IAA is subsequently employed to reconstruct a sidelobe interference-plus-noise covariance matrix for the preferable ABF and residual interference suppression.Simulation results demonstrate the excellence of the proposed method over normal methods based on BMP and eigen-projection matrix perprocessing(EMP)under both uncorrelated and coherent circumstances. 展开更多
关键词 mainlobe interference suppression adaptive beamforming spatial spectral estimation iterative adaptive algorithm blocking matrix preprocessing
在线阅读 下载PDF
Preconditioning Schur Complement Systems of Highly-Indefinite Linear Systems for a Parallel Hybrid Solver
2
作者 I.Yamazaki E.G.Ng 《Numerical Mathematics(Theory,Methods and Applications)》 SCIE 2010年第3期352-366,共15页
A parallel hybrid linear solver based on the Schur complement method has the potential to balance the robustness of direct solvers with the efficiency of preconditioned iterative solvers.However,when solving large-sca... A parallel hybrid linear solver based on the Schur complement method has the potential to balance the robustness of direct solvers with the efficiency of preconditioned iterative solvers.However,when solving large-scale highly-indefinite linear systems,this hybrid solver often suffers from either slow convergence or large memory requirements to solve the Schur complement systems.To overcome this challenge,we in this paper discuss techniques to preprocess the Schur complement systems in parallel. Numerical results of solving large-scale highly-indefinite linear systems from various applications demonstrate that these techniques improve the reliability and performance of the hybrid solver and enable efficient solutions of these linear systems on hundreds of processors,which was previously infeasible using existing state-of-the-art solvers. 展开更多
关键词 Schur complement method PRECONDITIONING matrix preprocessing.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部