查询词典 rectangular matrix

In terms of order of industrial development, this thesis uses industrial engineering theory, establishes relevant coefficient matrix of leading industry choosing criterion and correlative effect matrix, calculates leading industry of Hebei province.

在工业行业发展序列的选择上，运用工业工程理论，建立主导产业选择基准相关系数矩阵和关联效应矩阵，测算比选出河北省工业主导产业。

OD estimation was divided into fixed steps, with every step containing a bi-level programming. The upper-level problem was a generalized least squares estimator, while the lower level problem was a stochastic user equilibrium model. Namely, based on generalized least squares estimator and stochastic user equilibrium, a new estimator of the OD matrix was proposed by target matrix and traffic counts updating.

将OD估计分为固定的步数，每一步都是一个双层规划，上层为广义最小二乘估计，下层为随机用户均衡分配模型，即以广义最小二乘估计和随机用户均衡分配模型为基础，通过更新估计模型中目标矩阵和实测路段上的流量来估计OD矩阵。

The third aspect: we consider comparison of Minimum Norm Quadratic Unbiased Estimator and ordinary least squares estimator of in the multivariate normal linear model Y ~ N{XB, V, where the design matrix A' need not have full rank and the dispersion matrix V can be singular.

使用的损失函数有二次损失函数、嫡损失函数和对称损失函数。论文基于以下三个准则：二次损失风险准则、嫡损失风险准则和对称损失风险准则，将MINQUE和LSE进行比较。

In §8, we give the exist conditions, explicit expressions and fast algorithms of left inverse and right inverse of m× n Vandermonde-type matrix and Loewner-type matrix.

在§8中，给出了mxnLoewner型矩阵和Vandermonder型矩阵的左逆和右逆、表达式及快速算法。

Chapter 3 is devoted to equistability and equiboundedness of matrix differential equations by making use of the symbol property of the matrix Liapunov function and its Dini derivate on specific set.

第三章研究了矩阵微分方程的渐近行为，给出了直接运用矩阵Liapunov函数在某特定集合上的符号与其广义Dini导数符号的性质研究矩阵微分方程的稳定性和有界性。

Firstly, several kinds of schemes were proposed according to the design demand. The best scheme was chosen after analyzing and comparing the schemes. The robot's structure was designed with Pro/Engineer and AutoCAD software. Secondly, the kinematics analysis conducted, coordinate transformation matrix using D-H method was set up, and the kinematics equation direct solution and inverse solution was deduced. The manipulative interface about the kinematics equation direct solution and inverse solution was completed with VC++ and the velocity Jacobian of displacement matrix was constructed using differential transform method. In the process of the trajectory planning based on robot's kinematics analysis, I propone a method by which we can get middle nodal point with normalizing factor in order to simplify our searching for these middle nodal points. In addition, I give these middle nodal points with actual physics signification. For eliminating contradiction between real-time and accuracy, I bring forward separately limit of error and reversal interpolation method. For decreasing calculation quantity, we resort to tri-spline interpolation in the articulation space.We analyse the work range of the robot by resorting to graphic means.

首先，作者针对机器人的设计要求提出了多个方案，对其进行分析比较后，选择其中最优的方案后用Pro/Engineer和AutoCAD软件进行了机器人模型结构设计；其次，进行了运动学分析，用D-H方法建立了坐标变换矩阵，推算了运动方程的正、逆解，运用VC++制作了正、逆运动学求解的求解界面；并且用微分变换法推导了速度雅可比矩阵；在基于机器人的运动学的轨迹规划中，通过在操作空间的规划，提出了归一化因子来求解中间结点，通过它可以使求解中间结点变得更简单，并且赋予这些中间结点实际的物理含义，对于规划中精确性和实时性的矛盾，提出了以误差极限法和反向插值法来解决的方法；为了减少规划过程中计算量，在关节空间进行三次样条插值；然后借助图解法进行工作空间分析，作出了实际工作空间的轴剖图。

Linear algebra of matrix inversion, the use of this algorithm can be simplified matrix operation.

详细说明：线性代数中的矩阵求逆的问题，使用此算法可以简化矩阵的操作。

Credit matrix and credit correlation matrix were presented. Based on the iteration theories of linear equations, the convergence property of CA-CMAC in incremental learning was analyzed.

然后提出了信任度矩阵和信任度关联矩阵的概念，并根据线性方程组迭代理论，证明了改进算法在增量学习时的收敛性，给出了收敛条件并进行了验证。

From the matrix theory and the general principle of the iterative convergence of the linear coupled equations, this dissertation firstly proved the sufficient necessary convergent conditions for CMAC batch learning as well as the necessary convergent conditions for CMAC incremental learning, in which no additive conditions were needed. The past researchers'conclusions under the special condition of the positive articulation matrix are generalized and improved.

从矩阵理论和线性方程组迭代收敛的一般性原理出发，首次在不附加特殊条件的情况下，证明了CMAC学习算法在批量和增量两种学习方式下收敛的一般性定理，给出CMAC算法在批量学习方式下收敛的充要条件，以及在增量学习方式下收敛的必要条件，对前人在关联矩阵正定的特殊条件下得出的结论进行了推广和改进。

The classic iterative ones need special characters of the coefficient matrix; CG has over linear convergence, but the coefficient matrix is positive definite; Krylov subspace ones can deal with non-symmetric linear systems, but sometimes it must face"collapse"problems.

经典迭代法的收敛需要由系数矩阵的一些特定性质来保证；共轭梯度法具有超线性收敛性，但是系数矩阵必须是正定矩阵；Krvlov子空间法可用于非对称矩阵问题，但可能出现崩溃现象。

Many will continue to choose to live in duality and in conflict.

许多人将继续选择活在二元对立性和冲突中。

I find that students of the University of Physical Education all wear sportswear at first sight.

我发现：体育大学的学生乍一看，都是穿运动衣，大家都一样