查询词典 sparse matrix

Missirlis in article [1]. At the same time, a sufficient condition for convergence of the PSD method is given to be compared when the coefficient matrix A of the linear system Ax = b is a symmetric, positively defective matrix. In §3.2, an example is given to state that the range of our sufficient condition is wider than theorem 3.3 of article [1]. On the other hand, following a.n analogous approach of [14] and starting the functional relationshipwe have a perfect analysis for the PSD method to converge and optimum valves for the involved parameters under different conditions.Under the assumptions that A is a consistent ordered matrix with nonvanishing diagonal elements and the eigenvalues of the Jacobi matrix of A are real,we get necessary and sufficient conditions for the PSD method to convergence.The result is equal to theorem 1 of article [9].Under the same condition, we can see the optimal parameter and of corresponding spectral radius of thePSD method in [8]:(2)When A is a consistent ordered matrix with nonvanishing diagonal elements and the eigenvalues of the Jacobi matrix of A are imaginary or zero,we get necessary and sufficient conditions for the PSD method to convergence.In chapter 3, the optimal parameter and of corresponding spectral radius of the PSD method are given by table 3.3. Moreover, under the assumption 0

Missirlis在文献[1]中定理3.3的不准确，同时给出了当线性方程组Ax=b的系数矩阵A为对称正定阵时，PSD迭代法收敛的一个充分条件与之比较，并且在§2.3中用实例说明了对于一部分矩阵而言本文得到的充分条件广于[1]中定理3.3的充分条件；另一方面，按照文献[14]的方法，我们从PSD迭代法的特征值λ与其Jacobi迭代矩阵B的特征值μ的关系式：出发，在不同条件下对PSD迭代法的收敛性和最优参数以及最优谱半径进行了完整的分析：(1)在系数矩阵A为(1，1)相容次序矩阵且对角元全不为零，其Jacobi迭代矩阵B的特征值全为实数的条件下，给出了PSD迭代法收敛的充分必要条件，此结果与[9]中的定理1等价，此时最优参数及最优谱半径由[8]得：(2)第三章表3.3中给出了，当系数矩阵A为(1，1)相容次序矩阵且对角元全不为零，其Jacobi迭代矩阵B的特征值全为纯虚数或零时的PSD迭代法的收敛范围和最优参数，并且我们可以得到当0

The method for constructing LDPCC code includes encoder and decoder. Operational steps include as following: determining parameters of checkout matrix HQT of group code of permutation unit matrix LDPC; constructing checkout matrix HQT of group code of permutation unit matrix LDPC; constructing checkout polynomial matrix HT of LDPCC code; exporting generated matrix G of LDPCC code.

一种LDPCC码的构造方法，包括编、译码器，运行的步骤包括：初始化的步骤；确定一个置换单位矩阵LDPC分组码的校验阵HQT的参数的步骤；构造置换单位矩阵LDPC码校验阵HQT的步骤；构造LDPCC码的校验多项式矩阵HT的步骤；导出LDPCC码的生成矩阵G的步骤。

The method according to claim 6, for manufacturing a blade wherein a part external to the shell comprises a blade rooting part having at least one attachment bar, in which an end portion for linkage to a hub of said rotor is fitted with a laminate attachment, also comprising thermoplastic composite, and extending said at least one spar bar housed in the shell, the method further comprising the step of producing the elementary piece comprising the at least one spar by producing each attachment bar and the spar bar in the form of a strip of continuous and unidirectional reinforcing fibres which are agglomerated by said thermoplastic matrix, obtained by pultrusion at a melting temperature of the matrix, of several plies of continuous and unidirectional fibres which are agglomerated by said matrix, and, if said rooting part comprises at least two attachment bars, each one of which respectively extends one spar bar, in superimposing parts of corresponding strips forming the spar part housed in the shell, with interposition of at least one ply of continuous and unidirectional fibres which are agglomerated by said matrix between the adjacent superimposed strip parts, and fitting a removable tool, in the shape of a wedge, between parts held spaced from each other of two neighbouring strips, to form two attachment bars of the rooting part, then arranging the strips in a mould, and inserting each linkage end portion of a pultruded strip between two laminate elements of the attachment, to superimpose all the laminate elements of the attachment, closing the mould and compacting its contents under pressure and at a melting temperature of said thermoplastic matrix, and solidifying the matrix by cooling to rigidify the spar thus obtained with the laminate attachment solidly attached to its rooting part.

