matching theorems

matching theorems的基本解释

-

匹配定理

与matching theorems相关的网络例句 [注：此内容来源于网络，仅供参考]

Chapter one has introduced the background and classification of minimax theorems; Chapter two summarizes several proof method of minimax theorems, which are illustrated with examples; Chapter three has explained the development general situation of minimax theorems for a function and for two functions with chapter four respectively, and according to the classification of the theorem, has illustrated some important conclusionses in quantitative minimax theorems, topological minimax theorems and quantitative-topological minimax theorems separately.

第一章介绍了极大极小定理的背景及其分类；第二章总结了极大极小定理的几种证明方法，并举出例子进行说明；第三章和第四章分别阐述了单函数的极大极小定理和两个函数的极大极小定理的发展概况，在第三章中，按照极大极小定理的分类，分别对数量极大极小定理，拓扑极大极小定理和数量拓扑极大极小定理的一些重要结论作了介绍。

On the base of finishing image matching, Aiming at the fact that sequence image matching and binocular stereo image matching simultaneously exists in three dimensions movement analyses based on point feature, The method of double matching restrict combining sequence and stereo image matching is brought forward in matching distinctness stage after researching and anglicizing the character of sequence matching and stereo image matching in processing.

在完成图象匹配的基础上，针对基于点特征的三维运动分析中，同时存在序列、立体图象匹配问题，研究分析该过程不同匹配的特点，提出了序列、立体匹配相结合，分阶段的双匹配约束方法。

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 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

与matching theorems相关的网络解释 [注：此内容来源于网络，仅供参考]

matching theorems：匹配定理

matching 匹配 | matching theorems 匹配定理 | material implication 实质蕴涵