In this article, the generalized reflexive solution of matrix equations （AX = B, XC = D） is considered. With special properties of generalized reflexive matrices, the necessary and sufficient conditions for the solv...In this article, the generalized reflexive solution of matrix equations （AX = B, XC = D） is considered. With special properties of generalized reflexive matrices, the necessary and sufficient conditions for the solvability and the general expression of the solution are obtained. Moreover, the related optimal approximation problem to a given matrix over the solution set is solved.展开更多
In the present paper, an attempt is made to obtain the degree of approximation of conjugate of functions (signals) belonging to the generalized weighted W(LP, ξ(t)), (p ≥ 1)-class, by using lower triangular matrix o...In the present paper, an attempt is made to obtain the degree of approximation of conjugate of functions (signals) belonging to the generalized weighted W(LP, ξ(t)), (p ≥ 1)-class, by using lower triangular matrix operator of conjugate series of its Fourier series.展开更多
A real n×n symmetric matrix X=(x_(ij))_(n×n)is called a bisymmetric matrix if x_(ij)=x_(n+1-j,n+1-i).Based on the projection theorem,the canonical correlation de- composition and the generalized singular val...A real n×n symmetric matrix X=(x_(ij))_(n×n)is called a bisymmetric matrix if x_(ij)=x_(n+1-j,n+1-i).Based on the projection theorem,the canonical correlation de- composition and the generalized singular value decomposition,a method useful for finding the least-squares solutions of the matrix equation A^TXA=B over bisymmetric matrices is proposed.The expression of the least-squares solutions is given.Moreover, in the corresponding solution set,the optimal approximate solution to a given matrix is also derived.A numerical algorithm for finding the optimal approximate solution is also described.展开更多
This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation p...This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation property,a more general robust null space property,and establish the stable recovery of signals and matrices under the truncated sparse approximation property.We also explore the relationship between the restricted isometry property and truncated sparse approximation property.And we also prove that if a measurement matrix A or linear map A satisfies truncated sparse approximation property of order k,then the first inequality in restricted isometry property of order k and of order 2k can hold for certain different constantsδk andδ2k,respectively.Last,we show that ifδs(k+|T^c|)<√(s-1)/s for some s≥4/3,then measurement matrix A and linear map A satisfy truncated sparse approximation property of order k.It should be pointed out that when Tc=Ф,our conclusion implies that sparse approximation property of order k is weaker than restricted isometry property of order sk.展开更多
The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memo...The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memory requirement when the scale of the matrices is quite large.In this paper,we use random projections to capture the most of the action of the matrices and propose randomized algorithms for computing a low-rank approximation of the GSVD.Serval error bounds of the approximation are also presented for the proposed randomized algorithms.Finally,some experimental results show that the proposed randomized algorithms can achieve a good accuracy with less computational cost and storage requirement.展开更多
In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of co...In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of complex numbers {λ j}m j=1, find two n×n centrohermitian matrices A,B such that {x j}m j=1 and {λ j}m j=1 are the generalized eigenvectors and generalized eigenvalues of Ax=λBx, respectively. We then discuss the optimal approximation problem for the GIEP. More concretely, given two arbitrary matrices, , ∈C n×n, we find two matrices A and B such that the matrix (A*,B*) is closest to (,) in the Frobenius norm, where the matrix (A*,B*) is the solution to the GIEP. We show that the expression of the solution of the optimal approximation is unique and derive the expression for it.展开更多
By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-H...By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.展开更多
Given a symmetric matrix X, we consider the problem of finding a low-rank positive approximant of X. That is, a symmetric positive semidefinite matrix, S, whose rank is smaller than a given positive integer, , which i...Given a symmetric matrix X, we consider the problem of finding a low-rank positive approximant of X. That is, a symmetric positive semidefinite matrix, S, whose rank is smaller than a given positive integer, , which is nearest to X in a certain matrix norm. The problem is first solved with regard to four common norms: The Frobenius norm, the Schatten p-norm, the trace norm, and the spectral norm. Then the solution is extended to any unitarily invariant matrix norm. The proof is based on a subtle combination of Ky Fan dominance theorem, a modified pinching principle, and Mirsky minimum-norm theorem.展开更多
Low-rank matrix decomposition with first-order total variation(TV)regularization exhibits excellent performance in exploration of image structure.Taking advantage of its excellent performance in image denoising,we app...Low-rank matrix decomposition with first-order total variation(TV)regularization exhibits excellent performance in exploration of image structure.Taking advantage of its excellent performance in image denoising,we apply it to improve the robustness of deep neural networks.However,although TV regularization can improve the robustness of the model,it reduces the accuracy of normal samples due to its over-smoothing.In our work,we develop a new low-rank matrix recovery model,called LRTGV,which incorporates total generalized variation(TGV)regularization into the reweighted low-rank matrix recovery model.In the proposed model,TGV is used to better reconstruct texture information without over-smoothing.The reweighted nuclear norm and Li-norm can enhance the global structure information.Thus,the proposed LRTGV can destroy the structure of adversarial noise while re-enhancing the global structure and local texture of the image.To solve the challenging optimal model issue,we propose an algorithm based on the alternating direction method of multipliers.Experimental results show that the proposed algorithm has a certain defense capability against black-box attacks,and outperforms state-of-the-art low-rank matrix recovery methods in image restoration.展开更多
A recursive rational algorithm for matrix exponentials was obtained by making use of the generalized inverse of a matrix in this paper. On the basis of the n th convergence of Thiele type continued fraction expa...A recursive rational algorithm for matrix exponentials was obtained by making use of the generalized inverse of a matrix in this paper. On the basis of the n th convergence of Thiele type continued fraction expansion, a new type of the generalized inverse matrix valued Padé approximant (GMPA) for matrix exponentials was defined and its remainder formula was proved. The results of this paper were illustrated by some examples.展开更多
We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-rank appr...We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-rank approximation; for the nonlinear case we investigate methods for nonlinear dimensionality reduction and manifold learning. The problems we address have attracted great deal of interest in data mining and machine learning.展开更多
基金supported by National Natural Science Foundation of China (10571047)and by Scientific Research Fund of Hunan Provincial Education Department of China Grant(06C235)+1 种基金by Central South University of Forestry and Technology (06Y017)by Specialized Research Fund for the Doctoral Program of Higher Education (20060532014)
文摘In this article, the generalized reflexive solution of matrix equations （AX = B, XC = D） is considered. With special properties of generalized reflexive matrices, the necessary and sufficient conditions for the solvability and the general expression of the solution are obtained. Moreover, the related optimal approximation problem to a given matrix over the solution set is solved.
文摘In the present paper, an attempt is made to obtain the degree of approximation of conjugate of functions (signals) belonging to the generalized weighted W(LP, ξ(t)), (p ≥ 1)-class, by using lower triangular matrix operator of conjugate series of its Fourier series.
文摘A real n×n symmetric matrix X=(x_(ij))_(n×n)is called a bisymmetric matrix if x_(ij)=x_(n+1-j,n+1-i).Based on the projection theorem,the canonical correlation de- composition and the generalized singular value decomposition,a method useful for finding the least-squares solutions of the matrix equation A^TXA=B over bisymmetric matrices is proposed.The expression of the least-squares solutions is given.Moreover, in the corresponding solution set,the optimal approximate solution to a given matrix is also derived.A numerical algorithm for finding the optimal approximate solution is also described.
基金supported by the National Natural Science Foundation of China(11871109)NSAF(U1830107)the Science Challenge Project(TZ2018001)
文摘This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation property,a more general robust null space property,and establish the stable recovery of signals and matrices under the truncated sparse approximation property.We also explore the relationship between the restricted isometry property and truncated sparse approximation property.And we also prove that if a measurement matrix A or linear map A satisfies truncated sparse approximation property of order k,then the first inequality in restricted isometry property of order k and of order 2k can hold for certain different constantsδk andδ2k,respectively.Last,we show that ifδs(k+|T^c|)<√(s-1)/s for some s≥4/3,then measurement matrix A and linear map A satisfy truncated sparse approximation property of order k.It should be pointed out that when Tc=Ф,our conclusion implies that sparse approximation property of order k is weaker than restricted isometry property of order sk.
基金The research is supported by the National Natural Science Foundation of China under Grant nos.11701409 and 11571171the Natural Science Foundation of Jiangsu Province of China under Grant BK20170591the Natural Science Foundation of Jiangsu Higher Education Institutions of China under Grant 17KJB110018.
文摘The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memory requirement when the scale of the matrices is quite large.In this paper,we use random projections to capture the most of the action of the matrices and propose randomized algorithms for computing a low-rank approximation of the GSVD.Serval error bounds of the approximation are also presented for the proposed randomized algorithms.Finally,some experimental results show that the proposed randomized algorithms can achieve a good accuracy with less computational cost and storage requirement.
文摘In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of complex numbers {λ j}m j=1, find two n×n centrohermitian matrices A,B such that {x j}m j=1 and {λ j}m j=1 are the generalized eigenvectors and generalized eigenvalues of Ax=λBx, respectively. We then discuss the optimal approximation problem for the GIEP. More concretely, given two arbitrary matrices, , ∈C n×n, we find two matrices A and B such that the matrix (A*,B*) is closest to (,) in the Frobenius norm, where the matrix (A*,B*) is the solution to the GIEP. We show that the expression of the solution of the optimal approximation is unique and derive the expression for it.
基金Project(10171031) supported by the National Natural Science Foundation of China
文摘By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.
文摘Given a symmetric matrix X, we consider the problem of finding a low-rank positive approximant of X. That is, a symmetric positive semidefinite matrix, S, whose rank is smaller than a given positive integer, , which is nearest to X in a certain matrix norm. The problem is first solved with regard to four common norms: The Frobenius norm, the Schatten p-norm, the trace norm, and the spectral norm. Then the solution is extended to any unitarily invariant matrix norm. The proof is based on a subtle combination of Ky Fan dominance theorem, a modified pinching principle, and Mirsky minimum-norm theorem.
基金Project supported by the National Natural Science Foundation of China(No.62072024)the Outstanding Youth Program of Beijing University of Civil Engineering and Architecture,China(No.JDJQ20220805)the Shenzhen Stability Support General Project(Type A),China(No.20200826104014001)。
文摘Low-rank matrix decomposition with first-order total variation(TV)regularization exhibits excellent performance in exploration of image structure.Taking advantage of its excellent performance in image denoising,we apply it to improve the robustness of deep neural networks.However,although TV regularization can improve the robustness of the model,it reduces the accuracy of normal samples due to its over-smoothing.In our work,we develop a new low-rank matrix recovery model,called LRTGV,which incorporates total generalized variation(TGV)regularization into the reweighted low-rank matrix recovery model.In the proposed model,TGV is used to better reconstruct texture information without over-smoothing.The reweighted nuclear norm and Li-norm can enhance the global structure information.Thus,the proposed LRTGV can destroy the structure of adversarial noise while re-enhancing the global structure and local texture of the image.To solve the challenging optimal model issue,we propose an algorithm based on the alternating direction method of multipliers.Experimental results show that the proposed algorithm has a certain defense capability against black-box attacks,and outperforms state-of-the-art low-rank matrix recovery methods in image restoration.
文摘A recursive rational algorithm for matrix exponentials was obtained by making use of the generalized inverse of a matrix in this paper. On the basis of the n th convergence of Thiele type continued fraction expansion, a new type of the generalized inverse matrix valued Padé approximant (GMPA) for matrix exponentials was defined and its remainder formula was proved. The results of this paper were illustrated by some examples.
基金This work was supported in part by the Special Funds for Major State Basic Research Projectsthe National Natural Science Foundation of China(Grants No.60372033 and 9901936)NSF CCR9901986,DMS 0311800.
文摘We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-rank approximation; for the nonlinear case we investigate methods for nonlinear dimensionality reduction and manifold learning. The problems we address have attracted great deal of interest in data mining and machine learning.
