最優逼近 的英文怎麼說

中文拼音 [zuìyōubījìn]
最優逼近 英文
best approximation
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 逼 : Ⅰ動詞1 （逼迫; 給人以威脅） compel; force; drive; threaten 2 （強迫索取） extort; exert pressure ...
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 逼近 : 1 （靠近 接近） press on towards; gain on [upon]; approach; crowd on; close in on; draw near 2 [...
  1. Its biquadratic finite element approximation is considered and under the appropriately graded meshes, quasi - optimal order error estimates in the - weighted h ^ 1 - norm, up to a logarithmic factor in the singular perturbation parameter, are proved

    然後，考慮此方程在分層網格剖分上的雙二次有限元逼近，在-加權h ^ 1 -模意義下得到了至多相差一個關于攝動參數對數因子的擬最優階收斂的誤差估計。
  2. The method proposed in this thesis do well in solving the problems of multi - damping - ratio - spectra simulation. it is convenient to obtain the pareto optimal solution set of the multi - object question by using implicit parallel genetic algorithms and the method can meet the practical needs for simulating ground motions coinciding with multi - damping - ratio - spectra in seismic design. the crossing rate and variance rate are important parameters of genetic algorithms which affect the rate of convergence, the adapting rate of cross and variation in this paper can auto - adapt and according to stand or fall of current sample, it assures the sample approach to the pareto optimal solution set in fast convergent speed

    較好地解決多阻尼比反應譜擬合問題；本文方法通過一次運行就能獲得一組具有集系特性的地震動，在擬合多阻尼比反應譜的人造地震波集系的模擬方面有傳統方法所不能比擬的優勢，產生的人造波或人造波集系可滿足工程抗震設計需要；在遺傳演算法中，交叉概率和變異概率是影響收斂速度的重要參數，本文採用的改進自適應交叉概率和變異概率，可以根據當前樣本的好壞程度來自動地選擇適當的交叉概率和變異概率，以保證演算法始終以較好的速度向pareto最優解集逼近。
  3. The optimal approximation for the pattern formed with fresnel zone plate antenna

    菲涅爾區板天線賦形波束的最優逼近
  4. 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

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  5. In chapter two, we consider full disceret scheme of mixed finite element methods for the following initial - value problems of linear integro - differential equations of parabolic in this chapter, we give the error analysis of this full discrete scheme and get optimal error estimates for the discrete solutions of u and p

    第二章討論下述線性拋物型積分微分方程初邊值問題混合有限元方法的后差全離散格式。給出了該全離散格式的誤差分析，得到了離散解逼近未知函數u以及伴隨速度p的關于空間和時間的最優階誤差估計。
  6. The basic idea is to find iterative points which converge to optimal point and its corresponding objective function or merit function values converge to optimal value

    其基本思想是構造迭代點來逐步逼近最優點，相應的目標函數值或評價函數值逼近最優值。
  7. Bell system technical, 1970, 49 : 291 - 307. 10 wu f, huberman b a. finding communities in linear time : a physics approach. eur

    本質上， dm演算法是一種啟發式的貪心優化演算法，它採用局部搜索方法能逐步逼近地為預先定義的目標函數找到一個近似最優解。
  8. Finally, in the third section, by constructing some functional which similar to the conservation law of evolution equation and the technical estimates, we prove that in the inviscid limit the solution of generalized derivative ginzburg - landau equation ( ggl equation ) converges to the solution of derivative nonlinear schrodinger equation correspondently in one - dimension ; the existence of global smooth solution for a class of generalized derivative ginzburg - landau equation are proved in two - dimension, in some special case, we prove that the solution of ggl equation converges to the weak solution of derivative nonlinear schrodinger equation ; in general case, by using some integral identities of solution for generalized ginzburg - landau equations with inhomogeneous boundary condition and the estimates for the l ~ ( 2 ) norm on boundary of normal derivative and h ~ ( 1 ) ' norm of solution, we prove the existence of global weak solution of the inhomogeneous boundary value problem for generalized ginzburg - landau equations

    第三部分：在一維情形，我們考慮了一類帶導數項的ginzburg ? landau方程，通過構造一些類似於發展方程守恆律的泛函及巧妙的積分估計，證明了當粘性系數趨于零時， ginzburg ? landau方程的解逼近相應的帶導數項的schr （ ? ） dinger方程的解，並給出了最優收斂速度估計；在二維情形，我們證明了一類帶導數項的廣義ginzburg ? landau方程整體光滑解的存在性，以及在某種特殊情形下， gl方程的解趨近於相應的帶導數項的schr （ ? ） dinger方程的弱解；在一般情形下，我們討論了一類ginzburg ? landau方程的非齊次邊值問題，通過幾個積分恆等式，同時估計解的h ~ 1模及法向導數在邊界上的模，證明了整體弱解的存在性。
  9. The parameter control methods are in the contrast, which is to find a sequence of parameters that converge to optimal value and its corresponding points in converge to optimal solution

    參數控制演算法的基本思想正好相反，它是構造參數序列來逼近最優值，相應的迭代點列逼近最優點。
  10. So a compensator is constructed, which is compensates the approximation error ' s effect on system output at the condition of the approximation error thought as disturbance of the system

    所以利用系統跟蹤誤差構造線性最優補償器，該補償器用於減少逼近誤差對系統跟蹤誤差的影響。
  11. From the point of view of the model, the reason is that this method can express profuse curves or curved surfaces, and can approximate the optimal performance

    從模型角度分析，這是因為這些方法所能表達的控制曲線或曲面非常豐富，可以逼近符合系統特性的最優設計。
  12. Secondly, as for degree reduction of interval rational bezier curves, two methods are given : pseudo linear programming method ( plpm ) and pseudo optimal approximation method ( poam )

    接下來對區間有理bezier曲線，給出兩種降階逼近演算法：擬線性規劃法（ plpm ）和擬最優逼近法（ poam ） 。
  13. The mrafc scheme employs a reference model to provide closed - loop performance feedback for generating or modifying a fuzzy controller ' s knowledge base. the adaptive compensation term of optimal approximation error is adopted. by theoretical analysis, the closed - loop fuzzy control system is proved to be globally stable, with tracking error converging to zero

    該方案利用參考模型作為閉環系統的反饋信號來產生、調節模糊控制器的規則庫，並通過引入最優逼近誤差的自適應補償項來消除建模誤差的影響，不但能保證閉環系統穩定，而且可使跟蹤誤差收斂到零。
  14. Based on the representation of interval rational bezier curves and surfaces and by a serial of mathematical transformation, the degree reductions of them are converted to those of polynomials with upper bounds, then several algorithms are presented, with linear programming and optimal approximation methods. by relaxation of some constrained conditions, approximation effects of some of them are further improved

    根據區間有理bezier曲線、曲面的特點，通過一系列數學變換，將其降階問題轉化為多項式的保上界降階逼近，再應用線性規劃和最優逼近方法求解，給出幾種逼近演算法，並探討通過約束不等式的鬆弛，進一步改進逼近效果。
  15. Firstly, based on backstepping and the supervisory control strategy, a robust adaptive fuzzy controller is designed for a class of nonlinear systems. the first type fuzzy logic system is used to approximate the unknown part of the process. the adaptive compensation term of the optimal approximation error is adopted

    本文首先針對一類不確定非線性系統，基於backstepping方法，利用監督控制，引入最優逼近誤差的自適應補償項，並利用型模糊邏輯系統逼近系統的未知部分，提出了一種魯棒自適應模糊控制器設計方案，運用李亞普諾夫第二方法，先證明了閉環模糊控制系統全狀態有界，再證明了跟蹤誤差收斂到零。
  16. Based on this fomulation, expanded mixed finite element approximations of the hyperbolic problems are considered. optimal order error estimates for the scalar unknwon, its gradient and its flux in l2 - norms are obtained for this new mixed formulation

    給出了逼近未知函數、未知函數梯度和流體流量的最優l ~ 2模誤差估計以及擬最優的最大模誤差估計。
  17. A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique

    摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  18. Reinforcement learning algorithms that use cerebellar model articulation controller ( cmac ) are studied to estimate the optimal value function of markov decision processes ( mdps ) with continuous states and discrete actions. the state discretization for mdps using sarsa - learning algorithms based on cmac networks and direct gradient rules is analyzed. two new coding methods for cmac neural networks are proposed so that the learning efficiency of cmac - based direct gradient learning algorithms can be improved

    在求解離散行為空間markov決策過程（ mdp ）最優策略的增強學習演算法研究方面，研究了小腦模型關節控制器（ cmac ）在mdp行為值函數逼近中的應用，分析了基於cmac的直接梯度演算法對mdp狀態空間離散化的特點，研究了兩種改進的cmac編碼結構，即：非鄰接重疊編碼和變尺度編碼，以提高直接梯度學習演算法的收斂速度和泛化性能。
  19. The symmetric ortho - symmetric solution of minimum frobenius norm of matrix equation axat

    的對稱最優解及最佳逼近
  20. Based on principle of neural network which has the best approximation and learning functions, a multiobjective quasi - neural optimization method is established. the relevent theorems and their proofs are given

    根據具有最佳逼近和學習功能的神經網路原理，建立了多目標擬神經優化方法，給出了有關定理及其證明
分享友人
分享到 Line

分享到臉書