High precision is achieved due to the inherence of the floating-point algorithm.
浮点算法使得系统具有较高的处理精度。
The fast point-by-point algorithm for generating rational parametric surfaces has important application in computer graphics.
有理参数多项式曲面的快速逐点生成算法在计算机图形学中有重要的应用。
Present a improved block floating point algorithm which solves the overflow in long point FFT effectively and improves precision.
采用了一种改进的块浮点算法，有效避免了溢出问题并且提高了精度。
This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized.
首先介绍了原-对偶内点算法的主要计算步骤，阐明哪一步上可以进行并行化处理。
A novel BSS algorithm is presented in this paper by combining the PDF estimation with the fixed-point algorithm.
提出一种估计激活函数的新方法，与盲信号抽取定点算法相结合，形成一种新的盲分离算法。
The traditional eight-point algorithm applied to two-view 3D reconstruction utilizes the standard Eigen Value Decomposition (EVD) algorithm.
传统的应用于双视图三维复原的八点算法使用标准特征值分析（EVD）算法。
Based on the critical point algorithm and zero-match algorithm, an improved algorithm for finding sample points of algebraic decomposition was proposed.
基于非线性多项式方程的零点配对算法以及临界点算法，给出了一种求平面代数剖分样本点的改进算法。
The mixture matrix of multi-path channel can be estimated using a fast fixed-point algorithm, and then the delay information of channel can be obtained.
该方法采用固定点ica算法来估计多径信道的混合矩阵，从而提取信道的延迟信息。
A new segment solution for solving load margin of AC/DC power system is proposed in this paper based on continuation method and interior point algorithm.
基于连续潮流法和原始一对偶内点法，提出了一种新的分段求解交直流系统负荷裕度方法。
A novel nonlinear multiple centrality corrections interior point algorithm is presented to solve optimal power flow problems of power systems in this paper.
提出了求解电力系统最优潮流问题新的非线性多中心校正内点算法。
This paper proposed the principle of the saddle point algorithm, discussed the developing method about the new solver, provided the flow chart and the computational results of the new solver.
阐述了线性规划鞍点算法原理，讨论了解题器各模块的设计方法，给出了软件流程图和实验结果。
In this paper we prove a convergence theorem of the proximate point algorithm for minimization of DC function, and propose a kind of inexact proximate point algorithm for the minimization problem.
本文证明DC函数最小化问题邻近点算法的一个收敛性定理，并对此问题提出一类非精确邻近点算法。
By using Newton direction and centering direction, we establish a feasible interior point algorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
On the Research of Primal-dual Infeasible Interior Point Algorithm for Box Linear Programming;
给出了二次锥规划的一种非精确不可行内点算法。
Finally, according to the bottleneck of Primal-Dual Interior-Point Algorithm, corresponding solution is given. And the application of this algorithm in the future is prospected.
最后还对原-对偶内点算法中的计算瓶颈做出了分析，给出了相应的优化解决方案，并展望了该算法的应用前景。
Finally, according to the bottleneck of Primal-Dual Interior-Point Algorithm, corresponding solution is given. And the application of this algorithm in the future is prospected.
最后还对原-对偶内点算法中的计算瓶颈做出了分析，给出了相应的优化解决方案，并展望了该算法的应用前景。
应用推荐