The truncated singular value decomposition has been widely used in many areas of science including engineering,and statistics,etc.In this paper,the original truncated complex singular value decomposition problem is fo...The truncated singular value decomposition has been widely used in many areas of science including engineering,and statistics,etc.In this paper,the original truncated complex singular value decomposition problem is formulated as a Riemannian optimiza-tion problem on a product of two complex Stiefel manifolds,a practical algorithm based on the generic Riemannian trust-region method of Absil et al.is presented to solve the underlying problem,which enjoys the global convergence and local superlinear conver-gence rate.Numerical experiments are provided to illustrate the efficiency of the proposed method.Comparisons with some classical Riemannian gradient-type methods,the existing Riemannian version of limited-memory BFGS algorithms in the MATLAB toolbox Manopt and the Riemannian manifold optimization library ROPTLIB,and some latest infeasible methods for solving manifold optimization problems,are also provided to show the merits of the proposed approach.展开更多
目前,传统雷达成像方法的发展日渐完善,但在前视成像场景下,雷达难以获取方位向上的多普勒信息,从而限制了其方位向分辨率。为了解决这一问题,国内提出了微波关联成像方法。微波关联成像方法利用关联成像原理进行雷达成像,无需利用目标...目前,传统雷达成像方法的发展日渐完善,但在前视成像场景下,雷达难以获取方位向上的多普勒信息,从而限制了其方位向分辨率。为了解决这一问题,国内提出了微波关联成像方法。微波关联成像方法利用关联成像原理进行雷达成像,无需利用目标的多普勒信息即可实现高分辨率成像。这一新型雷达成像方法突破了传统雷达成像方法中受限于雷达孔径的分辨率,具有极高的前视成像发展潜力。目前,国内外对微波关联成像的研究主要集中在产生随机波前、解决模型失配问题和研制超材料孔径等方面,但对关键的关联过程的优化主要集中在压缩感知和深度学习方面,而在伪逆算法方面的研究相对较少。因此,为了进一步完善微波关联成像体系,本文提出了一种新的针对伪逆算法优化的微波关联前视成像方法。本文结合截断奇异值分解(Truncated Singular Value Decomposition,TSVD)处理和吉洪诺夫正则化(Tikhonov)提出了奇异值分解和吉洪诺夫正则化的联合处理方法(TSVD-Tikhonov,TSVDT),通过TSVDT方法对时空随机辐射阵进行处理,然后进行压缩关联成像。同时,本文比较了广义交叉验证(Generalized Cross-Validation,GCV)和L曲线法,并证明了在微波关联成像方法中,利用GCV法选择截断参数的运算耗时更短且更稳定。最后,利用微波暗室实验验证了该方法在低信噪比条件下提高了成像的抗干扰能力,并且仍能保持较快的运算速度。展开更多
为识别城市轨道交通网络关键站点并研究其多年演化,构建基于截断奇异值分解(truncated singular value decomposition,TSVD)的关键站点识别方法,选取北京市2011—2019年早高峰时段的OD数据,通过关键特征向量分析网络客流演变并对城轨网...为识别城市轨道交通网络关键站点并研究其多年演化,构建基于截断奇异值分解(truncated singular value decomposition,TSVD)的关键站点识别方法,选取北京市2011—2019年早高峰时段的OD数据,通过关键特征向量分析网络客流演变并对城轨网络中关键站点进行识别,将其与复杂网络方法的识别结果进行对比。分析表明:TSVD法能很好地应用于考虑OD分布的网络关键站点识别,识别结果能更好代表网络客流的空间分布。从识别结果看,北京轨道交通关键站点空间布局呈现多中心发展趋势,如西北西二旗,西南丰台科技园等站点逐步形成网络客流中心并相互联系;东南土桥、东北俸伯等站点也初步呈现网络客流中心的特征。展开更多
An important problem that arises in different areas of science and engineering is that of computing the limits of sequences of vectors , where , N being very large. Such sequences arise, for example, in the solution o...An important problem that arises in different areas of science and engineering is that of computing the limits of sequences of vectors , where , N being very large. Such sequences arise, for example, in the solution of systems of linear or nonlinear equations by fixed-point iterative methods, and are simply the required solutions. In most cases of interest, however, these sequences converge to their limits extremely slowly. One practical way to make the sequences converge more quickly is to apply to them vector extrapolation methods. Two types of methods exist in the literature: polynomial type methods and epsilon algorithms. In most applications, the polynomial type methods have proved to be superior convergence accelerators. Three polynomial type methods are known, and these are the minimal polynomial extrapolation (MPE), the reduced rank extrapolation (RRE), and the modified minimal polynomial extrapolation (MMPE). In this work, we develop yet another polynomial type method, which is based on the singular value decomposition, as well as the ideas that lead to MPE. We denote this new method by SVD-MPE. We also design a numerically stable algorithm for its implementation, whose computational cost and storage requirements are minimal. Finally, we illustrate the use of SVD-MPE with numerical examples.展开更多
The low-field nuclear magnetic resonance(NMR)technique has been used to probe the pore size distribution and the fluid composition in geophysical prospecting and related fields.However,the speed and accuracy of the ex...The low-field nuclear magnetic resonance(NMR)technique has been used to probe the pore size distribution and the fluid composition in geophysical prospecting and related fields.However,the speed and accuracy of the existing numerical inversion methods are still challenging due to the ill-posed nature of the first kind Fredholm integral equation and the contamination of the noises.This paper proposes a novel inversion algorithmto accelerate the convergence and enhance the precision using empirical truncated singular value decompositions(TSVD)and the linearized Bregman iteration.The L1 penalty term is applied to construct the objective function,and then the linearized Bregman iteration is utilized to obtain fast convergence.To reduce the complexity of the computation,empirical TSVD is proposed to compress the kernel matrix and determine the appropriate truncated position.This novel inversion method is validated using numerical simulations.The results indicate that the proposed novel method is significantly efficient and can achieve quick and effective data solutions with low signal-to-noise ratios.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.12261026,11961012,12201149)by the Natural Science Foundation of Guangxi Province(Grant Nos.2016GXNSFAA380074,2023GXNSFAA026067)+4 种基金by the Innovation Project of GUET Graduate Education(Grant No.2022YXW01)by the GUET Graduate Innovation Project(Grant No.2022YCXS142)by the Guangxi Key Laboratory of Automatic Detecting Technology and Instruments(Grant Nos.YQ23103,YQ21103,YQ22106)by the Special Fund for Science and Technological Bases and Talents of Guangxi(Grant No.2021AC06001)by the Guizhou Science and Technology Program of Projects(Grant No.ZK2021G339)。
文摘The truncated singular value decomposition has been widely used in many areas of science including engineering,and statistics,etc.In this paper,the original truncated complex singular value decomposition problem is formulated as a Riemannian optimiza-tion problem on a product of two complex Stiefel manifolds,a practical algorithm based on the generic Riemannian trust-region method of Absil et al.is presented to solve the underlying problem,which enjoys the global convergence and local superlinear conver-gence rate.Numerical experiments are provided to illustrate the efficiency of the proposed method.Comparisons with some classical Riemannian gradient-type methods,the existing Riemannian version of limited-memory BFGS algorithms in the MATLAB toolbox Manopt and the Riemannian manifold optimization library ROPTLIB,and some latest infeasible methods for solving manifold optimization problems,are also provided to show the merits of the proposed approach.
文摘目前,传统雷达成像方法的发展日渐完善,但在前视成像场景下,雷达难以获取方位向上的多普勒信息,从而限制了其方位向分辨率。为了解决这一问题,国内提出了微波关联成像方法。微波关联成像方法利用关联成像原理进行雷达成像,无需利用目标的多普勒信息即可实现高分辨率成像。这一新型雷达成像方法突破了传统雷达成像方法中受限于雷达孔径的分辨率,具有极高的前视成像发展潜力。目前,国内外对微波关联成像的研究主要集中在产生随机波前、解决模型失配问题和研制超材料孔径等方面,但对关键的关联过程的优化主要集中在压缩感知和深度学习方面,而在伪逆算法方面的研究相对较少。因此,为了进一步完善微波关联成像体系,本文提出了一种新的针对伪逆算法优化的微波关联前视成像方法。本文结合截断奇异值分解(Truncated Singular Value Decomposition,TSVD)处理和吉洪诺夫正则化(Tikhonov)提出了奇异值分解和吉洪诺夫正则化的联合处理方法(TSVD-Tikhonov,TSVDT),通过TSVDT方法对时空随机辐射阵进行处理,然后进行压缩关联成像。同时,本文比较了广义交叉验证(Generalized Cross-Validation,GCV)和L曲线法,并证明了在微波关联成像方法中,利用GCV法选择截断参数的运算耗时更短且更稳定。最后,利用微波暗室实验验证了该方法在低信噪比条件下提高了成像的抗干扰能力,并且仍能保持较快的运算速度。
文摘为识别城市轨道交通网络关键站点并研究其多年演化,构建基于截断奇异值分解(truncated singular value decomposition,TSVD)的关键站点识别方法,选取北京市2011—2019年早高峰时段的OD数据,通过关键特征向量分析网络客流演变并对城轨网络中关键站点进行识别,将其与复杂网络方法的识别结果进行对比。分析表明:TSVD法能很好地应用于考虑OD分布的网络关键站点识别,识别结果能更好代表网络客流的空间分布。从识别结果看,北京轨道交通关键站点空间布局呈现多中心发展趋势,如西北西二旗,西南丰台科技园等站点逐步形成网络客流中心并相互联系;东南土桥、东北俸伯等站点也初步呈现网络客流中心的特征。
文摘An important problem that arises in different areas of science and engineering is that of computing the limits of sequences of vectors , where , N being very large. Such sequences arise, for example, in the solution of systems of linear or nonlinear equations by fixed-point iterative methods, and are simply the required solutions. In most cases of interest, however, these sequences converge to their limits extremely slowly. One practical way to make the sequences converge more quickly is to apply to them vector extrapolation methods. Two types of methods exist in the literature: polynomial type methods and epsilon algorithms. In most applications, the polynomial type methods have proved to be superior convergence accelerators. Three polynomial type methods are known, and these are the minimal polynomial extrapolation (MPE), the reduced rank extrapolation (RRE), and the modified minimal polynomial extrapolation (MMPE). In this work, we develop yet another polynomial type method, which is based on the singular value decomposition, as well as the ideas that lead to MPE. We denote this new method by SVD-MPE. We also design a numerically stable algorithm for its implementation, whose computational cost and storage requirements are minimal. Finally, we illustrate the use of SVD-MPE with numerical examples.
基金support by the National Nature Science Foundation of China(42174142)CNPC Innovation Found(2021DQ02-0402)National Key Foundation for Exploring Scientific Instrument of China(2013YQ170463).
文摘The low-field nuclear magnetic resonance(NMR)technique has been used to probe the pore size distribution and the fluid composition in geophysical prospecting and related fields.However,the speed and accuracy of the existing numerical inversion methods are still challenging due to the ill-posed nature of the first kind Fredholm integral equation and the contamination of the noises.This paper proposes a novel inversion algorithmto accelerate the convergence and enhance the precision using empirical truncated singular value decompositions(TSVD)and the linearized Bregman iteration.The L1 penalty term is applied to construct the objective function,and then the linearized Bregman iteration is utilized to obtain fast convergence.To reduce the complexity of the computation,empirical TSVD is proposed to compress the kernel matrix and determine the appropriate truncated position.This novel inversion method is validated using numerical simulations.The results indicate that the proposed novel method is significantly efficient and can achieve quick and effective data solutions with low signal-to-noise ratios.
