您要查找的是不是：
- It does not use the aux-iliary remedy of solving linear programming. 算法不再使用求解线性规划的辅助措施。
- In the elimination method of solving linear equations,pivot in an elimination step is a element with maximum-mod. 在解线性方程组的消元法中，主元素指在某步消元时模最大的那个元素。
- In the elimination method of solving linear equations,pivot in an elimination step is a element with maximum - mod. 在解线性方程组的消元法中，主元素指在某步消元时模最大的那个元素。
- In the elimination method of solving linear equations, pivot in an elimination step is a element with maximum-mod. 在解线性方程组的消元法中,主元素指在某步消元时模最大的那个元素。
- This paper presents a determined global optimization algorithm for solving linear fractional programming. 摘要针对分式规划问题的求解，给出一个确定性全局优化算法。
- After the free weights are preassigned，the new algorithm can find the target weights of the other layer by solving linear equation sets. 新算法不再采用误差反向传播原理，而是选择一层自由权，通过求解线性方程组求得另一层待求权。
- Based on the merit function, a new conjugate gradient algorithm for solving linear inequalities system problems was proposed. 利用这个价值函数，提出了求解线性不等式组问题的一种新的共扼梯度算法。
- The paper draws into convertional mathematical technique using linear equation to express structure between Web pages and solving linear equation to give PageRank of Web page. 引入传统的数学方法:线性方程组表示页结构之间的关系及通过求解齐次线性方程组来计算页的的键值。
- The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system. 内点法是一种求解线性规划问题的多项式时间算法,其显著特征是其迭代次数与系统规模关系不大。
- In this paper an approximation method is given for solving linear moment problem. Numerical examples of B-spline function are given to show that this method is efficient. 给出一种求解线性矩问题的逼近方法,并给出以B样条函数为基的数值例子,证明了该方法的有效性。
- Classical algorithms fof solving linear complementary problem are iteration method.A direct algorithm is investigated for linear complementary problem in this paper. 摘要经典算法一般采用迭代过程求解线性互补问题，研究了线性互补问题的直接求解方法。
- In this paper the saddle-point approximation algorithm is modified and the iteration formula and its pratical realization are given for solving linear programming problems. 本文修正了鞍点逼近算法，给出一个求线性规划最优解的迭代方法和具体实现；
- We use anisotropic bilinear finite element to solve linear parbolic problem. 给出各向异性双线性元的插值能量模和零模估计。
- An algorithm for solving linear equations, the paper shown strong Stability algorithms on the class of non-singular symmetric matrices and on the class symmetric positive definite matrices. 摘要关于线性方程解的算法方面，本文在对称非奇异矩阵类和对称正定矩阵类上给出了强稳定性算法。
- Based on the sufficient condition and the consideration of an equality constraint, the continuously dynamic output feedback controller was easily constructed for solving linear matrix inequalities. 根据此充分条件，给定一个等式约束，然后通过求解一组线性矩阵不等式，获得了连续动态输出反馈镇定控制器。
- The perceptron can only solve linearly separable problems. 感知机只能解决线性可分问题。
- Undemanding to solve linear system of equations, making use of FFT, the approach is simple and efficient. 由于该方法不需求解线性方程组，可使用快速傅里叶变换，因此具有简单、快速的特点。
- In order to solve linear programming problems, simplex method with bisection carries out pivoting operation on a series of sub-program. 二分单纯形算法中,线性规划问题的最优解是通过求解一系列子问题来实现的。
- Have another crack at solving this puzzle. 再试一试把这个难题解决了吧。
- A New Method for Solving Linear Inequalities 求解线性不等式组的方法
