最速下降法 的英文怎麼說

中文拼音 [zuìxiàjiàng]
最速下降法 英文
saddle point method
  • : 副詞(表示某種屬性超過所有同類的人或事物) most; best; worst; first; very; least; above all; -est
  • : Ⅰ形容詞(迅速; 快) fast; rapid; quick; speedy Ⅱ名詞1 (速度) speed; velocity 2 (姓氏) a surna...
  • : 下動詞1. (用在動詞后,表示由高處到低處) 2. (用在動詞后, 表示有空間, 能容納) 3. (用在動詞后, 表示動作的完成或結果)
  • : 降動詞1. (投降) surrender; capitulate 2. (降伏) subdue; vanquish; tame
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  1. The procedure functions in the compare between partial image of dynamic collection and corresponding image of the airscape. in chapter 5, basing on the analysis of correlative theory of digital image, we introduce the improved fasted - down algorithm and simulative anneal algorithm, which applies to nn calculation, an d bring forward the unique and effective means, correlative original value evaluation. basing on the combination of correlative arithmetic, a stable, high - speed and exact correlative arithmetic is formed, which makes it possible to apply computer vision detection of single - needle quilting in industrial production

    本文展開研究並取得一定成效:構建了基於pci總線的微機實時圖像採集系統;在採集的布料總圖(鳥瞰圖)的基礎上,通過數字圖像的數字濾波、圖像增強、邊緣檢測等處理,提取布料圖像的邊緣,對輪廓的矢量化的象素點進行搜索,得到相應的圖案矢量圖,從而確定絎縫的加工軌跡,生成加工指令;在進給加工過程中,主計算機對動態局部圖像與總圖(鳥瞰圖)的對應部分進行圖像相關的匹配計算,應用數字圖像理論,結合神經網路計算的改進最速下降法和模擬退火演算,提出獨特而有效的相關迭代初始值賦值方,形成穩定、高和準確的相關運算,實現單針絎縫視覺測量和自動控制。
  2. In the next chapter, the two dimensional fipwa especially the modified steepest decent path ( msdp ) in angular complex plane and the interpolate / extrapolate technique have been carefully studied

    接著,重點研究了二維快非均勻平面波演算,對其復平面上的修正路徑及內插外推技術進行了深入研究。
  3. An eigenvalue method based on the steepest descent curve

    基於曲線的特徵值
  4. The hybrid algorithm raises the convergence rate of the conjugate gradient method and solves the problem for which the convergence rate of the steepest descent method get slower when the isopleth of goal function is oblong

    這種混合優化演算結合了共扼梯度最速下降法產生搜索方向,既提高了共扼梯度演算的收斂度,又解決了目標函數的等值線是扁長橢球時,最速下降法緩慢的問題,具有收斂度快、收斂范圍大、適應面廣等特點。
  5. Experiments show that the efficient motion estimation algorithm proposed can further reduce block matching distortion computations relative to conventional fast motion estimation algorithms with neglectable coding efficiency loss ( within 0. 1db )

    提出一種基於節點模型的可變形塊匹配運動估計演算來搜索佳運動矢量。實驗表明,在編碼性能損失很小的條件,可以使得運動搜索塊匹配的運算量在通常快運動搜索演算的基礎上61 % 。
  6. According to the least twin multiplication to calculating the sensitivity index in several water production functions. thus, the writer obtains the fitted the value of the sensitivity index and the varied rule. at the same time, the writer puts forward a new method named rag a ( real coding based accelerating genetic algorithm ) and combines raga with dpsa to calculating the best irrigation system under the non - sufficient irrigation of well irrigation rice in sanjiang plain

    根據《隨機水文學》理論中的時間序列分析,建立了適合三江平原井灌水稻需水量預報的非平穩時序隨機模型;通過分析雨隨機特性,選定季節性時序隨機模型,建立了適合三江平原井灌水稻雨預報的月平均雨模型;根據小二乘,計算出幾種常用水分生產函數中的敏感指數及敏感系數,進而得到三江平原適宜採用的水分生產函數漠型及模型中敏感指數的變化規律;本文提出遺傳動態規劃( raga ? dp ) ,即採用改進的基於實數編碼的加遺傳演算( realcodingbasedacceleratinggeneticalgorithm ,簡稱raga )與動態規劃( dpsa )相結合,推求非充分灌溉條件三江平原井灌水稻的優灌溉制度。
  7. Compared with the classical bp algorithm, robust adaptive bp algorithm possesses some advantages as following : ( 1 ) increasing the accuracy of the network training by means of using both the relative and absolute residual to adjust the weight values ; ( 2 ) improve the robustness and the network convergence rate through combining with the robust statistic technique by way of judging the values of the samples " relative residual to establish the energy function so that can suppress the effect on network training because of the samples with high noise disturbances ; ( 3 ) prevent entrapping into the local minima area and obtain the global optimal result owing to setting the learning rate to be the function of the errors and the error gradients when network is trained. the learning rate of the weights update change with the error values of the network adaptively so that can easily get rid of the disadvantage of the classical bp algorithm that is liable to entrap into the local minima areas

    與基本bp演算相比,本文提出的魯棒自適應bp演算具有以優點: ( 1 )與魯棒統計技術相結合,通過訓練樣本相對偏差的大小,確定不同訓練樣本對能量函數的貢獻,來抑制含高噪聲干擾樣本對網路訓練的不良影響,從而增強訓練的魯棒性,提高網路訓練的收斂度; ( 2 )採用相對偏差和絕對偏差兩種偏差形式對權值進行調整,提高了網路的訓練精度; ( 3 )在採用梯度演算對權值進行調整的基礎上,通過將學習率設為訓練誤差及誤差梯度的特殊函數,使學習率依賴于網路訓練時誤差瞬時的變化而自適應的改變,從而可以克服基本bp演算容易陷入局部極小區域的弊端,使訓練過程能夠很快的「跳出」局部極小區域而達到全局優。
  8. Anfis based on takagi and sugeno ' s fuzzy model has the advantage of being linear - in - parameter ; thus the conventional adaptive methods can be efficiently utilized to estimate its parameters

    由於節點參數是線性的,用梯度小二乘的混合學習演算來調節參數,減少了運算量,加快了收斂度。
  9. Simple genetic algorithm gets local minimization too easily and converges slowly. to solve these problems, adaptive crossover rate that has reverse hyperbolic rel ation with the numbers of iteration is designed, and adaptive mutation rate that has reverse proportion to the distances of parents and reverse exponential relat ion to the numbers of iteration is put forward. the practical simulation results show that the adaptive ga has greater convergence speed and larger probability o f getting the best solution

    簡單遺傳演算存在著收斂度慢、易陷入局部極小等缺陷.針對這些缺陷,本文設計出隨相對遺傳代數呈雙曲線的自適應交換率,並提出與父串間的相對歐氏距離成反比、隨相對遺傳代數指數的自適應變異率.實例驗證表明,具有自適應交換率和變異率的遺傳演算在收斂度和獲得全局優解的概率兩個方面都有很大的提高
  10. The series of point group calculated by this algorithm theory is strictly descending and converging to the stable polar point. this theory is very efficiency in solving the problem of lad for its simplicity 、 rapid speed and high adaptability

    本文演算所產生的點組序列是嚴格並收斂于穩定極點的,我們的計算表明,本演算對求解超定小一乘估計問題非常有效,具有演算簡單、度快、適應性強的特點。
  11. These days, fasano calls wang ' s pitch " a legit sinker, " one that breaks 6 to 7 inches on a downward spiral. wang also throws a change - up and an occasional slider or splitter

    沙諾都把小民的球稱為正統伸卡球,他的球在盤旋時會有6到7英?的跑幅。小民還會投變球,偶爾也會投滑球或快指叉球。
  12. The fipwa based on electric integral equation ( efie ) is presented firstly, the green ’ s function expansion with sommerfeld identity ( based on bessel kernel ) is studied and the msdp for two cases is formulated. in order to improve the iteration property and avoid inner resonance, the combined field integral equation ( cfie ) fipwa is then constructed successfully

    首先研究了基於電場積分方程的快非均勻平面波演算,對索末菲恆等式(基於貝塞爾積分核)展開的格林函數進行了深入研究,分兩種情形解決了修正路徑的設計問題。
  13. The method of steepest descent

    最速下降法
  14. These weights are used as initialized weights, and then, the steepest descent approach is introduced for training the networks

    將這些權值作為初始權值,採用演算來對神經網路進行訓練。
  15. Since it adopt the steepest descent method in nonlinear programming, it has the drawback that easy converge to a local minimum point of the error function

    由於它採用非線性規劃中的最速下降法,因而存在極易陷入局部極小的缺陷。
  16. Based on the steepest descent method and the conjugate gradient method, a hybrid algorithm is proposed in this paper, and its global convergence is proved

    摘要將最速下降法與共扼梯度有機結合起來,構造出一種混合優化演算,並證明其全局收斂性。
  17. This paper researches blind equalization ruler, analyses the knowledge of hos and summarizes some algorithms based on the hos. odd - order ( third - second order and fifth - second order ) normalized cumulant algorithms are introduced and a new blind equalization ruler is proved and introduced after researching even - order normalized cumulant algorithms. then the steepest descent method is used to derive the algorithm

    在分析偶數階歸一化累積量演算的基礎上,提出了奇數階(三、二階和五、二階)歸一化累積量演算,論證並推導出一種新的盲均衡準則,後利用最速下降法形成了新演算
  18. A practical way to overcome this difficulty is to use the so - called " natural level function " as the merit function instead of the general level function

    此時newton方向是自然水平函數的方向。因此,利用自然水平函數進行搜索,可以增大演算的步長,達到提高演算效率的目的。
  19. The training object of the algorithm is minimization of the cost function in optimal control, variations of the weight values are obtained by the steepest descend gradient method and moreover an approximate treatment is made on the sensitivity matrix evaluation

    本方以瞬間優控制價值函數小化為訓練目標,考慮了地震輸入的能量,利用梯度計算權值的改變量,並對敏感度矩陣進行近似處理,可解決神經網路控制中神經網路控制器難以獲得的訓練輸入輸出樣本對的難題。
  20. Second, for vector sequence coming from the steep - descent method, we use extrapolation method for the sequence and get some applied algorithms. we also give theoretical proofs for this algorithms. many numerical experiments tell us that the new algorithms sometimes can save 80 % computation

    其次,對求解非線性優化問題的簡潔的產生的迭代序列,運用向量序列加收斂手段進行了討論,導出了一些實用的加演算,並從理論上證明快演算的有效性,眾多數值試驗進一步表明:加收斂的方相比較加前幾乎都能夠節約80以上的計算量。
分享友人