A new method for the construction of the high performance systematic irregular low-density paritycheck （LDPC） codes based on the sparse generator matrix （G-LDPC） is introduced. The code can greatly reduce the enco...A new method for the construction of the high performance systematic irregular low-density paritycheck （LDPC） codes based on the sparse generator matrix （G-LDPC） is introduced. The code can greatly reduce the encoding complexity while maintaining the same decoding complexity as traditional regular LDPC （H-LDPC） codes defined by the sparse parity check matrix. Simulation results show that the performance of the proposed irregular LDPC codes can offer significant gains over traditional LDPC codes in low SNRs with a few decoding iterations over an additive white Gaussian noise （AWGN） channel.展开更多
A computer program called Matrix Generator (MG) was developed for transforming sized DNA fragments into a presence/absence data matrix. Dynamic computation was run to avoid errors introduced using fixed-bin-width arit...A computer program called Matrix Generator (MG) was developed for transforming sized DNA fragments into a presence/absence data matrix. Dynamic computation was run to avoid errors introduced using fixed-bin-width arithmetic. MG can be used with bin sized fragments from AFLP, ISSR, RAPD, RFLP, and other molecular markers. The accuracy of MG was tested using fAFLP data of Abelia and the results show that MG results in higher resolution of taxa and is more reliable than programs of the similar usage.展开更多
A generalized flexibility–based objective function utilized for structure damage identification is constructed for solving the constrained nonlinear least squares optimized problem. To begin with, the generalized fle...A generalized flexibility–based objective function utilized for structure damage identification is constructed for solving the constrained nonlinear least squares optimized problem. To begin with, the generalized flexibility matrix (GFM) proposed to solve the damage identification problem is recalled and a modal expansion method is introduced. Next, the objective function for iterative optimization process based on the GFM is formulated, and the Trust-Region algorithm is utilized to obtain the solution of the optimization problem for multiple damage cases. And then for computing the objective function gradient, the sensitivity analysis regarding design variables is derived. In addition, due to the spatial incompleteness, the influence of stiffness reduction and incomplete modal measurement data is discussed by means of two numerical examples with several damage cases. Finally, based on the computational results, it is evident that the presented approach provides good validity and reliability for the large and complicated engineering structures.展开更多
Low-Density Parity-Check (LDPC) code is one of the most exciting topics among the coding theory community.It is of great importance in both theory and practical communications over noisy channels.The most advantage of...Low-Density Parity-Check (LDPC) code is one of the most exciting topics among the coding theory community.It is of great importance in both theory and practical communications over noisy channels.The most advantage of LDPC codes is their relatively lower decoding complexity compared with turbo codes,while the disadvantage is its higher encoding complexity.In this paper,a new ap- proach is first proposed to construct high performance irregular systematic LDPC codes based on sparse generator matrix,which can significantly reduce the encoding complexity under the same de- coding complexity as that of regular or irregular LDPC codes defined by traditional sparse parity-check matrix.Then,the proposed generator-based systematic irregular LDPC codes are adopted as con- stituent block codes in rows and columns to design a new kind of product codes family,which also can be interpreted as irregular LDPC codes characterized by graph and thus decoded iteratively.Finally, the performance of the generator-based LDPC codes and the resultant product codes is investigated over an Additive White Gaussian Noise (AWGN) and also compared with the conventional LDPC codes under the same conditions of decoding complexity and channel noise.展开更多
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.展开更多
The adaptive generalized matrix projective lag synchronization between two different complex networks with non-identical nodes and different dimensions is investigated in this paper. Based on Lyapunov stability theory...The adaptive generalized matrix projective lag synchronization between two different complex networks with non-identical nodes and different dimensions is investigated in this paper. Based on Lyapunov stability theory and Barbalat＇s lemma, generalized matrix projective lag synchronization criteria are derived by using the adaptive control method. Furthermore, each network can be undirected or directed, connected or disconnected, and nodes in either network may have identical or different dynamics. The proposed strategy is applicable to almost all kinds of complex networks. In addition, numerical simulation results are presented to illustrate the effectiveness of this method, showing that the synchronization speed is sensitively influenced by the adaptive law strength, the network size, and the network topological structure.展开更多
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.展开更多
Pseudopolar rings are closely related to strongly -regular rings, uniquelystrongly clean rings and semiregular rings. In this paper, we investigate pseudopolar-ity of generalized matrix rings Ks（R） over a local ring...Pseudopolar rings are closely related to strongly -regular rings, uniquelystrongly clean rings and semiregular rings. In this paper, we investigate pseudopolar-ity of generalized matrix rings Ks（R） over a local ring R. We determine the conditionsunder which elements of Ks（R） are pseudopolar. Assume that R is a local ring. It isshown that A ∈ Ks（R） is pseudopolar if and only if A is invertible or A^2 ∈ J（Ks（R））or A is similar to a diagonal matrix [ u 0 0 j ]; where lu -rj and lj-ru are injectiveand u 2 U（R） and j ∈ J（R）. Furthermore, several equivalent conditions for Ks（R）over a local ring R to be pseudopolar are obtained.展开更多
A norm of a quaternion matrix is defined. The expressions of the least square solutions of the quaternion matrix equation AX = B and the equation with the constraint condition DX = E are given.
In this paper we derive a practical method of solving simultaneously the problem of Schmidt decomposition of quaternion matrix and the orthonormalization of vectors in a generalized unitary space by using elementary c...In this paper we derive a practical method of solving simultaneously the problem of Schmidt decomposition of quaternion matrix and the orthonormalization of vectors in a generalized unitary space by using elementary column operations on matrices over the quaternion field.展开更多
Generalized strictly diagonally dominant matrices play a wide and important role in computational mathematics, mathematical physics, theory of dynamical systems, etc.But it is difficult to judge a matrix is or not gen...Generalized strictly diagonally dominant matrices play a wide and important role in computational mathematics, mathematical physics, theory of dynamical systems, etc.But it is difficult to judge a matrix is or not generalized strictly diagonally dominant matrix.In this paper, by using the properties of α-chain diagonally dominant matrix, we obtain new criteria for judging generalized strictly diagonally dominant matrix, which enlarge the identification range.展开更多
The symmetric,positive semidefinite,and positive definite real solutions of the matrix equation XA=YAD from an inverse problem of vibration theory are considered.When D=T the necessary and sufficient conditions fo...The symmetric,positive semidefinite,and positive definite real solutions of the matrix equation XA=YAD from an inverse problem of vibration theory are considered.When D=T the necessary and sufficient conditions for the existence of such solutions and their general forms are derived.展开更多
In this paper,the quaternion matrix equations XF-AX=BY and XF-A=BY are investigated.For convenience,they were called generalized Sylvesterquaternion matrix equation and generalized Sylvester-j-conjugate quaternion mat...In this paper,the quaternion matrix equations XF-AX=BY and XF-A=BY are investigated.For convenience,they were called generalized Sylvesterquaternion matrix equation and generalized Sylvester-j-conjugate quaternion matrix equation,which include the Sylvester matrix equation and Lyapunov matrix equation as special cases.By applying of Kronecker map and complex representation of a quaternion matrix,the sufficient conditions to compute the solution can be given and the expressions of the explicit solutions to the above two quaternion matrix equations XF-AX=BY and XF-A=BY are also obtained.By the established expressions,it is easy to compute the solution of the quaternion matrix equation in the above two forms.In addition,two practical algorithms for these two quaternion matrix equations are give.One is complex representation matrix method and the other is a direct algorithm by the given expression.Furthermore,two illustrative examples are proposed to show the efficiency of the given method.展开更多
In this paper, it is proved that under certain conditions, each Jordan left derivation on a generalized matrix algebra is zero and each generalized Jordan left derivation is a generalized left derivation.
In this note, the matrix equation AV ＋ BW = EVJ is considered, where E, A and B are given matrices of appropriate dimensions, J is an arbitrarily given Jordan matrix, V and W are the matrices to be determined. Firstl...In this note, the matrix equation AV ＋ BW = EVJ is considered, where E, A and B are given matrices of appropriate dimensions, J is an arbitrarily given Jordan matrix, V and W are the matrices to be determined. Firstly, a right factorization of （sE - A）^-1 B is given based on the Leverriver algorithm for descriptor systems. Then based on this factorization and a proposed parametric solution, an alternative parametric solution to this matrix equation is established in terms of the R-controllability matrix of （E, A, B）, the generalized symmetric operator and the observability matrix associated with the Jordan matrix d and a free parameter matrix. The proposed results provide great convenience for many analysis and design problems. Moreover, some equivalent forms are proposed. A numerical example is employed to illustrate the effect of the proposed approach.展开更多
Let G be a generalized matrix algebra over a commutative ring R and Z（G） be the center of G. Suppose that F, T ：G→G are two co-commuting R-linear mappings, i.e., F（x）x = xT（x） for all x ∈ G. In this note, we ...Let G be a generalized matrix algebra over a commutative ring R and Z（G） be the center of G. Suppose that F, T ：G→G are two co-commuting R-linear mappings, i.e., F（x）x = xT（x） for all x ∈ G. In this note, we study the question of when co-commuting mappings on G are proper.展开更多
In this paper, a system of complex matrix equations was studied. Necessary and sufficient conditions for the existence and the expression of generalized bipositive semidefinite solution to the system were given. In ad...In this paper, a system of complex matrix equations was studied. Necessary and sufficient conditions for the existence and the expression of generalized bipositive semidefinite solution to the system were given. In addition, a criterion for a matrix to be generalized bipositive semidefinite was determined.展开更多
According to the definition of the new hypothetical states which have obvious physical significance and are termed as no-gravity static and accelerated states, a method for exact computation of the parallel robot＇s g...According to the definition of the new hypothetical states which have obvious physical significance and are termed as no-gravity static and accelerated states, a method for exact computation of the parallel robot＇s generalized inertia matrix is presented. Based on the matrix theory, the generalized inertia matrix of the parallel robot can be computed on the assumption that the robot is in these new hypothetical states respectively. The approach is demonstrated by the Delta robot as an example. Based on the principle of the virtual work, the inverse dynamics model of the robot is formulized after the kinematics analysis. Finally, a numerical example is given and the element distribution of the Delta robot＇s inertia matrix in the workspace is studied. The method has computationa＇, advantage of numerical accuracy for the Delta robot and can be parallelized easily.展开更多
In this paper,we intreduce the concept and discuss the properties of minimum cycle of row vector in a generalized circulant Fuzzy matrix. We present a new expression for circulant Fuzzy matrix,and discuss some propert...In this paper,we intreduce the concept and discuss the properties of minimum cycle of row vector in a generalized circulant Fuzzy matrix. We present a new expression for circulant Fuzzy matrix,and discuss some properties of the idempotent elements of the semigroup of generalized circulant Fuzzy matrixes in connection with minimum cycle of row vector.展开更多
Assume that a convergent matrix sequence{A<sub>n</sub>}:A<sub>n</sub>→A（n→∞）, A<sub>n</sub>,A∈C<sup>3×3</sup>.We want to form a new matrix sequence {H<sub&...Assume that a convergent matrix sequence{A<sub>n</sub>}:A<sub>n</sub>→A（n→∞）, A<sub>n</sub>,A∈C<sup>3×3</sup>.We want to form a new matrix sequence {H<sub>n</sub>}, derived from {A<sub>n</sub>}, which has also A aslimit and whose convergence is faster than the of {A<sub>n</sub>}. Three rational extrapolation meth-ods for accelerating the convergence of matrix sequences {A<sub>n</sub>} are presented in this paper.The underlying methods are based on the generalized inverse for matrices which is展开更多
文摘A new method for the construction of the high performance systematic irregular low-density paritycheck （LDPC） codes based on the sparse generator matrix （G-LDPC） is introduced. The code can greatly reduce the encoding complexity while maintaining the same decoding complexity as traditional regular LDPC （H-LDPC） codes defined by the sparse parity check matrix. Simulation results show that the performance of the proposed irregular LDPC codes can offer significant gains over traditional LDPC codes in low SNRs with a few decoding iterations over an additive white Gaussian noise （AWGN） channel.
文摘A computer program called Matrix Generator (MG) was developed for transforming sized DNA fragments into a presence/absence data matrix. Dynamic computation was run to avoid errors introduced using fixed-bin-width arithmetic. MG can be used with bin sized fragments from AFLP, ISSR, RAPD, RFLP, and other molecular markers. The accuracy of MG was tested using fAFLP data of Abelia and the results show that MG results in higher resolution of taxa and is more reliable than programs of the similar usage.
文摘A generalized flexibility–based objective function utilized for structure damage identification is constructed for solving the constrained nonlinear least squares optimized problem. To begin with, the generalized flexibility matrix (GFM) proposed to solve the damage identification problem is recalled and a modal expansion method is introduced. Next, the objective function for iterative optimization process based on the GFM is formulated, and the Trust-Region algorithm is utilized to obtain the solution of the optimization problem for multiple damage cases. And then for computing the objective function gradient, the sensitivity analysis regarding design variables is derived. In addition, due to the spatial incompleteness, the influence of stiffness reduction and incomplete modal measurement data is discussed by means of two numerical examples with several damage cases. Finally, based on the computational results, it is evident that the presented approach provides good validity and reliability for the large and complicated engineering structures.
基金Supported by the National Aeronautical Foundation of Science and Research of China (No.04F52041)the Natural Science Foundation of Jiangsu Province (No.BK2006188).
文摘Low-Density Parity-Check (LDPC) code is one of the most exciting topics among the coding theory community.It is of great importance in both theory and practical communications over noisy channels.The most advantage of LDPC codes is their relatively lower decoding complexity compared with turbo codes,while the disadvantage is its higher encoding complexity.In this paper,a new ap- proach is first proposed to construct high performance irregular systematic LDPC codes based on sparse generator matrix,which can significantly reduce the encoding complexity under the same de- coding complexity as that of regular or irregular LDPC codes defined by traditional sparse parity-check matrix.Then,the proposed generator-based systematic irregular LDPC codes are adopted as con- stituent block codes in rows and columns to design a new kind of product codes family,which also can be interpreted as irregular LDPC codes characterized by graph and thus decoded iteratively.Finally, the performance of the generator-based LDPC codes and the resultant product codes is investigated over an Additive White Gaussian Noise (AWGN) and also compared with the conventional LDPC codes under the same conditions of decoding complexity and channel noise.
基金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.
文摘The adaptive generalized matrix projective lag synchronization between two different complex networks with non-identical nodes and different dimensions is investigated in this paper. Based on Lyapunov stability theory and Barbalat＇s lemma, generalized matrix projective lag synchronization criteria are derived by using the adaptive control method. Furthermore, each network can be undirected or directed, connected or disconnected, and nodes in either network may have identical or different dynamics. The proposed strategy is applicable to almost all kinds of complex networks. In addition, numerical simulation results are presented to illustrate the effectiveness of this method, showing that the synchronization speed is sensitively influenced by the adaptive law strength, the network size, and the network topological structure.
基金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.
文摘Pseudopolar rings are closely related to strongly -regular rings, uniquelystrongly clean rings and semiregular rings. In this paper, we investigate pseudopolar-ity of generalized matrix rings Ks（R） over a local ring R. We determine the conditionsunder which elements of Ks（R） are pseudopolar. Assume that R is a local ring. It isshown that A ∈ Ks（R） is pseudopolar if and only if A is invertible or A^2 ∈ J（Ks（R））or A is similar to a diagonal matrix [ u 0 0 j ]; where lu -rj and lj-ru are injectiveand u 2 U（R） and j ∈ J（R）. Furthermore, several equivalent conditions for Ks（R）over a local ring R to be pseudopolar are obtained.
文摘A norm of a quaternion matrix is defined. The expressions of the least square solutions of the quaternion matrix equation AX = B and the equation with the constraint condition DX = E are given.
文摘In this paper we derive a practical method of solving simultaneously the problem of Schmidt decomposition of quaternion matrix and the orthonormalization of vectors in a generalized unitary space by using elementary column operations on matrices over the quaternion field.
基金Supported by the National Natural Science Foundation of China（71261010）
文摘Generalized strictly diagonally dominant matrices play a wide and important role in computational mathematics, mathematical physics, theory of dynamical systems, etc.But it is difficult to judge a matrix is or not generalized strictly diagonally dominant matrix.In this paper, by using the properties of α-chain diagonally dominant matrix, we obtain new criteria for judging generalized strictly diagonally dominant matrix, which enlarge the identification range.
文摘The symmetric,positive semidefinite,and positive definite real solutions of the matrix equation XA=YAD from an inverse problem of vibration theory are considered.When D=T the necessary and sufficient conditions for the existence of such solutions and their general forms are derived.
基金This project is granted financial support from NSFC (11071079)NSFC (10901056)+2 种基金Shanghai Science and Technology Commission Venus (11QA1402200)Ningbo Natural Science Foundation (2010A610097)the Fundamental Research Funds for the Central Universities and Zhejiang Natural Science Foundation (Y6110043)
文摘In this paper,the quaternion matrix equations XF-AX=BY and XF-A=BY are investigated.For convenience,they were called generalized Sylvesterquaternion matrix equation and generalized Sylvester-j-conjugate quaternion matrix equation,which include the Sylvester matrix equation and Lyapunov matrix equation as special cases.By applying of Kronecker map and complex representation of a quaternion matrix,the sufficient conditions to compute the solution can be given and the expressions of the explicit solutions to the above two quaternion matrix equations XF-AX=BY and XF-A=BY are also obtained.By the established expressions,it is easy to compute the solution of the quaternion matrix equation in the above two forms.In addition,two practical algorithms for these two quaternion matrix equations are give.One is complex representation matrix method and the other is a direct algorithm by the given expression.Furthermore,two illustrative examples are proposed to show the efficiency of the given method.
基金Fundamental Research Funds (N110423007) for the Central Universities
文摘In this paper, it is proved that under certain conditions, each Jordan left derivation on a generalized matrix algebra is zero and each generalized Jordan left derivation is a generalized left derivation.
基金This work was supported by the Chinese Outstanding Youth Foundation (No. 69925308)Program for Changjiang Scholars and Innovative Research Team in University.
文摘In this note, the matrix equation AV ＋ BW = EVJ is considered, where E, A and B are given matrices of appropriate dimensions, J is an arbitrarily given Jordan matrix, V and W are the matrices to be determined. Firstly, a right factorization of （sE - A）^-1 B is given based on the Leverriver algorithm for descriptor systems. Then based on this factorization and a proposed parametric solution, an alternative parametric solution to this matrix equation is established in terms of the R-controllability matrix of （E, A, B）, the generalized symmetric operator and the observability matrix associated with the Jordan matrix d and a free parameter matrix. The proposed results provide great convenience for many analysis and design problems. Moreover, some equivalent forms are proposed. A numerical example is employed to illustrate the effect of the proposed approach.
文摘Let G be a generalized matrix algebra over a commutative ring R and Z（G） be the center of G. Suppose that F, T ：G→G are two co-commuting R-linear mappings, i.e., F（x）x = xT（x） for all x ∈ G. In this note, we study the question of when co-commuting mappings on G are proper.
基金Project supported by the National Natural Science Foundation of China （Grant No.60672160）
文摘In this paper, a system of complex matrix equations was studied. Necessary and sufficient conditions for the existence and the expression of generalized bipositive semidefinite solution to the system were given. In addition, a criterion for a matrix to be generalized bipositive semidefinite was determined.
基金Supported by National Natural Science Foundation of China (No. 50375106) , the State Scholarship Fund (No. 2004812032) and Key Laboratory of Intelligent Manufacturing at Shantou University ( No. Imstu-2002-11).
文摘According to the definition of the new hypothetical states which have obvious physical significance and are termed as no-gravity static and accelerated states, a method for exact computation of the parallel robot＇s generalized inertia matrix is presented. Based on the matrix theory, the generalized inertia matrix of the parallel robot can be computed on the assumption that the robot is in these new hypothetical states respectively. The approach is demonstrated by the Delta robot as an example. Based on the principle of the virtual work, the inverse dynamics model of the robot is formulized after the kinematics analysis. Finally, a numerical example is given and the element distribution of the Delta robot＇s inertia matrix in the workspace is studied. The method has computationa＇, advantage of numerical accuracy for the Delta robot and can be parallelized easily.
文摘In this paper,we intreduce the concept and discuss the properties of minimum cycle of row vector in a generalized circulant Fuzzy matrix. We present a new expression for circulant Fuzzy matrix,and discuss some properties of the idempotent elements of the semigroup of generalized circulant Fuzzy matrixes in connection with minimum cycle of row vector.
基金The works is supported by the National Natural Science Foundation of China(19871054)
文摘Assume that a convergent matrix sequence{A<sub>n</sub>}:A<sub>n</sub>→A（n→∞）, A<sub>n</sub>,A∈C<sup>3×3</sup>.We want to form a new matrix sequence {H<sub>n</sub>}, derived from {A<sub>n</sub>}, which has also A aslimit and whose convergence is faster than the of {A<sub>n</sub>}. Three rational extrapolation meth-ods for accelerating the convergence of matrix sequences {A<sub>n</sub>} are presented in this paper.The underlying methods are based on the generalized inverse for matrices which is
