- 更多网络例句与收敛速率相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Our calculation shows that qa decreasing with the simulationtime can accelerate the convergence significantly,which is somehow similar tointroducing different temperatures for visiting and acceptance probability.
为了增加收敛速率，让原来固定不动的qa随计算机时间作线性下降，对粒子数N＝12，51的Thomson问题的测试表明我们的改进效果是很明显的。qa随计算机时间作线性下降类似于对接收几率引入了单独的温度，这个温度不同于跃迁温度。
-
Its global convergence and linear convergence rate were proved under some mild conditions.
提出一类新的求解无约束优化问题的记忆梯度法，在较弱条件下证明了算法具有全局收敛性和线性收敛速率。
-
We prove general convergence and local convergence of this algorithm.
第四章证明了对偶算法的全局收敛性和局部收敛速率。
-
This method has the advantage of the well-known Newton's method, considered by, thus it does not need to solve linear equations.
3.4.6分别给出了它在各种条件下的收敛性的证明，并估计了收敛速率。
-
Based on it, a new efficient implementation of preconditioned conjugate gradient is put forward to solve the Gauss-Newton equation and save the cost on computation with the same exactly quadratic convergence to the traditional choleski factorization.
新算法与传统的使用Choleski技术的Gauss-Newton法具有相同的收敛速率，但在求解 Gauss-Newton方程组时减少了代数运算的计算量。
-
When the diffusion matrix is symmetric and locally uniform positive definite, we prove that the solution tends to the thermal equilibrium state exponentially in L〓 norm and relative entropy.
当扩散矩阵对称且局部一致正定时，利用熵方法证明了其解在L〓或相对熵意义下指数衰减到热平衡状态，并且能明确的计算出收敛速率。
-
In the paper, the methods above are studied for element solve singular problems the convergence of the method is proved and the error estimate is also obtained.
本文将讨论零空间为一维情况下Chebyshev 方法求解奇异问题的收敛性，得到了相应的渐近收敛速率。4。
-
Thirdly, under the condition with noαpriori smoothness, in order to obtain the optimal convergence rates, it is not practical to use theαpriori rule. And it is necessary to use the a posteriori stopping rule which not only depends on the error boundδbut also on the perturbed data y~δ.
再次，在没有先验的光滑性信息情况下，为了获得最优收敛速率，利用先验选取准则则变得不再实用，而利用不仅依赖于误差界δ而且依赖于扰动数据y~δ的后验停止准则是必要的。
-
The convergence rate and stational error of the proposed algorithm are compared with those of other constant modulus algorithms by computer simulation.
在最后的数据仿真中，与基本CMA等算法在收敛速率、稳态误差等方面进行了对比分析，验证了新算法的有效性。
-
Simulation results indicate that this method is effective,multiwavelet neural network converges more rapidly than wavelet neural network.
仿真结果表明，该方法是有效的，而且比小波神经网络方法的收敛速率快。
- 更多网络解释与收敛速率相关的网络解释 [注：此内容来源于网络，仅供参考]
-
asymptotic rate of convergence：渐近收敛速率
渐近[收]敛速[率] asymptotic rate of convergence | 渐近关系 asymptotic relation | 渐近表示 asymptotic representation
-
computational complexity：计算复杂度
关键词: 模拟并了解实际无线通道空间特徵(Spatial Signature),不单能有效提升智慧型天线信号处理的效率:如加快处理收敛速率(Rate of convergence)、减少计算复杂度(Computational complexity)及提高其强健性(Robustness),同时也能提升系统容量及效能的评估准确度.
-
instantaneous：瞬时
本论文中,假设所有使用者的展频序列(spreading sequences)都事先已知,我们提出一个基於瞬时(instantaneous)多输入多输出信号模型的多速率盲蔽多用户检测演算法(结合单一或多接收天线),此演算法享有快速峰度最大化演算法的超指数收歛速度以及保证收敛之优点.
-
linear convergence rate：线性收敛速率
线性收敛|linear convergence | 线性收敛速率|linear convergence rate | 线性算子|linear operator
-
Quadratic loss function：平方损失函数
平方收敛速率|quadratic convergence rate | 平方损失函数|quadratic loss function | 平衡测度|equilibrium measure
-
quadratic convergence rate：平方收敛速率
平方取中方法|mid-square method | 平方收敛速率|quadratic convergence rate | 平方损失函数|quadratic loss function
-
rate of convergence：收敛速率
关键词: 模拟并了解实际无线通道空间特徵(Spatial Signature),不单能有效提升智慧型天线信号处理的效率:如加快处理收敛速率(Rate of convergence)、减少计算复杂度(Computational complexity)及提高其强健性(Robustness),
-
average rate of convergence：平均收敛速率
平均收敛|convergence in mean | 平均收敛速率|average rate of convergence | 平均误差|mean error
-
superlinear convergence：超线性收敛
超限直径|transfinite diameter | 超线性收敛|superlinear convergence | 超线性收敛速率|superlinear convergence rate
-
superlinear convergence rate：超线性收敛速率
超线性收敛|superlinear convergence | 超线性收敛速率|superlinear convergence rate | 超有界型空间|ultrabornologic space