行矩阵

The algorithm uses the wavelet decomposition and reconstruction in multi-resolution editing B-spline curves and transforms a zonal matrix or sparse matrix to a row simplified matrix using the properties of the augmented matrix of the system of linear equations,which is a zonal matrix or sparse matrix,by elementary row operation.

该算法利用方程组的增广矩阵为类带状矩阵或者稀疏矩阵这一特点，运用简单的矩阵的行初等变换，将类带状矩阵或者稀疏矩阵化成容易接受的行简化矩阵，解方程组，使小波分解与重构的过程快速准确，使从事相关工作的技术人员更容易理解和接受。

This thesis consists of two parts. The first one was that boundary value problem was discrete with five point difference method. Three kinds of memory formats were studied, which were full matrix, half band width and row compress sparse. Full matrix memory format and half band width memory format first was contrasted. The results show that half band width has efficiency in space. Then the algebraic system of finite element method was solved by Gauss-Seidel iteration method to popular row compress sparse memory format.

本论文由两部分组成，第1部分针对边值问题，用5点差分格式进行离散，并对离散矩阵这类大型稀疏矩阵，研究了系数矩阵的3种存储格式的优劣，即：满矩阵存储格式、半带宽存储格式和按行压缩稀疏存储格式，首先我们将满矩阵存储方式和半带宽存储格式进行了对比，迭代法的数值实验表明：利用半带宽存储的矩阵在空间运算方面具有高效性；然后针对目前数值实验中流行的按行压缩稀疏存储格式，实现了有限元离散代数系统的迭代法的求解。

When scaled factor circulant matrices are nonsingular, we can find the single solution of the scaled factor circulant matrix equation; When scaled factor circulant matrices are singular, we can find the special as well as the general solution of the scaled factor circulant matrix equation; There is only an error of approximation when the fast algorithm is implemented on computers, and only the elements in the first row of the scaled factor circulant matrix and the constants in the diagonal matrix are needed by the fast algorithm.

当鳞状因子循环矩阵非奇异时，该快速算法求出线性方程组的唯一解；当鳞状因子循环矩阵奇异时，该快速算法求出线性方程组的特解与通解。该快速算法仅用到鳞状因子循环矩阵的第一行元素及对角矩阵中的对角上的常数进行计算。在计算机上实现时只有舍入误差。

A code C can be constructed from a Paley matrix of order n,where n is a power of odd prime. The code contains codewords 0 =(0,0,......,0),1 =(1, 1,....., 1) and the rows of/2 and (-5 /-- J)/2, where I and J are respectively identity matrix and the matrix with all entries equal to one.

从凡阶＊缸矩阵S出发，可以构造一个码氏它含有码字0＝叮0；…；0X1二O；1，…；1）以及矩阵（S＋I＋刀／2和（一S＋I＋刀／2的全部行向量，其中凡是奇素数的方幂；了和J分别是单位矩阵和全1矩阵。

This is the so-called Duerlite algorithms: from the bottom row of the matrix A do elementary transformation, the diagonal elements into the bottom left of zero, and then show the effect of these lines is equivalent to transform the left by a unit lower triangular matrix, this series of unit lower triangular matrix inverse is the product of L matrices, it is also a unit lower triangular matrix.

这正是所谓的杜尔里特算法：从下至上地对矩阵A做初等行变换，将对角线左下方的元素变成零，然后再证明这些行变换的效果等同于左乘一系列单位下三角矩阵，这一系列单位下三角矩阵的乘积的逆就是L矩阵，它也是一个单位下三角矩阵。

The major foundation is that the rank of the matrix should be kept alike after making primary transformation of the matrix consists of transformation of lines and transfortmation of rows,here are mainly the instances of the transformation of lines.

主要依据是矩阵的初等变换在变换前后保持矩阵的秩不变，矩阵的初等变换包括行初等变换和列初等变换。这里主要以行初等变换为例。

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方程以及系统的能谱打下了很好的基础。

To realize reduced equivalent representation for functional dependency set, sameroot row, same-class row and same-class row family are presented, merging rules of same-root row in a schema matrix are defined, merging algorithm of same-root row and solving algorithm of same-class row family in a schema matrix are discussed.

为了实现函数依赖集的最简等价表示，提出了同根行、同类行、同类行族的概念，定义了模式矩阵M中同根行的合并运算规则，讨论了模式矩阵M中同根行合并算法，同类行族求解算法。

Based on this, convert the matrix equations problem for row symmetric matrices into ordinary matrix equations problem, the scale of converted matrix equations problem is half of that for the original problem.

在此基础上，将行对称矩阵方程组问题转化为一般的矩阵方程组问题，转化后的一般矩阵方程组问题的规模是原行对称矩阵方程组问题的一半。

This chapter clarifies the nested relationship between the matrix family of unitary, orthogonal, Givens, Householder, permutation, and row or column symmetric matrices. A precise correspondence of the singular values and singular vectors between the unitary-symmetric matrix and its mother matrix is derived and proved (hence a fast algorithm of singular value decomposition for unitary-symmetric matrix is straightforwardly obtained), and the corresponding perturbation bound is provided.

该章揭示了酉对称矩阵、正交对称矩阵、 Givens 对称矩阵、 Householder 对称矩阵、置换对称矩阵和行对称矩阵之间的逐级包含关系；推导并证明了，酉对称矩阵的奇异值和奇异向量与母矩阵的奇异值和奇异向量之间的定量关系，据此可得酉对称矩阵奇异值分解的快速算法；给出并证明了摄动矩阵的摄动界。

In the negative and interrogative forms, of course, this is identical to the non-emphatic forms.

。但是，在否定句或疑问句里，这种带有"do"的方法表达的效果却没有什么强调的意思。

Go down on one's knees;kneel down

屈膝跪下。。。下跪祈祷