期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Uniformity pattern and related criteria for two-level factorials 被引量:16
1
作者 FANG Kaitai QIN Hong 《Science China Mathematics》 SCIE 2005年第1期1-11,共11页
In this paper,the study of projection properties of two-level factorials in view of geometry is reported.The concept of uniformity pattern is defined.Based on this new concept,criteria of uniformity resolution and min... In this paper,the study of projection properties of two-level factorials in view of geometry is reported.The concept of uniformity pattern is defined.Based on this new concept,criteria of uniformity resolution and minimum projection uniformity are proposed for comparing two-level factorials.Relationship between minimum projection uniformity and other criteria such as minimum aberration,generalized minimum aberration and orthogonality is made explict.This close relationship raises the hope of improving the connection between uniform design theory and factorial design theory.Our results provide a justification of orthogonality,minimum aberration,and generalized minimum aberration from a natural geometrical interpretation. 展开更多
关键词 discrepancy generalized minimum aberration minimum projection uniformity orthogonality uniformity pattern uniformity resolution.
原文传递
The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials
2
作者 Aitong Huang Renzhong Feng Sanpeng Zheng 《Numerical Mathematics(Theory,Methods and Applications)》 SCIE CSCD 2022年第3期793-818,共26页
Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classi... Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classical research methods using mutual coherence or restricted isometry property of the measurement matrix,the recovery guarantee and the success probability of OMP are obtained directly by the greedy selection ratio and the probability theory.The results show that the failure probability of OMP given in this paper is exponential small with respect to the number of sampling points.In addition,the recovery guarantee of OMP obtained through classical methods is lager than that of ℓ_(1)-minimization whatever the sparsity of sparse polynomials is,while the recovery guarantee given in this paper is roughly the same as that of ℓ_(1)-minimization when the sparsity is less than 93.Finally,the numerical experiments verify the availability of the theoretical results. 展开更多
关键词 Reconstruction of sparse polynomial uniformly bounded orthogonal system orthogonal matching pursuit method probability of successful reconstruction sub-Gaussian random variable
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部