束收斂 的英文怎麼說

中文拼音 [shùshōuliǎn]
束收斂 英文
beam convergence
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  1. It is proven that these modified dual algorithms still have the same convergence results as those of the conceptional dual algorithms in chapter 2 and chapter 3. secondly, a dual algorithm is constructed for general constrained nonlinear programming problems and the local convergence theorem is established accordingly. the condition number of modified lagrange function ' s hessian is estimated, which also depends on the penalty parameter

    證明這些修正的對偶演算法仍具有同前兩章的概念性對偶演算法相同的收斂性結果，我們還進一步構造了一般約束非線性規劃問題的對偶演算法，建立了相應的局部收斂理論，最後估計了修正lagrange函數的hesse陣的條件數，它同樣依賴于罰參數。
  2. Convergence of line search methods for unconstrained optimization

    無約束優化問題線搜索方法的收斂性
  3. In addition, the beamforming techniques for cdma systems are discussed emphatically. the algorithm based on code filtering is deduced in detail theoretically, and the performances such as convergence and bit error rate ( ber ) are simulated. meanwhile, we improve a decision - projected algorithm based on least - mean - square ( lms ) error

    論文重點討論了cdma系統的波束形成技術，在理論上詳盡地推導了基於擴頻碼濾波的波束形成演算法，對其收斂性、誤碼率等進行了計算機模擬；針對基於最小均方（ lms ）誤差的一種判決映射演算法進行了改進。
  4. Trajectory control algorithm is also presented to make the excursion of flight converge to zero in given limited time during flying. it is mainly used to control and reduce the excursion and crab angle within given limited time when the aerocraft is following the reference flight path

    然後本文提出了用於控制飛行器在跟蹤參考航跡過程中出現的航跡偏移和偏航角的航跡控制演算法，該演算法能有效地使航跡偏移量和偏航角在給定的時間約束內收斂。
  5. Among hese method, one of the simplest is the deepest gradient descent algorithm, but it has one disadvantage that the solutions are oscillatory and slowly convergent. a friction term is ntroduced to avoid oscillatory solutions and raise convergence rate. the third major contribution of this dissertation is study on 3 - d diffuse object surface optical automatic measurement

    其次，結合要處理的具體問題，介紹數值優化及幾種常用的無約束最優化計算方法，以最優梯度法為基礎，討論其演算法的優缺點，通過引進阻尼系數，改進了演算法的收斂速度，從而提高迭代精度。
  6. This optimizing method had been used successfully in full - scale aircraft testing. 6 ) in the global equilibrating, a modified lagrange multiplier method had bring forward. this method can solve inequality constrained optimizer problems

    在整體平衡中，提出了改進的拉格朗日乘數法，成功地解決了含不等式約束條件的優化問題，該方法具有計算簡單，收斂速度快等特點。
  7. Based on the convergence criterion of root - mean - square ( rms ) of phase and output power, the actual intensity on reflectors are solved with fox - li iteration so that the deformations of mirrors and one - way phaseshifts are calculated. by simulating one - way phaseshifts with zernike polynomial, the laser modes are studied with method of iteration and geometriy. the evaluation factors of components influences on beam quality is discussed

    根據相位均方根值迭代收斂準則和輸出功率，用fox - li迭代法求出反射鏡上實際的光強分佈和熱源，得到鏡面的位移變形和單程附加相移，以zernike多項式擬合單程附加相移，分別用迭代法和幾何法計算了腔鏡變形時的腔模光場，建立了光學元件對光束質量影響的評價因子，研究腔鏡冷卻效果和冷卻方式，對輸出耦合鏡的變形進行了分析。
  8. Trust region methods has drawn our attention increasingly as one approximating method guarantees general convergence. its basic step is as follows : first, we set trust - region radius, and then we get a trial step produced by constraint quadratical model

    信賴域方法是近年來日益受到關注的一種新的保證演算法整體收斂性的逼近方法，信賴域方法的基本步驟是首先指定一個信賴域半徑，然後用帶約束的二次模型來確定搜索方向與步長大小。
  9. Among the adaptive beam - forming algorithms, the least mean square algorithm is widely used because it has a simple configuration and it is apt to come true and have nice convergence. on the other hand, it has a disadvantage that it converges slowly and there is a conflict between the fixed step and the convergence pace or the error in stabilization. so people have developed many improved least mean square algorithms which generally start from convergence, stabilization, misadjustment, and robustness and come to a formula about variational step in the end

    在自適應波束形成演算法中，最小均方（ lms ）演算法因結構簡單，易於實現，能穩定收斂而得到廣泛應用，但它也存在收斂速度受限的缺點：固定步長因子無法解決收斂速度和穩態誤差之間的矛盾。因此，人們提出了各種改進的最小均法演算法來解決這一問題。改進的最小均方演算法通常從如何改進收斂速度、穩態誤差、失調量和魯棒性等指標上出發，最後在新演算法最終表達式中的步長公式上變化。
  10. With that produced in the yongle and xuande periods as the representative, the meiping in the ming dynasty is narrow out - curled mouthed, short - necked, and broad - shouldered, leaving a sense of sincerity and sedateness

    明代以永樂、宜德時期的梅瓶最具代表性，小唇口微外撤，短頸中部微束，豐肩，腹以下漸收斂，給人敦厚穩重之感。
  11. Global convergence of the non - quasi - newton method for unconstrained optimization problems problems

    基於非擬牛頓方法無約束最優化問題的全局收斂性
  12. On one hand, from the technique of constrained least squares and limited energy of additive noise, an effective restored approach by adopting regularization method to overcoming ill - posed problem, solving an equation with a single variable, and using space iterative algorithm is proposed ; on the other hand, aiming at the restoration of blurred image, another effective restoration approach based on least - square algorithm is also proposed in this paper. this method firstly adopts increment iterative algorithm to improve convergence and meanwhile applies regularization technique to overcome ill - posed problem. in the computations, the regularized parameter has its adaptive character, which can be determined in terms of the restored image at each iteration step therefore automatically correct to the appropriate value

    一是從約束最小二乘出發，在加性噪聲能量有界的前提下，採用正則化方法來克服病態問題，通過解一個單變量方程，並利用空域迭代運算實現了一種有效的圖像復原;二是針對模糊圖像的復原問題，從最小二乘演算法出發，採用增量迭代的方法改善演算法的收斂性，同時結合正則化技術克服問題的病態性質，並引入自適應的正則化參數，使其與圖像復原的迭代運算同步進行並自動修正到最優值。
  13. 3 a novel recursive least - square ( rls ) blind space - time receiver algorithm based on the constrained condition, which can completely avoid the matrix inversion introduced into by constraints ( comparing with the normal rls ), is proposed for multi - path slow fading cdma channels. the computational complexity of this method is not only lower than that of the normal rls, but also lower than that of both lms and ls blind space - time receiver methods that are realized based on the rosen ' s gradient projection. and the speed of convergence of the presented rls blind space - time receiver algorithm is better than that of both lms and ls blind space - time receiver methods

    3 、針對多徑慢衰落通道下ds - cdma盲空時接收機中線性約束二次規劃問題提出一種新的遞歸最小二乘演算法，該演算法完全避免因約束而引進的矩陣求逆運算（相對于常規的遞歸最小二乘演算法） ，不但運算量比常規的要低，而且比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時接收機演算法還低，且收斂速度比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時多用戶檢測都好，將提出的新的遞歸最小二乘演算法與提出的數據選擇方案結合起來可以進一步降低其運算量，具有很大的實用價值，最後通過模擬實驗進一步分析了其性能。
  14. A permutated implicit enumeration for the linear 0 - 1 programming model is proposed according to the generic model in this thesis, which utilizes the relationship between the objective functions, permutes the constrained solutions so as to search the optimum solution in the aggregate of minimums and accelerate the convergence speed

    針對多機場的非實時流量管理的模型，提出了基於排序的隱枚舉法，它利用目標函數值大小的相對關系，對約束條件解進行排序，在最小解集中尋找最優解，以加快收斂速度。
  15. Using the conic function model local approximation, w. cdavidon ( 1980 ) proposed a class of iterative algorithms with modified matrix combining function value, furthermore under the theory d. c. sorensen has used local quadratic approximation method, then applying collinear scaling idea improving on the above algorithm and generalizing it, getting a class of collinear scaling algorithm, unifying former quasi - newton. in the paper, using local quadratic approximation method, the first, constructing the new collinear scaling gene, getting a class of the new collinear scaling algorithm with briefness and numerical stability, ., we discusses some properties of the algorithm and its local linear convergence, q - superlinear convergence and the whole convergence ; secondly we have made numerical experimentation and numerical analysis ; the last, we have done much discussion for collinear scaling idea and given the several new collinear scaling algorithm

    本文的工作就是基於局部二次逼近原理，首先通過構造新的共線調比因子，得到了一類新的更簡潔，數值穩定性更好的共線調比演算法，進而我們給出了本共線調比演算法的局部收斂性，全局收斂性以及演算法q -超線性速度的理論證明；其次，用經典的無約束優化五大考核函數就本共線調比演算法進行了數值試驗和數值分析；最後，就局部二次逼近思想，進行共線調比演算法思想進行更廣泛的討論，給出了幾個新共線調比演算法。
  16. The simulation results show that the throughput of proposed method converges to that of eigen - beamforming when the number of users in a cell is large

    模擬結果表明，當小區內的用戶數足夠多時，所提出的方案獲得的系統吞吐量將收斂于在發射端使用特徵波束成形矩陣的吞吐量。
  17. The dissertation is dedicatd to the theory of maximum nongaussianity estimation in ica, and some problems are emphasized, e. g., the uniqueness of estimation, the convergence of fastica, the constraint of independence and the nonlinear activation function, the algorithms for multiple components and the order of independnent components

    本文重點研究最大非高斯估計的相關理論問題，包括估計的唯一性，演算法的收斂性，獨立性約束分析和非線性激活函數，獨立分量的排序和子空間的選擇，具有時間結構信息的信號源的估計等。
  18. By intro - ducing a penalty function as the following, for every e > 0, we construct a sequence of unconstrained minimization problems to approximate the constrained minimization problem. the solutions of such a sequence of unconstrained minimization problems all exist, and they converge to the solution of the constrained minimization problem in a certain sense

    這列無約束極小化問題（ p _ ）的解都是存在的，並且在某種意義下收斂至原始約束極小化問題（ p ）的解，不僅如此，它們的性能指標也收斂至原始問題（ p ）解的性能指標。
  19. Global convergence of a class of unconstrained optimal methods included conjugate descent method

    包含共軛下降法的一類無約束優化方法的全局收斂性
  20. In the first part, a new method of frequency compensate is presented in this thesis when there is only fast flower jammer

    一是系統僅受到快速跟蹤干擾的情況下，提出了一種新的頻率補償技術，利用多個跳頻點的數據來加快波束的收斂速度。
分享友人
分享到 Line

分享到臉書