求極小法 的英文怎麼說

中文拼音 [qiújíxiǎofǎ]
求極小法 英文
minimization process
  • 求 : Ⅰ動詞1 （請求; 要求） ask; beg; request; entreat; beseech : 求人幫忙 ask sb a favour; ask a favou...
  • 極 : i 名詞1 （頂點; 盡頭） the utmost point; extreme 2 （地球的南北兩端; 磁體的兩端; 電源或電器上電流...
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. The parameter control methods are very similar to penalty function methods, both of them are to solve constrained optimization problems by solving a series of sub - unconstrained optimization problems. but parameter control methods are different from penalty function methods. firstly, the penalty coefficient of penalty function methods are preassigned, while the parameters of parameter control methodsare generated automatically according to some rule prescribed

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  2. Hence an algorithm for the minimal polynomial of a block circulant matrix over the field is presented

    ） bner基，從而給出了求塊循環矩陣的極小多項式的演算法。
  3. Algorithms for finding the minimal polynomials and inverses of permutation factor circulant matrices

    求置換因子循環矩陣的極小多項式和逆的演算法
  4. This paper has proposed a method controlling iteration number and stability of solution according to thought of integral convergence algorithm minimizing nonlinear equations

    本文利用求非線性方程組極小化全局收斂法的思路，提出了控制迭代收斂次數、控制反演解穩定的方法。
  5. In order to minimize total ordering and holding costs, a simple solution model using mixed integer programming techniques is presented to determine the optimal solution of the number of orders and timing of replenishment points, and quantity to be ordered at each replenishment

    此外，為達到極小化總訂購成本及總持有成本，本模型?用混合整?規劃技巧提供一個簡單求解方法，可同時求得最佳訂購次? 、訂購點及每次訂購? ? 。
  6. This paper mainly studies the backward perturbation methods in solving the linear systems, and total minimal backward perturbation ( tminback ) method for symmetric linear systems is presented

    本文研究了求解線性方程組的向後擾動方法。對求解對稱線性方程組的lanczos方法做出了向後擾動分析，給出了求解對稱線性方程組的總體極小向後擾動（ tminback ）方法。
  7. The flexible decision method of bargaining for the kind of cooperative game is presented. the solution by the method is egalitarian and efficient. under some condition, it is the lexicographic maximin solution

    柔性決策方法，根據這種方法求出的解具有公平性和有效性，符合管理科學的基本原則；在一定的條件下，這種解也是字典序極大極小解
  8. 3 g 一 g g abasi 叱 加 ical pp 訕 howthe qquasi ghgsical 毗 quasi sociological methodmo 止 secondlx we uthuther nalsze the nhrsical model on which he quasi pnsical and quasi sociological methods for solving s 肛 problembased considering a physical hypothesis on this model ， we construct a counterexaxnple to showthatthe hypothesis is not eee ? howeve 二 itdoes notdamage the goodpractical effectof applpinp this phpsical model to solve s 盯 problem considering he existence of alsorithlnic region ， which reflects that the quasi sociological method is very necessw for ass 吶 ng the high efficient of theent whole algori 燦 m therefore deepens our comprehension on the quasi physical and quasi sociological methods mird1x we wpl … 叫 nas 恤 ysi 陰 1md q 阻 si 500i 吶 i0alm 毗 cd 引 0 咖 we mathematical problem ofcom 恤 non oforthogonal tmles m successfully es 恤 fish a physicalopttrizatbo model for sotring saturated o 汕 ogonal tables ， whwh ws provedto be correctintheo0 we thi 冰 。 w goodpersonated s 咖 egies forjumping out of the t 呷 oflocal minimum using quasi sociological method based onthe physical model thus wegetthe wholequasi physicaland quasi sociological algorim forthe problem ofconswction ofs 咖 med orthogonal tables he experimental results showthatthephysical model ishighly efficientthanthe conflmng nlllllber mode ！ based on me pure m 她 ematical 訕 kgfound 他 sucoes 訕 11y ? ? rk 咖 m 枷 ons 訕 卿 nal 郵 ie with 3 leve13 using th 叫 u 1 physical and quasi sociological algori 恤 we got some o 汕 ogonal t 勸 les ofl 。 ， （ 3 ’ ‘ ） which are not isomorphic moreove 乙 some ofour results are also not isomorphic to oe results pearedb 山 e open rekrences we got lip to now lastlx for 讓 卜 ancie 口 戊 扯 d importantproblemsofconstfutfuction oflatin square and orthogonal latin squares （ most of

    應用此演算法，我們成功地計算出難的三水平正交表本課題為國家重點基礎研究發展「九七三」規劃，國家「八六三」高技術發展計劃，高等學校博士學位點專項科研基金及中國科學院軟體研究所計算機科學開放研究實驗室課題基金資助項目1g一gs第四，應用擬物擬人方法嘗試求解古老而重要的拉丁方、正交拉丁方（它們事實上是正交表）問題。我們結合這些問題的特性，建立了新的物理模型，從理論上證明了這些物理模型的正確性，並設計出擬人化的「跳出局部極小值陷餅」的策略，得到了求解拉丁方、正交拉丁方的擬物擬人演算法。實驗表明， 」對某些問題演算法有好的效果。
  9. The paper is built as follows. in chap 1, we introduce the applied context of the minimal norm least square solutions for vandermonde matrix first. the fast algorithm of the minimal norm least square solutions for vandermonde matrix with mxn order and its transpose are presented later through constructing vtv ( or wt ) and seeking their inverses

    本文的結構如下：第一章先給出了vandermonde方程組的極小范數最小二乘解的一些實際應用背景，然後通過構造方陣v ~ tv （或vv ~ t ）並求其逆矩陣導出了求以m n階vandermonde矩陣及其轉置，以及m n階跳行vandermonde矩陣為系數陣的線性方程組極小范數最小二乘解的快速演算法。
  10. Only clouds of points instead of grids are distributed over the computational domain and the spatial derivatives of the considered partial equations are estimated using a least - square curve fit on local clouds of points

    與傳統的網格方法不同，無網格方法的核心是用「點雲」離散求解區域，並基於當地點雲離散結構，引入二次極小曲面逼近空間導數。
  11. The best approximations algorithm is just the method which can solve the mini - max solution of the least value of frequency deviation. because of the reason above, in this paper the best approximations algorithm is introduced into calculating the parameters of atcxo compensation network for the first time

    最佳一致逼近演算法正是能夠求解出使頻率偏差的絕對值最小的極小極大解的一種方法，為此將最佳一致逼近演算法首次應用於模擬溫補晶振補償網路參數的計算中。
  12. Algorithms for the minimal polynomial and the inverse of a given block symmetric circulant matrix over a group algebra of a finite group over a field are presented. and a method of determining singularity of this block symmetric circulant matrix is given

    ?給出了求域上有限群的群代數上的塊循環矩陣的極小多項式的演算法，西安電子科技大學博士學位論文:多項式代數及其應用奇異性判別法及其逆矩陣的求法
  13. Actually, this is to resolve an over - determined nonlinear system including six output values and eight input values. so newton - gauss iterative algorithms is used, set up the target function in the sense of the least squares. it is discussed whether the minimal solution to the function exist and is single one while the astringency of newton - gauss method is analyzed

    對于冗餘驅動振動臺，其位姿正解是求解具有八個輸入、六個輸出的超定非線性方程組，因此本文採用了最小二乘法中的牛頓?高斯迭代法，建立最小二乘目標函數，對目標函數極小解的存在性、唯一性以及牛頓?高斯迭代法的收斂性進行了理論證明和分析，將求出的最小值作為位姿正解的最優解。
  14. Many technologies of electrically small antennas and wide band antennas are discussed in theory, simulation and experiment. and some novel electrically small or wide band antennas are proposed. the loaded monopole is analyzed in depth integrating the genetic algorithm ( ga ) with the method of moments ( mom ) in order to increase the gain and decrease the vswr of antennas used at hf / vhf band

    在本論文的研究過程中，通過合理利用各種現有的天線寬帶化和小型化的理論成果、有效的綜合各種技術措施，運用矩量法和遺傳優化演算法等數值方法，深入研究了加載單極子天線問題，旨在全面提高高頻/甚高頻頻段內的天線增益和降低電壓駐波比，以獲得較高增益的、基本滿足駐波要求的小型超寬帶天線。
  15. Based on the comparing analysis and character of clustering algorithm the simulated annealing （ sa ） algorithms was applied to the data clustering. simulated annealing （ sa ） algorithms are random search techniques based on physical annealing process, which can prevent the optimizing process into local optimization and get the global optimization

    演算法以優化過程的求解與物理退火過程的相似性為基礎，通過接受準則和對下降溫度的控制，能夠有效的克服優化過程陷入局部極小從而獲得全局最優解。
  16. Solution of nonlinear ship motion equations in oblique regular seas. in this thesis, a new method is presented about calculating nonlinear ship motion responses in oblique seas based on minimized theory

    哈爾濱工程大學博士學位論文關于斜浪中非線性船舶運動方程的求解:本文提出了按極小化原理確定斜浪規則波中船舶非線性運動響應的新方法。
  17. Chapter 4 studies the techniques for numerical realization of the dual algorithms and generalization of the dual algorithms to general unconstrained nonlinear programming. at first, we construct modified dual algorithms to overcome the drawback that it needs to resolve a sequential unconstrained minimization problems exactly in the step 2 of the dual algorithms in chapter 2 and chapter 3

    首先針對前兩章的對偶演算法由於需要精確求解一系列無約束極小化問題，因而實際計算中很難實現這一缺點，構造修正的對偶演算法，即，關于勢函數的無約束極小化問題無需精確求解的對偶演算法。
  18. Abstract : in this article an optimization method is applied to de sign open - type distribution networks. graph theory technology is used. its mathem at ical model considers both the investment of constructing lines and the cost of o peration. the main idea is getting the structure of tree network that meets with the technical constraint conditions and at the same time make the annual cost mi nimum. the examples of simulation show that this method is fast and effective

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  19. Accordring to basic concept and assumes essentially on the basic of sweden method of slices, be living below the maximum equilibrium state, the function expression about stability safety homogeneous slop is deduced, and the slope surface is consist of two lines and an arc, afterwards according to analysis theory of minimal value ruling on the basic of the maximum, genetic algorithm is applied to slove the dangerousest slide situation and radius and corresponding safely factor

    根據瑞典圓弧法的基本概念和基本假定，在極限平衡狀態下，推導了兩直線段均質斜坡穩定性安全系數函數表達式，然後根據極限分析理論的極小值原理，利用遺傳演算法，求出了邊坡穩定性安全系數極小值，並得到最危險滑動面的滑弧半徑和滑弧中心坐標。
  20. To find the correct solution of the polarimetric ellipse rotation angle, the algorithm of fuzzy soluted has been proffered and proved in the paper

    人了求解小確的極化橢圓力血角，論文闡明了極化橢圓力丫l解模糊演算法，並驗證算滄的m確性。
分享友人
分享到 Line

分享到臉書