In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Erro...In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.展开更多
In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a th...In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.展开更多
Given a positive definite matrix measure Ω supported on the unit circle T, then main purpose of this paper is to study the asymptotic behavior of L n()L n(Ω) -1 and Φ n(z;)Φ n(z;Ω) -1 where(z)=Ω(z)+Mδ(z-w...Given a positive definite matrix measure Ω supported on the unit circle T, then main purpose of this paper is to study the asymptotic behavior of L n()L n(Ω) -1 and Φ n(z;)Φ n(z;Ω) -1 where(z)=Ω(z)+Mδ(z-w); |w|>1,M is a positive definite matrix and δ is the Dirac matrix measure. Here, L n(·) means the leading coefficient of the orthonormal matrix polynomials Φ n(z;·). Finally, we deduce the asymptotic behavior of Φ n(w;)Φ n(w;Ω)* in the case when M=I.展开更多
Orthogonal matrices have become a vital means for coding and signal processing owing to their unique distributional properties.Although orthogonal matrices based on amplitude or phase combinations have been extensivel...Orthogonal matrices have become a vital means for coding and signal processing owing to their unique distributional properties.Although orthogonal matrices based on amplitude or phase combinations have been extensively explored,the orthogonal matrix of polarization combinations(OMPC)is a novel,relatively unexplored concept.Herein,we propose a method for constructing OMPCs of any dimension encompassing 4n(where n is 1,2,4,8,…)mutually orthogonal 2ncomponent polarization combinations.In the field of holography,the integration of polarization multiplexing techniques with polarization-sensitive materials is expected to emerge as a groundbreaking approach for multichannel hologram multiplexing,offering considerable enhancements in data storage capacity and security.A multidimensional OMPC enables the realization of multichannel multiplexing and dynamical modulation of information in polarization holographic recording.Despite consolidating all information into a single position within the material,we effectively avoided extraneous crosstalk during the reconstruction process.Our results show that achieving four distinct holographic images individually and simultaneously depends on the polarization combination represented by the incident wave.This discovery opens up a new avenue for achieving highly holographic information storage and dynamically displayed information,harnessing the potential of OMPC to expand the heretofore limited dimensionality of orthogonal polarization.展开更多
Performance index mance evaluation, and is the is the standard of perfor- foundation of both perfor- mance analysis and optimal design for the parallel manipulator. Seeking the suitable kinematic indices is always an ...Performance index mance evaluation, and is the is the standard of perfor- foundation of both perfor- mance analysis and optimal design for the parallel manipulator. Seeking the suitable kinematic indices is always an important and challenging issue for the parallel manipulator. So far, there are extensive studies in this field, but few existing indices can meet all the requirements, such as simple, intuitive, and universal. To solve this problem, the matrix orthogonal degree is adopted, and generalized transmission indices that can evaluate motion/force trans- missibility of fully parallel manipulators are proposed. Transmission performance analysis of typical branches, end effectors, and parallel manipulators is given to illus- trate proposed indices and analysis methodology. Simula- tion and analysis results reveal that proposed transmission indices possess significant advantages, such as normalized finite （ranging from 0 to l）, dimensionally homogeneous, frame-free, intuitive and easy to calculate. Besides, pro- posed indices well indicate the good transmission region and relativity to the singularity with better resolution than the traditional local conditioning index, and provide a novel tool for kinematic analysis and optimal design of fully parallel manipulators.展开更多
A connection between matrix orthogonal polynomials and non-abelian integrable lattices is investigated in this paper.The normalization factors of matrix orthogonal polynomials expressed using quasideterminants are sho...A connection between matrix orthogonal polynomials and non-abelian integrable lattices is investigated in this paper.The normalization factors of matrix orthogonal polynomials expressed using quasideterminants are shown to be the solutions to the non-abelian Toda lattice in semi-discrete and full-discrete cases.Moreover,with a moment modification method,we demonstrate that the B¨acklund transformation of the non-abelian Toda lattice given by Popowicz(1983)is equivalent to the non-abelian Volterra lattice,whose solutions can be expressed using quasi-determinants as well.展开更多
Compressive sensing（CS） has emerged as a novel sampling framework which enables sparse signal acquisition and reconstruction with fewer measurements below the Nyquist rate.An important issue for CS is the constructi...Compressive sensing（CS） has emerged as a novel sampling framework which enables sparse signal acquisition and reconstruction with fewer measurements below the Nyquist rate.An important issue for CS is the construction of measurement matrix or sensing matrix.A new deterministic sensing matrix,named as OOC-B,is proposed by exploiting optical orthogonal codes（OOCs）,Bernoulli matrix and Singer structure,which has the entries of 0,＋1 and-1 before normalization.We have proven that the designed deterministic matrix is asymptotically optimal.In addition,the proposed deterministic sensing matrix is applied to direction of arrival（DOA） estimation of narrowband signals by CS arrays（CSA）processing and CS recovery.Theoretical analysis and simulation results show that the proposed sensing matrix has good performance for DOA estimation.It is very effective for simplifying hardware structure and decreasing computational complexity in DOA estimation by CSA processing.Besides,lower root mean square error（RMSE） and bias are obtained in DOA estimation by CS recovery.展开更多
Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direc...Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direction method of multipliers and hierarchical alternating least squares method.When the given matrix is huge,the cost of computation and communication is too high.Therefore,ONMF becomes challenging in the large-scale setting.The random projection is an efficient method of dimensionality reduction.In this paper,we apply the random projection to ONMF and propose two randomized algorithms.Numerical experiments show that our proposed algorithms perform well on both simulated and real data.展开更多
The workpiece frames relative to each robot base frame should be known in advance for the proper operation of twin-robot nondestructive testing system. However, when two robots are separated from the workpieces, the t...The workpiece frames relative to each robot base frame should be known in advance for the proper operation of twin-robot nondestructive testing system. However, when two robots are separated from the workpieces, the twin robots cannot reach the same point to complete the process of workpiece frame positioning. Thus, a new method is proposed to solve the problem of coincidence between workpiece frames. Transformation between two robot base frames is initiated by measuring the coordinate values of three non-collinear calibration points. The relationship between the workpiece frame and that of the slave robot base frame is then determined according to the known transformation of two robot base frames, as well as the relationship between the workpiece frame and that of the master robot base frame. Only one robot is required to actually measure the coordinate values of the calibration points on the workpiece. This requirement is beneficial when one of the robots cannot reach and measure the calibration points. The coordinate values of the calibration points are derived by driving the robot hand to the points and recording the values of top center point（TCP） coordinates. The translation and rotation matrices relate either the two robot base frames or the workpiece and master robot. The coordinated are solved using the measured values of the calibration points according to the Cartesian transformation principle. An optimal method is developed based on exponential mapping of Lie algebra to ensure that the rotation matrix is orthogonal. Experimental results show that this method involves fewer steps, offers significant advantages in terms of operation and time-saving. A method used to synchronize workpiece frames in twin-robot system automatically is presented.展开更多
The orthogonal nonnegative matrix factorization （ONMF） has many applications in a variety of areas such as data mining, information processing and pattern recognition. In this paper, we propose a novel initializatio...The orthogonal nonnegative matrix factorization （ONMF） has many applications in a variety of areas such as data mining, information processing and pattern recognition. In this paper, we propose a novel initialization method for the ONMF based on the Lanczos bidiagonalization and the nonnegative approximation of rank one matrix. Numerical experiments are given to show that our initialization strategy is effective and efficient.展开更多
In this paper, the maximal length of maximal distance separable (MDS) codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length ...In this paper, the maximal length of maximal distance separable (MDS) codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length of MDS codes in some parameters are given.展开更多
Orthogonal matching pursuit(OMP)algorithm is a classical greedy algorithm widely used in compressed sensing.In this paper,by exploiting the Wielandt inequality and some properties of orthogonal projection matrix,we ob...Orthogonal matching pursuit(OMP)algorithm is a classical greedy algorithm widely used in compressed sensing.In this paper,by exploiting the Wielandt inequality and some properties of orthogonal projection matrix,we obtained a new number of iterations required for the OMP algorithm to perform exact recovery of sparse signals,which improves significantly upon the latest results as we know.展开更多
By applying the generalized singular value decomposition and the canonical correlation decomposition simultaneously, we derive an analytical expression of the optimal approximate solution ^-X, which is both a least-sq...By applying the generalized singular value decomposition and the canonical correlation decomposition simultaneously, we derive an analytical expression of the optimal approximate solution ^-X, which is both a least-squares symmetric orthogonal anti-symmetric solu- tion of the matrix equation A^TXA = B and a best approximation to a given matrix X^＊. Moreover, a numerical algorithm for finding this optimal approximate solution is described in detail, and a numerical example is presented to show the validity of our algorithm.展开更多
文摘In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.
文摘In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.
文摘Given a positive definite matrix measure Ω supported on the unit circle T, then main purpose of this paper is to study the asymptotic behavior of L n()L n(Ω) -1 and Φ n(z;)Φ n(z;Ω) -1 where(z)=Ω(z)+Mδ(z-w); |w|>1,M is a positive definite matrix and δ is the Dirac matrix measure. Here, L n(·) means the leading coefficient of the orthonormal matrix polynomials Φ n(z;·). Finally, we deduce the asymptotic behavior of Φ n(w;)Φ n(w;Ω)* in the case when M=I.
基金financial supports from National Key Research and Development Program of China(2018YFA0701800)Fujian Province Major Science and Technology Program(2020HZ01012)+1 种基金National Natural Science Foundation of China(NSFC)(U22A2080)China Scholarship Council(202109107007).
文摘Orthogonal matrices have become a vital means for coding and signal processing owing to their unique distributional properties.Although orthogonal matrices based on amplitude or phase combinations have been extensively explored,the orthogonal matrix of polarization combinations(OMPC)is a novel,relatively unexplored concept.Herein,we propose a method for constructing OMPCs of any dimension encompassing 4n(where n is 1,2,4,8,…)mutually orthogonal 2ncomponent polarization combinations.In the field of holography,the integration of polarization multiplexing techniques with polarization-sensitive materials is expected to emerge as a groundbreaking approach for multichannel hologram multiplexing,offering considerable enhancements in data storage capacity and security.A multidimensional OMPC enables the realization of multichannel multiplexing and dynamical modulation of information in polarization holographic recording.Despite consolidating all information into a single position within the material,we effectively avoided extraneous crosstalk during the reconstruction process.Our results show that achieving four distinct holographic images individually and simultaneously depends on the polarization combination represented by the incident wave.This discovery opens up a new avenue for achieving highly holographic information storage and dynamically displayed information,harnessing the potential of OMPC to expand the heretofore limited dimensionality of orthogonal polarization.
基金Supported by National Natural Science Foundation of China(Grant Nos.51575292,51475252,91648107)National Key Technology Research and Development Program of China(Grant No.2105BAF19B00)National Science and Technology Major Project of China(Grant No.2016ZX04004004)
文摘Performance index mance evaluation, and is the is the standard of perfor- foundation of both perfor- mance analysis and optimal design for the parallel manipulator. Seeking the suitable kinematic indices is always an important and challenging issue for the parallel manipulator. So far, there are extensive studies in this field, but few existing indices can meet all the requirements, such as simple, intuitive, and universal. To solve this problem, the matrix orthogonal degree is adopted, and generalized transmission indices that can evaluate motion/force trans- missibility of fully parallel manipulators are proposed. Transmission performance analysis of typical branches, end effectors, and parallel manipulators is given to illus- trate proposed indices and analysis methodology. Simula- tion and analysis results reveal that proposed transmission indices possess significant advantages, such as normalized finite （ranging from 0 to l）, dimensionally homogeneous, frame-free, intuitive and easy to calculate. Besides, pro- posed indices well indicate the good transmission region and relativity to the singularity with better resolution than the traditional local conditioning index, and provide a novel tool for kinematic analysis and optimal design of fully parallel manipulators.
基金supported by National Natural Science Foundation of China(Grant Nos.12101432,12175155,and 11971322)。
文摘A connection between matrix orthogonal polynomials and non-abelian integrable lattices is investigated in this paper.The normalization factors of matrix orthogonal polynomials expressed using quasideterminants are shown to be the solutions to the non-abelian Toda lattice in semi-discrete and full-discrete cases.Moreover,with a moment modification method,we demonstrate that the B¨acklund transformation of the non-abelian Toda lattice given by Popowicz(1983)is equivalent to the non-abelian Volterra lattice,whose solutions can be expressed using quasi-determinants as well.
基金supported by the National Natural Science Foundation of China(6117119761371045+2 种基金61201307)the Shandong Provincial Promotive Research Fund for Excellent Young and Middle-aged Scientists(BS2010DX001)the Shandong Provincial Natural Science Foundation (ZR2011FM005)
文摘Compressive sensing（CS） has emerged as a novel sampling framework which enables sparse signal acquisition and reconstruction with fewer measurements below the Nyquist rate.An important issue for CS is the construction of measurement matrix or sensing matrix.A new deterministic sensing matrix,named as OOC-B,is proposed by exploiting optical orthogonal codes（OOCs）,Bernoulli matrix and Singer structure,which has the entries of 0,＋1 and-1 before normalization.We have proven that the designed deterministic matrix is asymptotically optimal.In addition,the proposed deterministic sensing matrix is applied to direction of arrival（DOA） estimation of narrowband signals by CS arrays（CSA）processing and CS recovery.Theoretical analysis and simulation results show that the proposed sensing matrix has good performance for DOA estimation.It is very effective for simplifying hardware structure and decreasing computational complexity in DOA estimation by CSA processing.Besides,lower root mean square error（RMSE） and bias are obtained in DOA estimation by CS recovery.
基金the National Natural Science Foundation of China(No.11901359)Shandong Provincial Natural Science Foundation(No.ZR2019QA017)。
文摘Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direction method of multipliers and hierarchical alternating least squares method.When the given matrix is huge,the cost of computation and communication is too high.Therefore,ONMF becomes challenging in the large-scale setting.The random projection is an efficient method of dimensionality reduction.In this paper,we apply the random projection to ONMF and propose two randomized algorithms.Numerical experiments show that our proposed algorithms perform well on both simulated and real data.
基金Supported by International S&T Cooperation Program of China(Grant No.2012DFA70260)High-end CNC Machine and Basic Manufacturing Equipment of Chinese Key National Science and Technology(Grant No.2011ZX04014-081)
文摘The workpiece frames relative to each robot base frame should be known in advance for the proper operation of twin-robot nondestructive testing system. However, when two robots are separated from the workpieces, the twin robots cannot reach the same point to complete the process of workpiece frame positioning. Thus, a new method is proposed to solve the problem of coincidence between workpiece frames. Transformation between two robot base frames is initiated by measuring the coordinate values of three non-collinear calibration points. The relationship between the workpiece frame and that of the slave robot base frame is then determined according to the known transformation of two robot base frames, as well as the relationship between the workpiece frame and that of the master robot base frame. Only one robot is required to actually measure the coordinate values of the calibration points on the workpiece. This requirement is beneficial when one of the robots cannot reach and measure the calibration points. The coordinate values of the calibration points are derived by driving the robot hand to the points and recording the values of top center point（TCP） coordinates. The translation and rotation matrices relate either the two robot base frames or the workpiece and master robot. The coordinated are solved using the measured values of the calibration points according to the Cartesian transformation principle. An optimal method is developed based on exponential mapping of Lie algebra to ensure that the rotation matrix is orthogonal. Experimental results show that this method involves fewer steps, offers significant advantages in terms of operation and time-saving. A method used to synchronize workpiece frames in twin-robot system automatically is presented.
基金Acknowledgments. The work is supported by National Natural Science Foundation of China No. 10961010.
文摘The orthogonal nonnegative matrix factorization （ONMF） has many applications in a variety of areas such as data mining, information processing and pattern recognition. In this paper, we propose a novel initialization method for the ONMF based on the Lanczos bidiagonalization and the nonnegative approximation of rank one matrix. Numerical experiments are given to show that our initialization strategy is effective and efficient.
文摘In this paper, the maximal length of maximal distance separable (MDS) codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length of MDS codes in some parameters are given.
基金support from the National Natural Science Foundation of China No.11971204Natural Science Foundation of Jiangsu Province of China No.BK20200108the Zhongwu Youth Innovative Talent Program of Jiangsu University of Technology.
文摘Orthogonal matching pursuit(OMP)algorithm is a classical greedy algorithm widely used in compressed sensing.In this paper,by exploiting the Wielandt inequality and some properties of orthogonal projection matrix,we obtained a new number of iterations required for the OMP algorithm to perform exact recovery of sparse signals,which improves significantly upon the latest results as we know.
基金The Project supported by Scientific Research Fund of Hunan Provincial Education Department,by National Natural Science Foundation of China (10171031)by Natural Science Fundation of Hunan Province (03JJY6028).
文摘By applying the generalized singular value decomposition and the canonical correlation decomposition simultaneously, we derive an analytical expression of the optimal approximate solution ^-X, which is both a least-squares symmetric orthogonal anti-symmetric solu- tion of the matrix equation A^TXA = B and a best approximation to a given matrix X^＊. Moreover, a numerical algorithm for finding this optimal approximate solution is described in detail, and a numerical example is presented to show the validity of our algorithm.
