查询词典 best approximation

The zonal translation networks on the unit sphere is constructed with the best approximation of spherical harmonic polynomials and the Riesz means. The Jackson theorem of approximation by such kind of zonal translation is established.

借助于球调和多项式的最佳逼近多项式和Riesz平均构造出了单位球面S上的带形平移网络，并建立了球面带形平移网络对LS(上标 q中函数一致逼近的Jackson型定理。

By the best approximation theory, it is first proved that the SISO (single-input single-output) linear Takagi-Sugeno fuzzy systems can approximate an arbitrary polynomial which, according to Weierstrass approximation theorem, can uniformly approximate any continuous functions on the compact domain.

借助于最优逼近理论，证明了线性SISO TS模糊系统可以逼近任意一个多项式，然后以Weierstrass逼近定理为桥梁，证明了该模糊系统可以以任意精度逼近一个任意的连续函数，从而得到了该模糊系统万能逼近性的一个新的充分条件。

In order to ensure that we obtain the best approximation, we take all possible combinations.

为确保我们获得最佳接近值，我们要考虑所有可能的组合。

As a concrete Banach space, it is applied in best approximation, and optimal control problems.

所以，对Orlicz空间几何性质的研究就显得比较重要。

Since the remainder is more than half of 10, the best approximation is obtained by rounding up

因为余数大于10的一半，最好的逼近方法是由上界逼近

Let's try out the best approximation then: a plane.

让我们来试试比较好的近似方法：一个平面。

On the basis of this, we have chiefly investigated the problem of best approximation by polynomials in two variables.

在这个基础上，我們着重地研究了二元多項式的最佳逼近問題。

ANN can make the best approximation of the actual problems through a large number of learning and training.

人工神经网络方法通过大量的样本学习和训练，能够对实际问题进行最佳逼近。

Since the remainder is more than half of 10, the best approximation is obtained

因为余数大于10，最好的逼近方法是由上界逼近

In chapter three, we prove that there exist solutions to the Ky Fan variation inequality, as the set-valued mappings are defined on spheres in infinite dimensional Banach spaces or odd dimensional Euclidean spaces, following from these theorems, we obtain some fixed point theorems for set-valued mappings defined on a sphere. When G is an approximate compact convex subset of E, or G is a almost quasi-convex set-valued mapping, we prove that there exist solutions to and type generalized Ky Fan variation inequality, following these theorems, we prove several best approximation theorems and coincidence theorems involving two set-valued mappings and two different spaces. In chapter four, we first present a new Simplicial algorithm for computing the Leray - Schauder fixed points, the algorithm can solve the set-valued nonlinear complementarily problem. We give a condition to guarantee the computation proceeding in a bounded region. We present integer-labeling algorithms for computing fixed points of some set-valued mappings, the best approximation points and solutions to a kind of set-valued variation inequalities.

第四章给出了计算定义在非凸集上的非自映射的Leray-Schauder不动点的算法，而现有的不动点算法都是计算凸集的上半连续集值自映射的不动点；给出了保证计算有界的一个充分条件，我们的条件大大弱于Mdrrill条件，我们的算法也可用来计算Eaves不动点；给出了集值非线性互补问题存在解的一个充分条件，此时可利用Leray-Schauder不动点算法来求解；向量标号算法以往是计算集值映射不动点的唯一有效算法，我们给出用整数标号算法计算一类集值映射的Kakutani 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

In the United States, chronic alcoholism and hepatitis C are the most common ones.

在美国，慢性酒精中毒，肝炎是最常见的。

If you have any questions, you can contact me anytime.

如果有任何问题，你可以随时联系我。