The free vibration problem of rectangular thin plates is rewritten as a new upper triangular matrix differential system. For the associated operator matrix, we find that the two diagonal block operators are Hamiltonia...The free vibration problem of rectangular thin plates is rewritten as a new upper triangular matrix differential system. For the associated operator matrix, we find that the two diagonal block operators are Hamiltonian. Moreover, the existence and completeness of normed symplectic orthogonal eigenfunction systems of these two block operators are demonstrated. Based on the completeness, the general solution of the free vibration of rectangular thin plates is given by double symplectie eigenfunction expansion method.展开更多
In this paper we introduce the class of Hermite's matrix polynomials which appear as finite series solutions of second order matrix differential equations Y'-xAY'+BY=0.An explicit expression for the Hermit...In this paper we introduce the class of Hermite's matrix polynomials which appear as finite series solutions of second order matrix differential equations Y'-xAY'+BY=0.An explicit expression for the Hermite matrix polynomials,the orthogonality property and a Rodrigues' formula are given.展开更多
The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanal...The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanalysis attack after 5 rounds while IDEA（8） needs 7 rounds for the same level of security. The transition matrix for IDEA（16） and its eigenvalue of second largest magnitude are computed. The storage method for the transition matrix has been optimized to speed up file I/O. The emphasis of the work lies in finding out an effective way of computing the eigenvalue of the matrix. To lower time complexity, three mature algorithms in finding eigenvalues are compared from one another and subspace iteration algorithm is employed to compute the eigenvalue of second largest module, with a precision of 0.001.展开更多
基金Supported by the National Natural Science Foundation of China under Grant No.10962004the Natural Science Foundation of Inner Mongolia under Grant No.2009BS0101+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No.20070126002the Cultivation of Innovative Talent of "211 Project"of Inner Mongolia University
文摘The free vibration problem of rectangular thin plates is rewritten as a new upper triangular matrix differential system. For the associated operator matrix, we find that the two diagonal block operators are Hamiltonian. Moreover, the existence and completeness of normed symplectic orthogonal eigenfunction systems of these two block operators are demonstrated. Based on the completeness, the general solution of the free vibration of rectangular thin plates is given by double symplectie eigenfunction expansion method.
文摘In this paper we introduce the class of Hermite's matrix polynomials which appear as finite series solutions of second order matrix differential equations Y'-xAY'+BY=0.An explicit expression for the Hermite matrix polynomials,the orthogonality property and a Rodrigues' formula are given.
基金Supported by the National Natural Science Foundation of China (60573032, 90604036)Participation in Research Project of Shanghai Jiao Tong University
文摘The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanalysis attack after 5 rounds while IDEA（8） needs 7 rounds for the same level of security. The transition matrix for IDEA（16） and its eigenvalue of second largest magnitude are computed. The storage method for the transition matrix has been optimized to speed up file I/O. The emphasis of the work lies in finding out an effective way of computing the eigenvalue of the matrix. To lower time complexity, three mature algorithms in finding eigenvalues are compared from one another and subspace iteration algorithm is employed to compute the eigenvalue of second largest module, with a precision of 0.001.
