1) wide-neighborhood
宽邻域
1.
A wide-neighborhood predictor-corrector algorithm for convex quadratic programming;
凸二次规划的一种宽邻域预估-校正算法
2.
A wide-neighborhood predictor-correcting algorithm for linear programming
线性规划的宽邻域预估校正算法
3.
A wide-neighborhood primal-dual interior-point algorithm based on reduced potential function for convex quadratic programming with box constrains
框式凸二次规划宽邻域原始-对偶势下降内点算法
2) wide neighborhood
宽邻域
1.
A wide neighborhood high-order interior-point algorithm for solving p_*(κ) matrix linear complementarity problems is put forward.
对p*(κ)线性互补问题提出了一种高阶宽邻域内点算法,在算法的每步迭代过程,基于线性规划原始-对偶仿射尺度算法的思想来求解一个线性方程组得到迭代方向,在适当选取步长,得到算法的多项式复杂性。
2.
In this paper,a high order interior point algorithm for P(K)-matrix linear complementarity problem in a wide neighborhood of the central path is concerned.
本文研究了P*(K)-阵线性互补问题宽邻域高阶内点算法。
3) wide-neighborhood interior point
宽邻域内点算法
1.
An algorithm of wide-neighborhood interior point for a class of non-monotonic linear complementary problems;
一类非单调线性互补问题的宽邻域内点算法
4) wide-neighborhood predictor-correcting algorithm
宽邻域预估校正算法
1.
A new interior point wide-neighborhood predictor-correcting algorithm for a class of nonmonotonic linear complementarity problem is presented.
对于一类非单调线性互补问题给出了一种新的内点算法-宽邻域预估校正算法,算法基于精典预估校正思想,把窄邻域拓展到一个宽邻域里使得算法更快地迭代,讨论了其算法的计算复杂性,并给出了数值实验。
5) wide-neighborhood path-following method
宽邻域路径跟踪法
6) wide-neigh-borhood path-following algorithm
宽邻域路径跟踪算法
补充资料：超导电性的局域和非局域理论（localizedandnon-localizedtheoriesofsuperconductivity）
超导电性的局域和非局域理论（localizedandnon-localizedtheoriesofsuperconductivity）
伦敦第二个方程（见“伦敦规范”）表明，在伦敦理论中实际上假定了js(r)是正比于同一位置r的矢势A(r)，而与其他位置的A无牵连；换言之，局域的A(r)可确定该局域的js(r)，反之亦然，即理论具有局域性，所以伦敦理论是一种超导电性的局域理论。若r周围r'位置的A(r')与j(r)有牵连而影响j(r)的改变，则A(r)就为非局域性质的。由于`\nabla\timesbb{A}=\mu_0bb{H}`，所以也可以说磁场强度H是非局域性的。为此，超导电性需由非局域性理论来描绘，称超导电性的非局域理论。皮帕德非局域理论就是典型的超导电性非局域唯象理论。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条