本文讨论了一类抛物型变分不等式的近似收敛问题。
A convergence estimate and approximation for a kind of parabolic variational inequality is discussed.
本文讨论了一类抛物型变分不等式的近似收敛问题。
This paper discusses a class of degenerate linear parabolic differential inequations.
随后我们提出了求解这类概率约束随机规划的一种近似算法，并在一定的条件下证明了算法的收敛性。
And then, we present an approximation method for solving this probabilistic constrained stochastic programming, and prove certain convergence of the method under some conditions.
本文指出，在矩阵迭代法的迭代过程中，特征值近似值序列是单调收敛的，并给出计算实例。
This paper indicated that the sequence of approximate value of eigenvalue is monotone convergent in the iteration process of matrix iteration method. And also gave examples.
使用近似不动点技术，采用摄动迭代方法，目的是证明利普希茨伪紧缩映射序列的收敛性。
The object is to introduce a perturbed iteration method for proving the convergence of sequence of Lipschitzian pseudocontractive mapping using approximate fixed point technique.
数值计算表明本文数值方法是一种高效和收敛的近似方法。
Some numerical examples are given to show that the numerical method presented is an approximation method with high efficiency and convergence.
该方法能实现规划问题的全局优化，有效地收敛到最优解或近似最优解。
This method can achieve overall optimization of the programming and effectively converge to the optimal solution or approximate optimal solution.
迄今为止，除了少数未从数学上严格证明其收敛性的精确解外，大多数均采用近似方法求解。
So far many approximate methods have been used to solve the large deflection problems except that only a few exact solutions have been investigated but no strict proof on convergence is presented yet.
本文证明了，当投影空间足够好时，该方法得到的近似奇异值收敛，但近似奇异向量可能收敛很慢甚至不收敛。
It is proved that for sufficiently good subspaces the approximate singular values obtained by the harmonic projection methods converge while the corresponding approximate singular vectors may not.
配置法是以满足纯插值约束条件的方式，寻求算子方程近似解的方法，且具有无需计算数值积分、计算量小、收敛阶高等优点。
The collocation method is a numerical method which search for the approximate solution of the equation by way of meeting pure interpolation condition.
再次，通过前面所证明的结论得出近似核的效用收敛到需求集的效用；
Thirdly, we make the conclusion that the utility of the approximate core allcations convergences to the utility of demand set.
利用这种等价性，构造了一些新的扰动近似点算法，并证明了由此算法所产生的迭代序列的收敛性。
Using this equivalence, we construct some new perturbed proximal point algorithms and prove the convergence of iterative sequences generated by the algorithms.
结果表明，对于势变化趋势的缓慢情形，这种近似求解结果可靠，收敛良好。
This approximation is reliable and the convergency is also good under mild potential change.
本文应用比较方法，提出滞后型泛函微分方程初始问题的近似解法，给出了解的近似迭代序列及其误差估计式，并证明迭代序列的收敛性和计算稳定性。
Using the comparison method, an approximate approach to the delay-differential equations is proposed in this paper. The proof of its convergence and calculation stability is also given.
本文主要致力于支持向量机、近似支持向量机的学习算法研究，特征提取的数学模型与算法的改进及其应用，聚类分析算法的收敛性证明。
This paper's main works is that: learning algorithm studies of support vector machine, mathematical model and application about feature selection, convergence analysis of clustering algorithm.
给出了热传导方程边界控制问题的精确解和近似解，证明了近似解对精确解的收敛性。
In this paper, the exact solution and approximate solution of the boundary control problem for a class of the heat-conduction equation are given.
提出了小波函数和普通函数内积数值计算的外推加速算法，给出了外推加速算法的可行性保障定理。结果表明此算法的收敛速度较快， 得到的近似值的逼近效果较好。
In this paper, we give an extrapolation method for integral with wavelet. Theorem can ensure it is possibility. The result show that the method converge quickly, and the approach effect is very good.
如果节点在求解区域内互异而且稠密，则近似解一致收敛到精确解。
If the grid points are different and dense in the interval of the solution, then approximate solution is convergent uniformly to the exact solution.
六角形节块内的中子通量密度分布采用高次多项式近似表示，最后导出通量矩方程及偏流的响应矩阵方程。应用粗网再平衡和渐近源外推方法加速收敛。
The nodal equations and response matrix equations are derived using higher order polynomial approximations to the spatial dependence of the flux within the hexagonal-z node.
本文提出了一个应用计算机的迭代求解法，并讨论了它的收敛性和采用有限维近似的问题。
In this paper, we give an iterative method of computation to resolve this problem. The convergence of the method and the problem in relation to finite dimension approximation are discussed.
给出求解单调变分不等式问题的一个近似邻近点算法，在不需要任何中间步骤的条件下证明算法的收敛性。
This paper presents a approximate proximal algorithm finding the zero of a maximal monotone operator in Hilbert space, whose error criterion is weaker than that in the literatures.
给出求解单调变分不等式问题的一个近似邻近点算法，在不需要任何中间步骤的条件下证明算法的收敛性。
This paper presents a approximate proximal algorithm finding the zero of a maximal monotone operator in Hilbert space, whose error criterion is weaker than that in the literatures.
应用推荐