A local LU factorization method was proposed to solve pressure equation for mold filling in injection molding and was compared with iterative methods.
提出了一个LU局部分解方法来求解注射充模过程的压力方程，并与其他迭代方法进行了比较。
An LDPC code encode algorithm based on the new LU factorization was proposed., which was used for arbitrary H matrix.
在研究CMMB标准中编码器设计时，提出一种改进的LU分解算法，该分解方式适合任意的H矩阵，具有一定的广泛性。
Based on the discussion of displacement struture, we describe the properties of inversion formulas and the factorization forms, and give an fast algorithm for the paired Cauchy matrix based on LU factorization.
并在深入探讨位移结构性质的基础上推广出相关的逆矩阵的性质与因式分解的性质。
The inverse function module based on the parallel and efficient systolic array structure uses the LU factorization of the matrix inversion method.
求逆功能模块基于并行、高效的心动阵列结构，采用上下三角分解求逆法。
This module is composed of three part series: LU factorization module, triangular matrix inversion module and matrix multiplication module.
它由LU分解模块、三角矩阵求逆模块和矩阵乘积模块串联组成。
Blocked LU factorization and blocked triangular matrix computation are used to combine the predictor-corrector process with decomposed KKT system.
算例结果表明预测——校正解耦内点法在迭代次数和计算时间等方面的性能优于原对偶解耦内点法。
The calculation method is based on node admittance matrix equation and takes LU factorization algorithm.
运行仿真基于节点导纳矩阵方程的迭代求解，采用了LU三角分解法。
The calculation processes of the methodology include partitioning network into several sub-networks, calculating the load flow of sub-networks and boundary nodes by LU factorization, carrying out corrective control according to the messages of violated limits of the load flow that are exchanged among processes, and accumulating finally reliability indices.
其特点是把系统划分为几个子网络；用LU分解法计算子网络和边界节点的交流潮流；根据进程间交换的潮流违限消息进行直流潮流校正控制；最后计算可靠性指标。
The calculation processes related to the methodology include partitioning network into several sub-networks, calculating the AC load flow of these networks with boundary nodes by LU factorization, carrying out corrective control according to the messages of violated limits revealed from the load flow, and finally, accumulating reliability indices of the concerned system.
其特点是：把系统划分为几个子网络；用LU分解法计算子网络和边界节点的交流潮流；根据进程间交换的潮流违限消息进行校正控制；最后计算可靠性指标。
The Incomplete LU Factorization Preconditioner is derived by Gaussian elimination and dropping some elements with any kind of dropping strategy. This method is very widely used to solve the linear equations.
不完全LU预处理是通过高斯消元法将矩阵进行三角分解，丢掉部分元素而得到预条件子，这种预条件方法通用性强，已被广泛的应用到工程计算中去。
The investigation is based on three methods: the twisted factorization、LU factorization of tridiagonal matrix and expression the block inverse matrix with four block column vectors. And then three simple algorithms are derived.
分别基于块三对角矩阵的绞形分解、块LU分解和基于用四个分块的列向量表示块逆矩阵三种方法进行了研究，得到三个简单算法。
The traditional methods are to solve the linear algebra equations directly, based on matrix factorization such as LU decomposition.
解线性代数方程组的传统方法是利用LU分解等直接求解，虽然传统方法具有理论上直接得到真解的优点，但当系数矩阵条件数很大时，存在严重的稳定性问题。
Using elementary symmetric function and complete symmetric function, two kinds generalized Vandermonde matrices are introduced. The relationship between Vandermonde matrices and the generalized Vandermonde matrices is discussed, and the LU factorization of the generalized Vandermonde matrices is obtained.
利用对称函数引入了两种广义Vandermonde矩阵，讨论了Vandermonde矩阵与广义Vandermonde矩阵之间的关系，并得到了广义Vandermonde矩阵的LU分解。
In matrix solution algorithms, direct methods and iterative methods cannot efficiently solve large-scale sparse or ill matrix. This paper presents a strategy that combines LU factorization and iterative methods.
在矩阵求解算法中，直接法或迭代法都不能有效地求解大规模稀疏或病态矩阵，因此提出一种LU分解与迭代法结合的策略。
Based on the orthogonal list, the special technique of only storing non-zero elements is carried out. The incomplete LU factorization without fill-ins is adopted to reduce the condition number of the coefficient matrix.
利用二维正交链表结构实现系数矩阵的全稀疏存储，采用无填充的不完全LU分解对方程组进行预处理以降低系数矩阵的条件数。
Large numbers of experiments show that the combination strategy is effective, and the two algorithms have better performance and convergence than LU factorization and conjugate gradient method.
大量实验结果表明此结合策略是很有效的，得到的两种算法具有较快的速度和较好的收敛性。
In MDF the equation systems are formulated by using the nodal method, the ordinary differential equations are solved by the method of implicit-variable-step-size integration, the nonlinear algebraic systems are solved by the improved Newton-Raphson method and LU factorization.
MDF采用了节点法列方程，用隐式变步长的积分技术求解常微分方程组，用改进的牛顿&拉夫森方法及LU分解求解非线性代数方程组。
The Navier Stokes equations are solved by using the LU SGS factorization technique.
Navierstokes方程求解采用LUSGS分解技术。
The paper presents an elimination approach to the oriented graph which is used to reorder the structure of the asymmetric sparse-matrix according to the rule of minimal fills or minimal long operations in LU factorization.
本文提出在LU分解中按填入数最少原则（或按长运算次数最少原则），对结构不对称稀疏矩阵[A]进行重排序的一种方法&有向图消去法。
According to parallel algorithm theory, the existing matrix inversion algorithm is compared. At the same time, based on block LU factorization, a matrix inversion algorithm with a high parallelism is selected, as well as exploring its parallel algorithm. 3.
根据并行算法的理论，比较多种已有的矩阵求逆算法，选出一种并行度较高的基于块LU分解的矩阵求逆方法，挖掘其并行能力。