- 更多网络例句与条件收敛带相关的网络例句 [注：此内容来源于网络，仅供参考]
-
At last,we apply Tikhonov reg-ularization method with closed operators to solvc nonlinear ill-posed problems,undercertain conditions,we obtain optimal convergence rates of regularized solutions.At thesame time,we also discuss the case when the"attainability"condition is not satisfied.
最后我们应用带闭算子的Tikhonov正则化方法研究非线性的不适定问题，在一定的条件下得到了最优的收敛率，并讨论了当"可达性"条件不满足的情况下的正则化。
-
Firstly, convergence condition of a binomial is discussed, and along with the calculating formula of region of convergence, the matching band of fractance circuit attained by binomial expansion method is indicated definitely.
首先讨论了二项式的收敛条件，并结合收敛域的计算公式，明确指出使用二项展开法所得到的分抗电路的逼近带范围。
-
FR conjugate gradient methods with perturbations are proposed. The global convergence property of the first method is proved under the condition of main directions' sufficient descent. Whereas, in the proof of the convergence for the other two methods, we only need main directions' descent. Importantly and quite interesting, boundedness conditions such as objective function being bounded below, boundedness of level set are not needed. Chapter 5 presents a version of Dai-Yuan conjugate gradient method with perturbations.
在主方向充分下降的条件下证明了第一个方法的全局收敛性，而后两个方法的收敛性是在主方向下降的条件下证明的，这些收敛性证明的一个共同特征就是不需要目标函数有下界或水平集有界等有界性条件，第5章采用Wolfe或Armijo步长规则提出了带扰动项的Dai-Yuanabbr。
-
Given a finite training sample set, according to the proposal of establishing a Local Most Entropy probability density function to estimate the number of cluster a method for estimating 〓 is proposed, where a complicated method based on Maximum Likelihood Cross-Validation is replaced by Chebyshev inequality.
为改善BP算法的收敛速度慢、易陷入局部最小的问题，提出了带一类非线性特性动量项的变步长BP算法，构造了一个能自适应升降温的动量项非线性强度函数，在编程中又采用了有条件引入非线性特性动量项的措施，大大提高了搜索过程跳出局部极小、快速稳定收敛的能力。
-
Furthermore, the first-order optimality condition and its equivalent reformulations for generalized semi-infinite max-min programming with a non-compact set are presented using the lower-Hadamard directional derivative and subdifferential.2. Chapter 3 studies the gradient-type methods for unconstrained optimization problems. Section 1 proposes a new class of three-term memory gradient methods. The global convergence property of the method is established. Furthermore, in order to improve the convergence property of the method, a new class of memory gradient projection methods is presented with the property that the whole sequence of iterates converges to a solution to the problem under the conditions such as pseudo-convexity and continuous differentiability of objective function. In section 2, two new classes of methods, called gradient-type method with perturbations and hybrid projection method with perturbations, are proposed. In these methods, non-monotone line search technique is employed, which makes them easily executed in computer.
第3章研究了无约束优化问题的梯度型算法，第1节提出了一类新的三项记忆梯度算法，讨论了算法的全局收敛性，进一步提出了一类新的具有更好收敛性质的记忆梯度投影算法，并证明了该算法在函数伪凸的情况下具有整体收敛性，第2节在非单调步长搜索下提出了带扰动项的梯度型算法及其混合投影算法，这两类算法的一个重要特征就是步长采用线搜索确定而不象许多文献中那样要求步长趋于零，这样更容易在计算机上实现，在较弱的条件下证明了这些算法的全局收敛性，数值算例表明了算法的有效性。
-
Fourthly, Broyden iterative method is studied to solve nonlinear equation with parameters and the existence and convergence theorem is also given.
第四章的主要结果：研究用Broyden迭代求解带参数非线性方程，在弱条件下给出Broyden迭代格式的存在性和收敛性定理。
-
A proper k total colouring of a graph G is a colouring to its vertices and edges using k colours such that no two adjacent or incident elements of G may be assigned the same colour.
利用梯度投影与罚函数相结合的技巧，将带不等式和等式约束的优化问题化成一个无约束问题，提出了初始点可任意的求解不等式、等式约束优化问题的摄动梯度投影算法；参数δk取不同的数还可以得到一类梯度投影算法，从而得出了在搜索方向和步长不精确条件下的梯度投影法，保证了在实际应用中更容易实现；在较弱条件下，证明了该算法的全局收敛性。
-
Moreover, classical multigrid methods, such as W-cycle and Variable V-cycle, are shown to be convergent uniformly for this mortar type TRUNC element.
我们还用经典多重网格方法（可变的V-循环、W-循环）求解带mortar条件的TRUNC元解，证明所构造的网格转移算子满足收敛性条件，从而传统多重网格方法作预处理的条件数为一致有界。
-
By time-varying filtering, we realize the signal selectivity and interference suppression, especially for the signals with time-varying power spectrum. It is shown herein that conventional eigenstructure based methods are lower dimensional special case of the time-frequency subspace fitting method. The closed-form array response estimation algorithms for blind source separation in wireless communication is also developed in the dissertation by exploiting the data structure of second-order statistics of the array output in the presence of multipath. The proposed method achieves array response estimation with little constraint on signal property and propagation environment such as scatters or angular spread. Moreover, the array utilized here can be of arbitrary geometry and even uncalibrated. Since the closed-form solution is obtained, no misconvergency may occur and large amount of computation can be saved. The equivalent feed model and corresponding optimization designation are proposed to realize the downlink multi-user selective transmission. By coherent and non-coherent superposition of the electromagnetical field, multiple beams can be formed using a single array, so that each co-channel user signal is transmitted in each beam and will not interfered with each other. The proposed system scheme implements the digital beamforming and the channel allocation in the base band, therefore is suitable for the utilization of the radio software technology. The feasibility and effectiveness of the proposed model are proved by the RF experiment.
在窄带条件下，GSC－SSF方法还可以提高阵列的虚拟孔径，从而提高估计的性能；可以证明，Cyclic DOA 和SC-SSF方法可看作该方法的特例或近似； 3、提出了二维GSC－SSF方法和宽带谱相关DOA矩阵方法，利用信号的循环平稳特性解决了宽带条件下二维 DOA 估计问题，并具有阵元数少、计算量较小的特点； 4、提出了时频子空间拟合和宽带时频DOA估计算法，将联合时频分析的理论和方法引入到阵列信号的空间谱估计研究中，利用时变滤波实现信号选择性测向和干扰抑制，特别适合于谱时变信号；可以证明传统特征结构法可看作是时频子空间拟合方法的特例； 5、提出了多用户环境下阵列响应的估计方法——CARE方法，该方法对信号结构和传播参数（主要是散射源分布与角度散布）的约束较少，适用于各种几何结构的阵列甚至未校准的阵列，能够直接得到阵列响应的闭式解，因此计算量小、稳健性好，不存在收敛问题； 6、提出了针对多用户下行选择性发送的阵列等效激励模型、优化设计方法及其系统实现方案，通过空间场的相干叠加与非相干叠加使得单一阵列能够形成多个波束，并保证各波束内的用户信号各不相同且相互干扰最小；其系统方案具有在基带实现数字波束成形、信道分配并便于软件无线电实现的特点，其有效性已得到外场实测数据的证实。
-
It is proved that Newton iteration method is still quadratically convergent under a weak condition, and a new point is added to Newton s method , i.
本文讨论求解非线性方程的牛顿法，证明牛顿法在一个弱条件下仍保持局部二阶收敛性，给出牛顿法的一点改进，即一个不带导数的单参数的二阶收敛的迭代法，而且分别得到这两种迭代法的收敛因子，最后进行数值实验
- 更多网络解释与条件收敛带相关的网络解释 [注：此内容来源于网络，仅供参考]
-
strip of conditional convergence：条件收敛带
strip 带 | strip of conditional convergence 条件收敛带 | strip region 带形区域
-
strip of convergence：收敛带
11564,"strip manifold","带流形" | 11565,"strip of convergence","收敛带" | 11566,"strip of conditional convergence","条件收敛带"
-
strip region：带形区域
strip of conditional convergence 条件收敛带 | strip region 带形区域 | strong component 强分支