bisection method 中文意思是什麼

bisection method 解釋
二分法
  • bisection : n. 1. 兩斷，兩分，二等分，折半。2. 【數學】平分點，平分線。3. 平分的兩部分之一。adj. -al
  • method : n 1 方法，方式；順序。2 （思想、言談上的）條理，規律，秩序。3 【生物學】分類法。4 〈M 〉【戲劇】...
  1. The bisection method finds only one of them.

    二分法只求得其中之一。
  2. Next two problems illustrates a general method called a bisection argument.

    下列兩題說明一種一般的方法，稱為對分法。
  3. The bisection method applied in strength reduction method of bearing capacity of foundation

    二分法在確定地基承載力的強度折減法中的應用
  4. The numerical results show that the method can effectively solve the max - bisection problem

    數值實驗表明該方法可以有效地求解大規模的圖的最大二等分問題
  5. The experiments show that the performance of our method is similar to the ye - 0. 699 algorithm, which is the best approximate algorithm in polynomial time. but our method can effectively solve the max - bisection problem with a large scale. 2

    數值實驗表明，該方法與ye - 0 . 699近似演算法（現有的求解圖的最大二等分問題的最好的多項式時間近似演算法）得到的解的性能幾乎沒有差異
  6. The new algorithm bases on bisection and secant iteration, which is different cuppen ' s method and newton iteration. the results of theoretical analysis and numerical testing show that convergent rant of our algorithm is obviously faster that of the classical algorithm

    該演算法以割線法迭代為基礎，明顯不同與傳統的newton迭代法，理論和數值實驗表明改進的演算法的收斂性比經典演算法好
  7. Combining multilevel scheme, spectral bisection method, kl / fm refinement, as well as multi - partitioning refinement strategy, the computing method is characterized by high efficiency, flexibility, and simplicity because it both maintains load balancing and minimizes the complexity of communication among processors

    演算法結合了多層次思想和譜分區方法、 kl fm精化演算法和多分區調整策略等技術，以保持負載平衡和減小處理器之間的通信復雜度為目標，具有高效、靈活、簡便等特點。
  8. There are many faults in the chaotic optimization algorithm. to solve these problems, a new method named " bisection - interpolation approach " is put forward. it has numerous advantages such as ergodicity, uniform distribution, not sensitive to the change of initial value, not sensitive to the defining range of variable, not requiring the continuation and not requiring differential of the optimized object

    該演算法和混飩一樣具有遍歷性的特點，且變量均勻分佈於定義域，對函數的定義域變化和初值的選定都不敏感，同樣也不需要函數連續、可微，對優化對象幾乎沒有特別要求，從而避兔混池優化演算法的缺點。
  9. Executing the lifting method to the equivalent programming, we present a strengthened semidefmite relaxation. as predicted by theory and confirmed by numerical experiments the tight semidefinite relaxation gives a better lower bound of circuit bisection than the one that the previous semidefinite relaxation gives

    本文先通過增加非線性約束得到原始問題的等價模型，進而對等價模型利用提升技術，提出了一個強化的半定鬆弛模型；最後，將結果推廣到更具一般性的圖的分割問題。
  10. An equivalent integral programming model and a new semidefinite programming relaxation for the max - bisection problem are given. then, we solve the relaxation with a projected gradient algorithm. coupled with the randomized method, an approximate solution of the max - bisection problem is obtained

    2 .給出圖的最大二等分問題的整數規劃模型的等價模型及其新的半定規劃鬆弛模型，利用投影梯度演算法求解該半定規劃鬆弛模型，然後利用隨機擾動演算法求得原問題的次優解
  11. In the simulation of functions, this method performs better than chaotic optimization algorithm. with the combination of bisection - interpolation approach and gauss newton levenberg - marquardt method, we optimize neural network and fuzzy inference system. taking advantage of bisection - interpolation approach, simulated annealing algorithm and genetic algorithm find the better solution than chaotic combination method

    作者通過大量的函數模擬以及將其與牛頓高斯levenberg一manquardt方法、模擬退火、遺傳演算法等常用演算法相結合，形成的混合優化演算法，對神經網路、模糊神經網路和函數進行了優化，其優化效果明顯優于混飩以及混飩混合優化演算法。
分享友人
分享到 Line

分享到臉書