查询词典 matrices

The condition for the solvability of the controllers is expressed by using the coefficient matrices of the whole system.

控制器的可解性条件由系统的系数矩阵表达，因此不需要矩阵分解，可避免由矩阵分解产生的数值问题。

An inductive learning method for classification based on information theory is proposed, which is a maximum contribution classification method according to the theory of channel transmission in information theory, the definition contribution is developed based on probability distribution of classified space, probability transfer matrices of classified space and feature space and mutual information, then entities is classified by the maximum contribution method.

提出了一种基于信息论的归纳分类学习算法－最大贡献分类算法。该算法根据信息论中信道传输的理论，把类别空间和各特征空间的概率转移矩阵以及互信息结合起来，定义了贡献的概念，从而得出了对给定的观测值，用它的最大贡献作为对实体进行分类的规则。

Using two new methods, this paper prores one pertubation theorem on the finite Hilbert space of 2×2 operator matrices, and gereralizes this theorem to the infinite Hilbert space of selfadjoint operators.

给出了有限维Hilbert空间中2×2算子矩阵的数值域扰动定理的两种证明方法，并且将该定理推广到无限维Hilbert空间上的自伴算子。

We denote by M_n and S_n the space of n×n fullmatrices and the space of n×n symmetric matrices over F, respectively.

记M_n和S_n分别为域F上n×n全矩阵空间和n×n对称矩阵空间。

This chapter defines the conceptsof P linear operator,〓 linear operator and 〓 linear operator by extending theconcepts of P matrix,〓 matrix and 〓 matrix to the linear operator from thelinear space of symmetric matrices to itself.In this chapter,we also present a path-following method and a potential reduction method for solving general linear matrixcomplementary problems,and analyzes their computational complexities undersuitable assumptions.

本章将第二章中给出的P矩阵、〓矩阵及P矩阵的概念推广到由实对称矩阵构成的向量空间到其自身的线性算子L上，得到了P线性算子、〓线性算子及P线性算子的概念，给出了求解一般线性矩阵互补问题的路径跟踪法和势函数约减法，并在L为P线性算子的假设下分析了这些算法的计算复杂性。

They are important theoretical foundation of the study about nonnegative matrices spectral radius.

这些都是研究矩阵谱性质的重要依据。

For solving the linear system with the iterative method, it is very important to estimate the spectral radius of the iterative matrices.

在用迭代法解线性方程组时，迭代矩阵的谱半径估计在迭代法的收敛性分析中起着重要的作用。

In this paper,two new methods of estimating are given and proved for the upper and lower bounds on the spectral radius of a nonnegative matrix ,which is based on two special matrices.

借助两个新的矩阵得到非负矩阵谱半径的两个新估计及其证明，并通过实例与以往的结论作比较，验证了这些估计的有效性及精确度。

The results not only is that problem of estimates of upper bounds of the spectral radius for some iteration matrices is solved but also convenient for apply.

解决了以往讨论迭代矩阵谱半径的估值问题，且使用方便。

In this paper,lower bounds on the spectral radius of adjacency matrices of trees and perfect trees are discussed by algebraic method and edge switching of graph,and all trees which reach lower bounds on the spectral radius are obtained.

利用代数方法、图的边变换，以及树的邻接矩阵谱与L ap lacian谱的关系，研究树和完美树的邻接矩阵谱半径和L ap lacian谱半径的下界，给出达到下界的所有极树，得到的新结果改进了文献[2]的结论。

Breath, muscle contraction of the buttocks; arch body, as far as possible to hold his head, right leg straight towards the ceiling (peg-leg knee in order to avoid muscle tension).

呼气，收缩臀部肌肉；拱起身体，尽量抬起头来，右腿伸直朝向天花板（膝微屈，以避免肌肉紧张）。

The cost of moving grain food products was unchanged from May, but year over year are up 8%.

粮食产品的运输费用与5月份相比没有变化，但却比去年同期高8％。