In this paper the density of the matrix variate beta distribution of rank lower than itsdimensionality is obtained with respect to a suitably defined differential form under the condi-tion that the difference between ...In this paper the density of the matrix variate beta distribution of rank lower than itsdimensionality is obtained with respect to a suitably defined differential form under the condi-tion that the difference between the identity and this matrix has full rank. As preliminaries,the Jacobian of a transformation related to decomposing a nonnegative-definite matrix into theproduct of a matrix of full column rank and its transpose and that of the transformation of anonnegative-definite matrix into its congruent matrix are established.展开更多
In this paper, solutions to the generalized Sylvester matrix equations AX -XF = BY and MXN -X = TY with A, M ∈ R^n×n, B, T ∈ Rn×r, F, N ∈ R^p×p and the matrices N, F being in companion form, are est...In this paper, solutions to the generalized Sylvester matrix equations AX -XF = BY and MXN -X = TY with A, M ∈ R^n×n, B, T ∈ Rn×r, F, N ∈ R^p×p and the matrices N, F being in companion form, are established by a singular value decomposition of a matrix with dimensions n × (n + pr). The algorithm proposed in this paper for the euqation AX - XF = BY does not require the controllability of matrix pair (A, B) and the restriction that A, F do not have common eigenvalues. Since singular value decomposition is adopted, the algorithm is numerically stable and may provide great convenience to the computation of the solution to these equations, and can perform important functions in many design problems in control systems theory.展开更多
An accelerated singular value thresholding (SVT) algorithm was introduced for matrix completion in a recent paper [1], which applies an adaptive line search scheme and improves the convergence rate from O(1/N) for SVT...An accelerated singular value thresholding (SVT) algorithm was introduced for matrix completion in a recent paper [1], which applies an adaptive line search scheme and improves the convergence rate from O(1/N) for SVT to O(1/N2), where N is the number of iterations. In this paper, we show that it is the same as the Nemirovski’s approach, and then modify it to obtain an accelerate Nemirovski’s technique and prove the convergence. Our preliminary computational results are very favorable.展开更多
In this paper we use the notion of measure of non-strict-singularity to give some results on Fredholm operators and we establish a fine description of the Schechter essential spectrum of a closed densely defined linea...In this paper we use the notion of measure of non-strict-singularity to give some results on Fredholm operators and we establish a fine description of the Schechter essential spectrum of a closed densely defined linear operator.展开更多
The spectral theory of graph is an important branch of graph theory,and the main part of this theory is the connection between the spectral properties and the structural properties,characterization of the structural p...The spectral theory of graph is an important branch of graph theory,and the main part of this theory is the connection between the spectral properties and the structural properties,characterization of the structural properties of graphs.We discuss the problems about singularity,signature matrix and spectrum of mixed graphs.Without loss of generality,parallel edges and loops are permitted in mixed graphs.Let G1 and G2 be connected mixed graphs which are obtained from an underlying graph G.When G1 and G2 have the same singularity,the number of induced cycles in Gi(i=1,2)is l(l=1,l>1),the length of the smallest induced cycles is 1,2,at least 3.According to conclusions and mathematics induction,we find that the singularity of corresponding induced cycles in G1 and G2 are the same if and only if there exists a signature matrix D such that L(G2)=DTL(G1)D.D may be the product of some signature matrices.If L(G2)=D^TL(G1)D,G1 and G2 have the same spectrum.展开更多
Parallel robot is used in many different fields nowadays, but the singularity of 3-RRUR parallel robot is more complicated, so a method to analyze the singularity of the 3-RRUR parallel robot is very necessary. First,...Parallel robot is used in many different fields nowadays, but the singularity of 3-RRUR parallel robot is more complicated, so a method to analyze the singularity of the 3-RRUR parallel robot is very necessary. First, the Jacobian matrix was built based on the differential transform method through the transfer matrixes between the poles. The connection between the position parameters and singularity condition was built through the analysis of the Jacobian matrix. Second, the effect on the singularity from the position parameters was analyzed, and then the singularity condition was confirmed. The effect on the singularity condition from position parameters was displayed by the curved surface charts to provide a basic method for the designing of the parallel robot. With this method, the singularity condition could be got when the length of each link is firmed, so it can be judged that if a group of parameters are appropriate or not, and the method also provides warrant for workspace and path planning of the parallel robot.展开更多
The perturbational reanalysis technique of matrix singular value decomposition is applicable to many theoretical and practical problems in mathematics, mechanics, control theory, engineering, etc.. An indirect perturb...The perturbational reanalysis technique of matrix singular value decomposition is applicable to many theoretical and practical problems in mathematics, mechanics, control theory, engineering, etc.. An indirect perturbation method has previously been proposed by the author in this journal, and now the direct perturbation method has also been presented in this paper. The second-order perturbation results of non-repeated singular values and the corresponding left and right singular vectors are obtained. The results can meet the general needs of most problems of various practical applications. A numerical example is presented to demonstrate the effectiveness of the direct perturbation method.展开更多
The perturbation method for the reanalysis of the singular value decomposition (SVD) of general real matrices is presented in this paper. This is a simple but efficient reanalysis technique for the SVD, which is of gr...The perturbation method for the reanalysis of the singular value decomposition (SVD) of general real matrices is presented in this paper. This is a simple but efficient reanalysis technique for the SVD, which is of great worth to enhance computational efficiency of the iterative analysis problems that require matrix singular value decomposition repeatedly. The asymptotic estimate formulas for the singular values and the corresponding left and right singular vectors up to second-order perturbation components are derived. At the end of the paper the way to extend the perturbation method to the case of general complex matrices is advanced.展开更多
正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)中至关重要的一项技术是信道估计,本文提出一种基于矩阵恢复的OFDM信道估计方法,将连续多个OFDM信号的频域信道构造成一个信道矩阵,由于这个信道矩阵是低秩的,所以可以...正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)中至关重要的一项技术是信道估计,本文提出一种基于矩阵恢复的OFDM信道估计方法,将连续多个OFDM信号的频域信道构造成一个信道矩阵,由于这个信道矩阵是低秩的,所以可以将信道估计问题转换为信道矩阵的加权截断核范数最小化问题,并使用改进的奇异值阈值(Singular Value Thresholding,SVT)算法对信道矩阵进行恢复。仿真结果表明,本文提出的方法和传统信道估计算法相比,使用相同导频数可以获得更高的估计精度,在获得相同估计精度时,消耗导频数更少。与基于压缩感知的信道估计方法相比,本文方法消耗相同数量的导频,但可直接获得高精度的OFDM信道的频域估计。展开更多
文摘In this paper the density of the matrix variate beta distribution of rank lower than itsdimensionality is obtained with respect to a suitably defined differential form under the condi-tion that the difference between the identity and this matrix has full rank. As preliminaries,the Jacobian of a transformation related to decomposing a nonnegative-definite matrix into theproduct of a matrix of full column rank and its transpose and that of the transformation of anonnegative-definite matrix into its congruent matrix are established.
基金This work was supported by the Chinese Outstanding Youth Foundation(No.69925308)Program for Changjiang Scholars and Innovative ResearchTeam in University.
文摘In this paper, solutions to the generalized Sylvester matrix equations AX -XF = BY and MXN -X = TY with A, M ∈ R^n×n, B, T ∈ Rn×r, F, N ∈ R^p×p and the matrices N, F being in companion form, are established by a singular value decomposition of a matrix with dimensions n × (n + pr). The algorithm proposed in this paper for the euqation AX - XF = BY does not require the controllability of matrix pair (A, B) and the restriction that A, F do not have common eigenvalues. Since singular value decomposition is adopted, the algorithm is numerically stable and may provide great convenience to the computation of the solution to these equations, and can perform important functions in many design problems in control systems theory.
文摘An accelerated singular value thresholding (SVT) algorithm was introduced for matrix completion in a recent paper [1], which applies an adaptive line search scheme and improves the convergence rate from O(1/N) for SVT to O(1/N2), where N is the number of iterations. In this paper, we show that it is the same as the Nemirovski’s approach, and then modify it to obtain an accelerate Nemirovski’s technique and prove the convergence. Our preliminary computational results are very favorable.
文摘In this paper we use the notion of measure of non-strict-singularity to give some results on Fredholm operators and we establish a fine description of the Schechter essential spectrum of a closed densely defined linear operator.
基金Quality Engineering Project of Anhui Province,China(No.2017zhkt036)
文摘The spectral theory of graph is an important branch of graph theory,and the main part of this theory is the connection between the spectral properties and the structural properties,characterization of the structural properties of graphs.We discuss the problems about singularity,signature matrix and spectrum of mixed graphs.Without loss of generality,parallel edges and loops are permitted in mixed graphs.Let G1 and G2 be connected mixed graphs which are obtained from an underlying graph G.When G1 and G2 have the same singularity,the number of induced cycles in Gi(i=1,2)is l(l=1,l>1),the length of the smallest induced cycles is 1,2,at least 3.According to conclusions and mathematics induction,we find that the singularity of corresponding induced cycles in G1 and G2 are the same if and only if there exists a signature matrix D such that L(G2)=DTL(G1)D.D may be the product of some signature matrices.If L(G2)=D^TL(G1)D,G1 and G2 have the same spectrum.
基金Supported by National High Technology Research and Development Program of China(2009AA04Z207)National Defense Basic Scientific Research Program of China(A2220080252)
文摘Parallel robot is used in many different fields nowadays, but the singularity of 3-RRUR parallel robot is more complicated, so a method to analyze the singularity of the 3-RRUR parallel robot is very necessary. First, the Jacobian matrix was built based on the differential transform method through the transfer matrixes between the poles. The connection between the position parameters and singularity condition was built through the analysis of the Jacobian matrix. Second, the effect on the singularity from the position parameters was analyzed, and then the singularity condition was confirmed. The effect on the singularity condition from position parameters was displayed by the curved surface charts to provide a basic method for the designing of the parallel robot. With this method, the singularity condition could be got when the length of each link is firmed, so it can be judged that if a group of parameters are appropriate or not, and the method also provides warrant for workspace and path planning of the parallel robot.
文摘The perturbational reanalysis technique of matrix singular value decomposition is applicable to many theoretical and practical problems in mathematics, mechanics, control theory, engineering, etc.. An indirect perturbation method has previously been proposed by the author in this journal, and now the direct perturbation method has also been presented in this paper. The second-order perturbation results of non-repeated singular values and the corresponding left and right singular vectors are obtained. The results can meet the general needs of most problems of various practical applications. A numerical example is presented to demonstrate the effectiveness of the direct perturbation method.
文摘The perturbation method for the reanalysis of the singular value decomposition (SVD) of general real matrices is presented in this paper. This is a simple but efficient reanalysis technique for the SVD, which is of great worth to enhance computational efficiency of the iterative analysis problems that require matrix singular value decomposition repeatedly. The asymptotic estimate formulas for the singular values and the corresponding left and right singular vectors up to second-order perturbation components are derived. At the end of the paper the way to extend the perturbation method to the case of general complex matrices is advanced.
文摘稀疏阵列布阵灵活,增大阵列孔径的同时还能减少阵元间耦合,但基于稀疏阵列的传统波达方向估计会导致角度模糊混叠,带来估计精度差和稳健性不足的问题。针对以上问题,提出一种适用于稀疏阵列波达方向估计的加权截断奇异值投影(weighted truncated singular value projection,WT-SVP)的鲁棒矩阵填充算法。在填充迭代过程中根据奇异值的大小分配权重,突出大奇异值包含的阵列信息,减少小奇异值中不必要的噪声信息,从而优化传统奇异值投影算法。该算法可以实现稀疏阵列的孔洞信息恢复,对不连续阵元充分利用,同时WT-SVP填充算法实现了稀疏阵列波达方向估计的高精度、高分辨以及在低信噪比、低快拍时的高鲁棒性。
文摘正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)中至关重要的一项技术是信道估计,本文提出一种基于矩阵恢复的OFDM信道估计方法,将连续多个OFDM信号的频域信道构造成一个信道矩阵,由于这个信道矩阵是低秩的,所以可以将信道估计问题转换为信道矩阵的加权截断核范数最小化问题,并使用改进的奇异值阈值(Singular Value Thresholding,SVT)算法对信道矩阵进行恢复。仿真结果表明,本文提出的方法和传统信道估计算法相比,使用相同导频数可以获得更高的估计精度,在获得相同估计精度时,消耗导频数更少。与基于压缩感知的信道估计方法相比,本文方法消耗相同数量的导频,但可直接获得高精度的OFDM信道的频域估计。