查询词典 coefficient matrix

This dissertation puts forward a structuring method of some complicated problems as well as methods of combination of the judgment matrix on group decision basis demonstrates that these two ways strengthen the consistency of the judgment matrix. Besides, it makes some researches into theory of combination of judgment matrix on the group decision basis, suggests two methods of calculating the coefficient of the convex combination and puts forward a method to construct individual and comprehensive judgment matrix based on rough-set by cooperating with others accordingly.

5给出了群决策条件下复杂问题结构化方法；提出了群决策条件下群体AHP判断矩阵集结的两种方法，证明了这两种集结方法保持或改善了判断矩阵的一致性；研究了群决策条件下判断矩阵优化集结原理，给出了判断矩阵两种凸组合系数优化计算方法；合作提出了一个基于Rough Set的个体判断矩阵和综合判断矩阵构造方法。

The algorithm has following properties: Although the merit function has the form of least squares of a system of overdetermined equations, in the Newton equation of our algorithm, only the coefficient matrix of the system of overdetermined equations is used instead of its product as in Guass-Newton method for solving the least squares problems. That is, our Newton method is more like that for the system of nonlinear equations rather than that for LSPs. The global convergence is obtained for VLCP with vertical block P_0 + R_0 matrix; The local quadratic convergence rate is proved under the condition that the solution is BD-regular; Although there is only a Newton equation in our algorithm, the finite convergence property can be shown if matrix is vertical block P— matrix (without the hypotheses of strict complementarity).

该算法具有下列特点：所构造的价值函数虽然具有超定方程组的最小二乘问题的形式，但在基此建立的Newton算法中，其Newton方程的形式更象非线性方程组的Newton法中的Newton方程，仅利用了超定方程组的系数矩阵本身的信息，避免了一般最小二乘问题的Guass-Newton法中必须计算系数矩阵的乘积的工作量；对竖块P_0+R_0矩阵的垂直线性互补问题，算法具有全局收敛性；在解是BD-正则条件下，证明了算法的局部二次收敛性；虽然算法只含一个Newton方程，但对竖块P-矩阵垂直线性互补问题，算法具有有限步收敛性。

The main theory results includes:(1) Using the properties of Hilbert transform, perfectly reconstruction and new type of lifting scheme, a new type of dual-tree binary coefficients complex wavelet with linear phase is achieved.(2) For linear systems that can be diagonalized by GFT and DST-II matrices, an efficient MGM method is proposed, convergence is proved.(3) We discuss the algebraic structure when Toeplitz matrix is transformed by multi-band wavelet,show that Toeplitz matrix is composed of generating function is transformed to a band and sparse matrix when wavelet applied to this matrix, based on the above results, an efficient solution of Toeplitz equations is obtained, and the computational complex is O,where N is the order of matrix.

理论成果主要包括：(1)对于对偶树二进制系数复数小波，利用Hilbert变换对性质、完全重构条件并结合新的提升格式构造研究了含参系数多进制小波构造方法，作为特例得到具有线性相位的对偶树二进制系数复数小波构造方法；(2)对于广义离散傅立叶变换与正弦变换对角化系统，提出了高效、快速的多重网格算法，理论上证明了算法的收敛性；(3)研究了Toeplitz矩阵在多进制小波变换下的代数结构，验证了多项式生成函数构成的Toeplitz系统在小波变换下的稀疏带宽性质，从而建立基于小波变换求解Toeplitz系统的快速求解方法，运算量级控制在O，其中N为系统的阶。

In Chapter 5, the least-squares solutions bisymmetric matrix set of the matrix equation ATXA = B on two linear manifolds Si ={X BSRnxn\\\XY - Z\\ = min} and S2 ={X BSRnXn\XY = Z, YtTZi = ZjYu ZtffYi = Zi,i = 1,2, Y, Z e Rnxm}, by applying the singular value decomposition of matrix and the canonical correlation decomposition of matrix pairs, we obtain a general expression of the least-squares solutions of the matrix equation ATXA = B on two linear manifolds.

在第五章，我们研究了两类线性流形S_1={X∈BSR~|‖XY-Z‖=min}和S_2={X∈BSR~|XY=Z，Y_i~TZ_i=Z_i~TY_i，Z_iY_i+Y_i=Z_i，i=1，2，Y，Z∈R~}上矩阵方程A~TXA=B的双对称最小二乘解。

From the history of Matrix and Transformation and the development of curriculum at home and abroad, putting matrix combined with the transformation, and orienting the study in 2×2 rank matrix, boosting matrix up the geometrical visualization as a algebra objects are a new perspective on knowing matrix.

从矩阵和变换的历史发展过程和国内外矩阵和变换的课程设置来看，把矩阵与变换相结合，并定位在2×2阶上研究矩阵，增强作为代数对象的矩阵的几何直观性，是认识矩阵的一个新视角。

We make the following assumption for When 2 is positive definite matrix, different estimators about matrix of regression coefficients and inefficiency of Least squares estimate have been discussed in many documents. Considered 2 is nonnegative definite matrix, this thesis derives Best linear unbiased Estimate of parameter matrix B and estimable parameter function KBL under the meaning of matrix nonnegative definite and the property of maximum probability of BLUE is investigated.