该方法根据索赔六，制造业刀片其中的一部分，罐壳外部包括一个叶片生根的一部分，拥有至少一个实习酒吧，在其中一结束部分为联系枢纽的说，转子是带有附件的层压板，也包括热塑性复合材料，并延长说，至少有一石酒吧住在蚬壳公司，进一步组成的方法步骤，生产初级一块组成的至少有一个SPAR公司生产每个附件的酒吧和酒吧在SPAR公司的形式，带不断加强和单向纤维是由烧结说，热塑性矩阵，得到的拉挤在熔化温度矩阵，数层的连续和单向纤维是由烧结说，矩阵，如果说，生根部分组成，至少有两个实习酒吧，每个人都分别延长一石酒吧，在叠加部分，相应的带形成的SPAR公司的一部分，居住在蚬壳公司，与干预的至少有一单层连续和单向纤维是由烧结说，矩阵之间的毗邻叠加条形零件，及装修一个可移动的工具，在形状，离间，部分之间举行的间隔从对方的两个邻国带，形成两个附件酒吧的生根部分，然后安排带在一个模具，并插入每个联系年底部分一拉挤带之间的二板的要素扣押，叠加所有层压板的要素扣押，关闭模具和压缩其内容的压力下和在熔化温度说，热塑性矩阵，并巩固矩阵冷却 rigidify该SPAR公司，从而获得与层压板的附着牢固重视其生根的一部分。

Due to its sparse features, through sparse matrix compression can greatly reduce memory costs ...

由于 其自身的稀疏特性，通过压缩可以大大节省稀疏矩阵的内存代价。。。。

In this paper, firstly the elimination tree theory is introduced in brief, and the structure of Jacobian matrix is determined by use of symbolic factorization; then by use of sparse vector method each column of lower triangular matrix L and each row of upper triangular matrix U are solved.

介绍了消去树理论，并采用符号因子分解技术确定雅可比矩阵的结构，然后采用稀疏向量法求取L阵的每行和U阵的每列。

FMA decreases the computation complexity from O to O by decomposing the dense matrix in Moment Method into the combination form of four sparse matrix—Near interaction, Aggregation, Translation and Deaggregation matrix.

本文严格推导了二维和三维快速多极算法的各步骤，并根据其稀疏矩阵形式，讨论了该算法的计算量和存储量；提出了获得该算法众多参数选取规则的新途径，在理论上丰富和发展了该方法。

To solve the second problem, an approach of irregular QC LDFC codes is proposed. The proposed approach is to replace some sub-matrices by zero matrices and identity matrices at special positions in the given sparse parity-check matrix so as to get a nonsingular square matrix for the construction of the generator matrix.

为解决第二个问题，提出一种不规则准循环LDPC码的设计方法，该方法将校验矩阵中的特定位置的子矩阵用零矩阵和循环矩阵置换，获得一非奇异方阵，用于构造生成矩阵。

Although the parity check matrix is defined by very sparse matrix, the generator matrix is not.

尽管LDPC码的校验矩阵是非常稀疏的，但它的生成矩阵却并不稀疏，这使得其编码复杂度往往与其码长的平方成正比。

The original PageRank algorithm uses the Power Method to compute successive iterations that converge to the principal eigenvector of the Markov matrix representing the Web link graph.Authors use the sparse of the Google matrix P in the iterative matrix A =[ CP +（1- c ） E ]T,optimize the computation of each iteration and reduce storage space.

在PageRank算法中是使用乘幂法对网络链接图的Markov矩阵进行迭代计算，利用迭代矩阵 A =[ CP +（1- c ） E ]T中Google矩阵 P 的稀疏性，优化每次迭代的计算量并且减少空间存储量。

the fast transposition algorithm to sparse matrix expressed by triple list is introduced.this algorithm needs to determine the position in the transposed matrix position of the first element which is not equal to zero in the original matrix each row,it uses two arrays as auxiliary space.in order to reduce the auxiliary space which the algorithm needed,an improvement is made through introducing two simple variables.the improved algorithm saves a half auxiliary space compared to the original algorithm at the same time complexity.

摘 要：介绍基于三元组表表示的稀疏矩阵的快速转置算法，此算法在转置前需要先确定原矩阵中各列第一个非零元在转置矩阵中的位置，在此使用2个数组作为辅助空间，为了减少算法所需的辅助空间，通过引入2个简单变量提出一种改进算法。该改进算法在时间复杂度保持不变的情况下，空间复杂度比原算法节省一半。

"The operators will suffer a temporary decrease in the number of consumers and short message services as people may not like having to provide their ID cards for a phone number," Xu Junqi, vice-dean with the Policy-Making Institute of the Telecommunications Research Centre under MII, said yesterday.

信息产业部下属的通信决策研究院副主任徐俊其昨天说：&实行手机实名制后，人们可能不太情愿用身份证注册手机号，所以通信运营商会暂时面临用户减少和短信用户减少的问题。&

I don't believe in make-believe!

我不相信这些虚构的故事。