查询词典 triangular numbers

Clean-shaven but for a triangular, iron-gray chin beard, he perpetually sported the smile of the good-natured devotee of Buddha.

他突然走进了训练场，把教练召集到一起简单地训话，之后又观摩了几个有前途的年轻学员们的拳路。

We propose a method to cut and map a closed triangular mesh onto a 2D planar domain automatically.

提出一种自动地将任意闭合三角网格切开并保角映射到二维平面域的算法。

And the G〓 interpolated closed surface are obtained which are pieced by triangular Bezier patches with ovder 4K+1 in most case.

因而克服了以往方法中的不足之处，使得生成的闭曲面具有所用的曲面片个数少，表示式简单统一的优点。

Then,a new fast algorithm of the minimal norm least squares solution for linear system whose coefficients is an m×n symmetric Loewner matrix with full column rank is given by forming a special block matrix and researching the triangular factorization of its inverse.

对于工程计算中常常遇到的一类线性方程组的求解，通过构造特殊分块矩阵并研究其逆矩阵的三角分解，给出了求秩为n的m×n阶对称Loewner矩阵为系数阵的线性方程组，及极小范数最小二乘解的快速算法，该算法的计算复杂度为O+O(n2)，而一般方法的计算复杂度为O(mn2)+O(n3)。

In this paper, for m× n Loewner-type matrix or symmetric Loewner-type matrix with full column rank, we form special block matrix firstly and research their triangular factorization or of its inverse, and then get the fast algorithm of the minimal norm least squaresolution .

本文对于秩为n的m×n阶Loewner型或对称Loewner型矩阵L，通过构造特殊分块矩阵并研究其逆的三角分解或自身三角分解，进而得到了线性方程组Lx=b的极小范数最小二乘解快速算法，计算复杂度为O+O(n~2)，而一般方法的计算复杂度为O(mn~2)+O(n~3)。

A new fast algorithm of the minimal norm least squares solution for the linear system whose coefficient matrix is an m×n Loewner-type matrix with full column rank is given by forming a special block matrix and researching its triangular factorization.

通过构造特殊分块矩阵及其三角分解给出了求秩为n的m×n阶Loewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法，该算法的计算复杂度为O+O(n2)，而一般方法的计算复杂度为O(mn2)+O(n3)。

In Chapter three, by constructing a special partitioned matrix and studying the fast triangular factorization of its inverse matrix, we respectively give fast algorithms for the minimal norm least squares solutions of linear equations which coefficient matrices are n×m Toeplitz type matrices and Vandermonde-Loewner type matrices with full column rank.

第三章通过构造特殊分块矩阵并研究其逆矩阵的快速三角分解，分别给出了求以秩为m的n×m阶Toeplitz型矩阵和Vandermonde-Loewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法，并通过算例将新算法与已有的法方程组的方法和正交化方法作了比较。

Fast algorithm of minimal norm least square solution for Cauchy linear system;2. For the m×n Cauchy-type matrix with full column rank,the fast algorithm of the minimal norm least square solution to the linear system Cx=b was obtained by construction of a special block matrix and study of the triangular decomposition.

对于秩为n的m×n阶Cauchy型矩阵C，通过构造特殊分块矩阵并研究其三角分解，进而得到了线性方程组C x=b的极小范数最小二乘解的快速算法，所需运算量为O+O(n2)，而通常构造法方程组的方法所需运算量为O(m n2)+O(n3)，用正交化法虽然避免了构造法方程组，但所需的运算量更大些。

As an application, we also describe the Jordan automorphisms of the algebra of upper triangular matrices over commutative rings, and give a sufficient and necessary condition for a commutative ring being connected.

作为应用，我们还刻划了交换环上的上三角矩阵代数的Jordan自同构，并给出了一个交换环是连通环的充要条件。

Related models of its and operation and compositor of triangular fuzzy number are introduced.

建立了它的模型以及三角模糊数的排序、运算，用类似于解决前一种模型的方法进行转化和求解。

"Second Life is remarkably easy to work with, and is very popular,"

"第二次生命是显着容易的工作，并且很受欢迎，"

For example, we usually assume that materials are homogeneous and isotropic and free of internal defects or flaws.

为了得到适合有限元分析的模型，我们必须经过如图2所示的简化步骤。