bound theorem 中文意思是什麼

bound theorem 解釋
界限定理
  • bound : n 〈pl 〉1 界限,界線,限度。2 邊界,邊境;邊界線內的領土。3 區域,領域,范圍。vt 1 限,限制。2 ...
  • theorem : n. 1. (能證明的)一般原理,公理,定律,法則。2. 【數學】定理。
  1. According to horodeckis, the coherent information of entangled state is supposed to be the lower bound of one - way distillable entanglement. this postulation is called hashing inequality, which is crucial in proving noisy channel coding theorem. it is shown that there are no direc

    根據horodecki等人的研究,糾纏態的相干信息推測是單向蒸餾糾纏的下限,該假設稱為hashing不等n式,對證明有噪通道編碼定理至關重要
  2. Because the kinematically - admissble cyclic strain rate field required in kninematical - type theorem of shakedown analysis is rather difficult to be constructed, shakedown analysis based on kinematcal theorem cannot be directly applied. some conditions of kinematical - type shakedown theorem are released by ksnig and then the shakedown rules respectively for alternating plasticity and incremental collapse are obtained, for the numerical method based on the upper - bound theorem is formulated

    兩種方法的特點是:運用一種分級循環加載方式來尋找機動許可的塑性應變率場,利用這兩種機動安定準則的特點來判斷結構的安定性,從而得到機動安定性分析的安定載荷。
  3. In the main theorem, we obtained the error bound between the maximum likelihood estimator and the true parameter

    使用這個不等式和概率論的方法,我們得到了參數的極大似然估計的誤差界這一主要定理
  4. A model is erected for fs with logarithmic spiral sliding surface which can simulate the genuine sliding surface better than others, then the express of fs is deduced based on the upper bound theorem of limit analisis

    採用對實際滑裂面模擬較好的對數螺旋曲線滑裂面,建立了整體穩定安全系數f _ c的模型,從極限分析中的上限理論推導了整體穩定安全系數f _ c的表達式。
  5. Chen, r. h. and hong, y. s., 1998, 11, " limit analysis of nailed soil structures to upper bound theorem ", proc. of 13th southeast asian geotechnical conference, taiwan, r. o. c., pp. 277 - 281

    洪勇善、陳榮河, 2000 , 02 , "模型土釘拉出行為之非線性分析" ,八十八年電子計算機于土木水利工程應用研討會,第629 - 637頁。
  6. Limit analysis and calculation for bucket foundation embedded in soft clay based on the upper - bound theorem

    軟黏土中桶形基礎的上限法極限分析模型及其計算
  7. In the second section of chapter three, we prove theorem 3. 7 and a good example is given to show that the bound of locally connectivity is sharp

    7的證明並且給出例子,說明該定理中的局部連通度的條件是最好可能的在53 3中,我們提出一個猜想,該猜想是由定理3gi 『和定理3
  8. Two proof methods of lower bound theorem of least singular value of nonsingular

    矩陣最小奇異值的下界定理的兩種證明方法
  9. Large - scale optimization and its application to upper bound theorem using kinematical element method

    大規模優化及其在上限定理有限元中的應用
  10. Finite element method of upper bound theorem based on the generalized plastic theory and its application

    基於廣義塑性理論上界法的有限元法及其應用
  11. Analytical solution of bearing capacity of circular shallow foundations using upper - bound theorem of limit analysis

    圓形淺基礎地基承載力極限分析的上限解析解
  12. The optimal course is automatically implemented with matlab. the cusp catastrophe model is established by means of the upper bound theorem of plastic limit theory. the characteristic formula of the failure of slope is also deduced

    根據分析邊坡穩定性的塑性極限方法的上限理論建立了邊坡失穩尖點突變模型,並得出邊坡突發式滑坡的特徵關系式,用突變理論對非飽和土邊坡穩定進行了初步研究。
  13. After the optimization, a certain stability allowance and a certain performance index are obtained for the fuzzy controller through introduction of the small gain theorem for ensuring the system stability and optimization of the parameters of the controller with the norm bound based on with the genetic algorithm

    利用小增益理論確保控制系統的穩定,採用范數度量模型集的界,用遺傳演算法優化控制器參數,使得優化后模糊控制器具有一定的穩定裕量和一定的性能指標。
  14. Chapter 2 establishes the theoretical framework of a class of dual algorithms for solving nonlinear optimization problems with inequality constraints. we prove, under some mild assumptions, the local convergence theorem for this class of dual algorithms and present the error bound for approximate solutions. the modified barrier function methods of polyak ( 1992 ) and the augmented lagrange function method of bertsekas ( 1982 ) are verified to be the special cases of the class of dual algorithms

    第2章建立求解不等式約束優化問題的一類對偶演算法的理論框架,在適當的假設條件下,證明了該類演算法的局部收斂性質,並給出近似解的誤差界,驗證了polyak ( 1992 )的修正障礙函數演算法以及bertsekas ( 1982 )的增廣lagrange函數演算法都是這類演算法的特例。
  15. In the chapter 3, we study the t - blocking set and ( k, r ) - arc in the pg ( 2, q ). first we give ball " s theorem an elementary proof and improve its result, then we prove a new value of mr ( 2, q ). in the chapter 4, the upper bound of the caps is our main research

    在第三章里,我們主要研究的是平面t - blocking集和( , ) - arc ,其中對給出了t - blocking集的一個下界值的ball定理進行了初等證明並改進了其結果;另外,我們還研究了平面( , ) - arc ,其主要結果是證明了一個新的m _ r ( 2 , q )值。
  16. Theorem 4. 3 the following bound holds for the function g for all sufficiently large non - negative integers m < n : where g ( m, n ) denotes the minimum number of pieces needed to dissect a regular m - gon into a regular n - gon using glass - cuts

    3設g ( m , n )表示將一個正m邊形分劃為等面積的正n邊形所需的最小塊數,對于足夠大的非負整數m n ,下式成立:定理4
分享友人