期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Adaptive block greedy algorithms for receiving multi-narrowband signal in compressive sensing radar reconnaissance receiver
1
作者 ZHANG Chaozhu XU Hongyi JIANG Haiqing 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2018年第6期1158-1169,共12页
This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, ... This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, the binary tree search,and the residual monitoring mechanism, two adaptive block greedy algorithms are proposed to achieve a high probability adaptive reconstruction. The use of the block sparsity can greatly improve the efficiency of the support selection and reduce the lower boundary of the sub-sampling rate. Furthermore, the addition of binary tree search and monitoring mechanism with two different supports self-adaption methods overcome the instability caused by the fixed block length while optimizing the recovery of the unknown signal.The simulations and analysis of the adaptive reconstruction ability and theoretical computational complexity are given. Also, we verify the feasibility and effectiveness of the two algorithms by the experiments of receiving multi-narrowband signals on an analogto-information converter(AIC). Finally, an optimum reconstruction characteristic of two algorithms is found to facilitate efficient reception in practical applications. 展开更多
关键词 compressive sensing(CS) adaptive greedy algorithm block sparsity analog-to-information convertor(AIC) multinarrowband signal
在线阅读 下载PDF
Sensitivity Analysis of Structural Dynamic Behavior Based on the Sparse Polynomial Chaos Expansion and Material Point Method
2
作者 Wenpeng Li Zhenghe Liu +4 位作者 Yujing Ma Zhuxuan Meng Ji Ma Weisong Liu Vinh Phu Nguyen 《Computer Modeling in Engineering & Sciences》 2025年第2期1515-1543,共29页
This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-... This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-oped using the material point method.To reduce the computational cost of Monte Carlo simulations,response surface models are created as surrogate models for the material point system to approximate its dynamic behavior.An adaptive randomized greedy algorithm is employed to construct a sparse polynomial chaos expansion model with a fixed order,effectively balancing the accuracy and computational efficiency of the surrogate model.Based on the sparse polynomial chaos expansion,sensitivity analysis is conducted using the global finite difference and Sobol methods.Several examples of structural dynamics are provided to demonstrate the effectiveness of the proposed method in addressing structural dynamics problems. 展开更多
关键词 Structural dynamics DEFORMATION material point method sparse polynomial chaos expansion adaptive randomized greedy algorithm sensitivity analysis
在线阅读 下载PDF
On Convergence of a Least-Squares Kansa’s Method for the Modified Helmholtz Equations
3
作者 Ting-On Kwok Leevan Ling 《Advances in Applied Mathematics and Mechanics》 SCIE 2009年第3期367-382,共16页
We analyze a least-squares asymmetric radial basis function collocation method for solving the modified Helmholtz equations.In the theoretical part,we proved the convergence of the proposed method providing that the c... We analyze a least-squares asymmetric radial basis function collocation method for solving the modified Helmholtz equations.In the theoretical part,we proved the convergence of the proposed method providing that the collocation points are sufficiently dense.For numerical verification,direct solver and a subspace selection process for the trial space(the so-called adaptive greedy algorithm)is employed,respectively,for small and large scale problems. 展开更多
关键词 Radial basis function adaptive greedy algorithm asymmetric collocation Kansa’s method convergence analysis
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部