矩阵函数

The pupose of the research is to develops public key encryption and digital signature shemes based on matrix canonical decomposition problem, or matrix diagonalization problem over Z/n, the ring of integers with modulo-n addition and multiplication in particular, where n is an RSA modulus.

本课题研究基于矩阵经典分解问题，特别是Z/n上矩阵对角化问题的公钥密码与数字签名算法，其中n是一个RSA模数。新算法采用由一个矩阵多项式构成的多维单向陷门函数，其单向性由矩阵对角分解问题(即通过相似变换将矩阵化为对角型的问题)的复杂性来保障，对该函数求逆的陷门由矩阵的特征值或特征向量提供。

Secondly, a conjecture about the stability for these systems is proposed based on the sufficient and necessary condition of the isolated transfer function being positive real. When the zeros and poles of the transfer functions lie in the imaginary axis, a known conclusion is derived from the conjecture; while the zeros and poles are on the real axis, a new result is obtained and is proved in this note. Finally, according to the conjecture, an example with poles existing on the complex plane is presented, which is not only interesting but also challenging.

然后， 基于所有孤立部分传递函数都正实的充分必要条件给出了上述系统为稳定的一个猜想，当传递函数的零极点都位于虚轴上时，由这一猜想得到了一个已知的结论；当传递函数的零极点都位于实轴上时，由这一猜想得到了一个新的结论，本文证明该结论是正确的；最后，根据这一猜想，给出了传递函数极点位于复平面的一个例子，它涉及到一类系数矩阵为时变正定矩阵的振动方程的稳定性问题，值得去深入研究。

In this dissertation, we construct the Bariev model with nine kinds of boundary fields by the matrices K_± defining the boundaries. And then the Lax operator is given in the form ofmatrix, as well as the basic quantities, e.g., the R -matrix, the monodromy matrices and the transfer matrices are defined. By using the expression of the local Lax operator of the model,the action of the monodromy matrices T, T~(-1), U_ on the pseudo-vacuum state is given outin detail. Furthermore, the main fundamental commutation relations are obtained through the reflection equations, the recursive n-particle state as well as the one-particle exact solution is given and the Bethe ansatz equations are found accordingly. Finally, we list the nesting boundary K matrices, which play a crucial role for obtaining the n-particle solution and finding the Bethe ansatz equations, the eigenvalues of the transfer matrices and the energy spectrum of the system by means of the nested algebraic Bethe ansatz method.

在这篇文章中，我们利用边界K_±矩阵构造出了具有九种边界场的Bariev模型，同时给出了该模型L算子的具体矩阵表示形式，并定义了R矩阵，monodromy矩阵以及转移矩阵；接着利用L算子的矩阵形式，给出了其对应monodromy矩阵T、逆矩阵T~(-1)作用到真空态上的值，并利用Yang-Baxter关系及反射方程得到了双行monodromy矩阵U作用到真空态上的值；然后利用反射方程通过复杂的计算得到了一系列重要的基本对易关系式，并给出了模型的递推的多粒子波函数、单粒子解及Bethe ansat方程；最后给出了模型的嵌套的边界K矩阵的具体形式，从而为运用嵌套Bethe ansatz方法求解该模型的多粒子解、Bethe ansatz方程以及系统的能谱打下了很好的基础。

In this dissertation, we mainly use character matrix to research cryptology characteristic of Boolean function and m-ary logic function.Firstly, by using properties of character matrix's row and column we get an equivalence condition of bent function. Then we have an entirely construct method of 4 variable bent function.

本文利用特征矩阵研究了密码学中逻辑函数的相关问题，主要做的工作有：首先，根据Bent函数的自相关特征，利用特征矩阵给出了Bent函数的一个新的等价判别条件，并由此得到了4元Bent函数的一个完全构造方法。

In the sense of weak effective solution,the problems of Lagrange duality and saddle point are discussed under the convexlike condition.An alternative theorem of the system containing a semidefinite constraint of a matrix function is established at first.

首先在似凸条件下建立了一个含矩阵函数半定约束系统的择一性定理，由此得到多目标半定规划及其在弱有效解意义下的Lagrange对偶理论，包括弱对偶、强对偶和逆对偶等。

The method of estimation in paper [7] is to build fitness function by the 2-norm of error matrix directly. For the error matrix is a Toeplitz matrix, a novel fitness function was presented. Then a new method, the real-valued genetic algorithm which is based on genes weights variation independently, is developed in this paper.

文献[7]提出的估计方法直接以误差矩阵的2范数建立适应度函数，文中利用该矩阵是Toeplitz矩阵的特性，构造了一个新的适应度函数，提出了一种基于基因分量独立变异的实数遗传算法。

This thesis concerns convergence theorems and truncation error bounds for all kinds of continued fractions with applications to matrix function computation.

这扁论文讨论了各类连分式的收敛性与误差估计以及它在矩阵函数计算方面的一些应用。

The matrix =( xi, xjp having the e-th power of the greatest common P-divisorp of xi and xj as its-entry is called the e-th power GCD matrix on S. The matrix = having the e-th power of the least common P-multiple p of xi and xj as its-entry is called the e-th power LCM matrix on 5. We obtained the following results:(1) is nonsingular for any set S;(2) If S is an FC set, then the determined of has formula Det =Jpe(x1)...Jpe, where the function Jpe is the generalized Jordan totient function;(3) A formula of the inverse of is given when S is an FC set;(4) If S is an FC set, then |.

以_P的e次方为第i行j列元素的矩阵称为定义在S上的e次幂GCD矩阵，记为；以_P的e次方为第i行j列元素的矩阵称为S上的e次幂LCM矩阵，记为，我们得到了如下结果：①定义在集合S上的e次幂GCD矩阵是非奇异的；②若S是R上的FC集，则S上的e次幂GCD矩阵的行列式Det=J_p~e(x_1)J_P~e(x_2)…，J_p~e，其中J_p~e为R上的Jordan函数；③当S为FC集时，得到了的逆矩阵~-1的表达式；④证明了当S是FC集时，整除，即等于与R上另一个矩阵的乘积。

This is a vast collection of computational algorithms ranging from elementary functions like sum, sine, cosine, and complex arithmetic, to more sophisticated functions like matrix inverse, matrix eigenvalues, Bessel functions, and fast Fourier transforms.

MATLAB 的工具箱函数库收集了大量的数学函数，从求和，正弦，余弦以及复杂的算术运算等基本函数，到矩阵求逆，矩阵求特征值，贝塞尔函数和快速傅里叶变换等复杂函数。

By defining a matrix function and introducing a free matrix U, the pole assignment constraint is relaxed, and the gradient σ2/U and σ2 σ2[V-1]/U are obtained. Thus robust design can be achieved by gradient method. Examples show that this method is very effective.

通过定义一矩阵函数并引入新的自由变量U，可放松极点配置的约束，并能系统的推导σ2/U及(σ2·σ2[V-1])/U，从而将鲁棒设计转化为无约束的梯度法寻优，实例说明，本文设计方法的效果很好。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。