当∑＞0时，众多文献讨论了回归系数阵的各种估计及LSE的有效性，本文考虑了当∑≥0的情形，给出了回归系数阵B及其可估参数函数KBL的在矩阵非负定意义下的最优估计，研究了它的一个最大概率性质，并且讨论了最小二乘估计成为最佳线性无偏估计的充分必要条件，在此基础上给出了均值矩阵的最小二乘估计与BLUE的偏差估计，定义了LSE相对于BLUE的一个相对效率，并给出了它的界。

Of the fundamental matrix in (2) satisfies the differential equation =A , it follows that the matrix = itself satisfies the matrix differential equation Because its column vectors are linearly independent, it also follows that the fundamental matrix is nonsingular, and therefore has inverse matrix .

基本矩阵的求解由于（2）中的基本矩阵的列向量满足微分方程A，进而这个矩阵本身就满足矩阵微分方程。

In chapter one,we discuss tournament matrices that can not end in tie and theyare(0,1)-matrices,we first obtain a better lower bound for the number of regulartournament matrices,then we discuss the payoff matrix of tournament matrix,obtainsome properties of positive tournament matrices,a correlation between the spectralof a tournament matrix and its payoff matrix.We find serveal conditions that areequivalaent to a tournament matrix having 1 as its a eigenvalue.

第一章讨论不允许平局的竞赛矩阵-（0，1）-矩阵，得到了正则竞赛矩阵数目的一个下界，它改进了文献〓中已有的结果；在文献〓的基础上进一步讨论了正竞赛矩阵的性质，给出了利用已知平衡向量构造新平衡向量的方法；讨论了竞赛矩阵和它的支付矩阵的特征值之间的关系；指出了文献〓中的一个错误，回答了文献〓中的一个公开问题，得到了整数1为竞赛矩阵的特征值的充要条件及这种矩阵的谱根与得分向量之间的关系。

At first, the paper quote a kind of special matrix ---sign symmetric matrix , anti sign symmetric matrix , weakly sign symmetric matrix and introduced some important results in spectral property about them from some bibliographies. And then, the paper extended the formerly results and gave more general conclusions about spectral property of sign symmetric matrix.

本文首先引入了一类特殊矩阵的概念——符号对称矩阵，反符号对称矩阵以及弱符号对称矩阵，在相关文献中对这类矩阵谱特征的已经有了一些结论，本文在前人研究的基础上将相关结论做了进一步的推广，得出了有关这类符号对称矩阵谱特征的更一般性的结论。

Our results improve the former results. For periodic Jacobi matrix, some new spectral properties of periodic Jacobi matrix are given by studying the relationship of the eigenvalues of periodic Jacobi matrix and its n—1 principal submatrix. Applying these spectral properties, we present a necessary and sufficient condition for the solvability of an inverse problem of periodic Jacobi matrices and discuss the number and the relationship of its solutions. Furthermore, we propose a new algorithm to construct its solution and compare it with the former algorithms. As this inverse problem of periodic Jacobi matrix usually has multiple solutions as many other eigenvalue inverse problems, we study the uniqueness of this problem. And a necessary and sufficient condition is given to ensure its uniqueness, under which an algorithm is presented and the stability analysis is also given. Finally, we put forward a new inverse problem for periodic Jacobi matrix which has not been solved.

对周期Jacobi矩阵特征值反问题，通过研究周期Jacobi矩阵与其n-1阶主子阵特征值的关系，给出了周期Jacobi矩阵的一些新的谱性质；利用这些谱性质，研究了一类周期Jacobi矩阵特征值反问题，用新的方法推导出了该类特征值反问题有解的充分必要条件，并讨论了解的个数以及解与解之间的关系；此外，提出了一种新的构造周期Jacobi矩阵反问题解的数值算法，并与前人的算法做了一定比较；由于周期Jacobi矩阵特征值反问题和其他很多特征值反问题一样往往存在多个解，本论文给出了周期Jacobi矩阵反问题解唯一的充要条件，并发现周期Jacobi矩阵特征值反问题的解唯一当且仅当构造的矩阵满足一定的条件；在解唯一的情况下，给出了构造唯一解的数值算法，并做了相应的稳定性分析；最后，提出了一类新的有待于解决的周期Jacobi矩阵特征值反问题。

You can snipe the second and third union leaders from this position.

您可以鹬第二和第三工会领袖从这一立场出发。

Aiming at the currently shortage of XML streams quality detecting, this paper proposes a new forecasting method of XML streams quality by least squares support vector machines, which is used the method of XML keys' vector matrix as windows, and vector product wavelet transform to multilevel decompose and refactor the XML streams series, that can fulfill real-time checking demand of XML quality, and ensure constraint, consist- ency and integrality. For even more adapting net load, it proposes a control strategy by weight and adaptive adjustment to ensure XML streams quality.

针对当前XML数据流质量检测存在的不足，提出构建XML键的矢量矩阵作为窗口，利用矢量积小波变换多级分解与重构XML数据流，再结合最小二乘支持向量机对XML数据流质量进行预测的一种方法，满足XML数据流质量重构时实时检测的要求，保证XML数据的约束性、一致性与完整性；为了更好的适应网络负载，采取加权与自适应窗口调整等调度策略充分保证XML数据流的质量检测。