convex domain 中文意思是什麼
convex domain
解釋
凸域-
Chapter 2 of this paper, by using a new method of proof, we obtain the weak ergodic convergence theorem for general semigroups of asymptotically nonexpansive type semigroups in reflexive banach space. by theorem 2. 1 of chapter 1 we get the weak ergodic convergence theorem of almost orbit for general semigroups of asymptotically nonexpansive type semigroups in reflexive banach space. by this method of proof, we give the weak ergodic convergence theorems for right reversible semigroups. by theorem 2. 1 of chapter l, we generalize the result to almost orbit case. so we can remove a key supposition that almost orbit is almost asymptotically isometric. it includes all commutative semigroups cases. baillon [ 8 ], hirano and takahashi [ 9 ] gave nonlinear retraction theorems for nonexpansive semigroups. recently mizoguchi and takahashi [ 10 ] proved a nonlinear ergodic retraction theorem for lipschitzian semigroups. hirano and kido and takahashi [ 11 ], hirano [ 12 ] gave nonlinear retraction theorems for nonexpansive mappings in uniformly convex banach spaces with frechet differentiable norm. in 1997, li and ma [ 16 ] proved the ergodic retraction theorem for general semitopological semigroups in hilbert space without the conditions that the domain is closed and convex, which greatly extended the fields of applications of ergodic theory. chapter 2 of this paper, we obtain the ergodic retraction theorem for general semigroups and almost orbits of asymptotically nonexpansive type semigroups in reflexive banach spaces. and we give the ergodic retraction theorem for almost orbits of right reversible semitopological semigroups
近年來， bruck [ 5 ] ， reich [ 6 ] ， oka [ 7 ]等在具frechet可微范數的一致凸banach空間中給出了非擴張及漸近非擴張映射及半群的遍歷收斂定理。 li和ma [ 13 ]在具frechet可微范數的自反banach空間中給出了一般交換漸近非擴張型拓撲半群的遍歷收斂定理，這是一個重大突破。本文第二章用一種新的證明方法在自反banach空間中，研究了揚州大學碩士學位論文2一般半群上的（ r ）類漸近非擴張型半群的弱遍歷收斂定理，即:定理3 . 1設x是具性質（ f ）的實自反banach空間， c是x的非空有界閉凸子集， g為含單位元的一般半群， s =仕工， 。 -
Cross section is a set of polygons and for this reason some relative algorithms for polygon are studied firstly. new algorithms for orientation and inclusion test for simple polygon are proposed. and ghosh ' s convex hull algorithms for simple polygon and convex polygons, subramanian ' s triangulation algorithm for arbitrary planar domain and o ' rourke ' s intersection algorithm for convex polygons are modified to make them more robust
斷層輪廓為簡單多邊形，首先對多邊形的一些相關演算法進行了研究，提出了一種判斷簡單多邊形方向及點在多邊形內外的新方法，改進了subramanian的平面多連通域的三角劃分方法、 ghosh的多邊形的凸包及多個多邊形的凸包演算法和o ' rourke的凸多邊形的求交演算法。 -
In this paper, we study classical solution to the first initial - boundary value problem of parabolic hessian equation : where is a bounded, uniformly ( k - l ) - convex domain in rn with smooth boundary
本文研究如下的拋物型hessian方程的第一初邊值問題的古典解：其中是r ~ n中有界一致（ k - 1 ）凸的光滑區域。 -
Based on improvements to sheffer ’ s abf method, a novel parameterization method is proposed. it solved the abf ’ s problem of parameter domain border, such as intersection and non - convex
在對abf方法進行改進的基礎上，給出了一種三角網格模型參數化方法? iabf方法。 -
The character of the constraints ( i. e., the feasible domain of the constraints ) is analysed in this paper. an important conclusion is that the feasible domain of frequency constraints is no convex, while the others are convex. therefore, the frequency constraint is the key constraint for the existence of the solution
對結構優化設計的約束的性質（即約束的可行域）進行了分析，得出了固頻約束的可行域是非凸集，其餘約束的可行域是凸集，固頻約束是決定優化解是否存在的關鍵約束等有益結論； 3 -
Abstract : an algorithm of indefinite quadratic programming over unbound domain is presented ; the indefi nite quadratic programming is translated into a series of convex programming and the convergence of algorithm is discussed
文摘:給出了無界域上不定二次規劃的一個演算法，該演算法將不定二次規劃轉化為一系列凸二次規劃，並證明了演算法的收斂性
分享友人