order bounded set

order bounded set的基本解释

-

有序有界集

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

By using the psychologically pertinent studies for reference, this paper analyzes a pretty pass of auditor s independence from the factors including bounded rationality, bounded willpower , bounded ethicality, bounded awareness and self-serving biases.

本文借鉴心理学的相关研究结果，从有限理性、有限意志力、有限意识、有限道德和自我服务偏见等因素分析了注册会计师的独立性困境问题，指出这些问题往往不是注册会计师的道德问题，而是其审计信息处理过程中的认识局限性问题。

For an abitrary set X, appropriate order relations on WCL (the set of all weak closure operators), WIN (the set of all weak interior operators), WOU (the set of all weak exterior operators), WB (the set of all weak boundary operators), WD (the set of all weak derived operators), WD*(the set of all weak difference derived operators), WR (the set of all weak remote neighborhood system operators) and WN (the set of all weak neighborhood system operators) can be defined respectively, which make WCL, WIN, WOU, WB, WD, WD*, WR and WN to be complete lattices that are ismorphic to CS(X,CS is the set of all closure systems on X.

证明了可以在WCL(X上的弱闭包算子的全体)、 WIN(X上的弱内部算子的全体)、 WOU (X上的弱外部算子的全体)、 WB (X上的弱边界算子的全体)、WD、 WD*(X上的弱差导算子的全体)、 WR(X上的弱远域系算子的全体)和WN(X上的弱邻域系算子的全体)上定义适当的序关系，使它们成为与CS(X，〖JX-*5[JX*5]同构的完备格其中CS(X是给定集合X上的闭包系统的全体。

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

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

order bounded set：有序有界集

order 次数 | order bounded set 有序有界集 | order boundedness 有序有界性