線性逼近問題 的英文怎麼說

中文拼音 [xiànxìngbījìnwèntí]
線性逼近問題 英文
linear approximation problem
  • 線 : 名詞1 （用絲、棉、金屬等製成的細長的東西） thread; string; wire 2 [數學] （一個點任意移動所構成的...
  • 性 : Ⅰ名詞1 （性格） nature; character; disposition 2 （性能; 性質） property; quality 3 （性別） sex ...
  • 逼 : Ⅰ動詞1 （逼迫; 給人以威脅） compel; force; drive; threaten 2 （強迫索取） extort; exert pressure ...
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 問 : Ⅰ動詞1 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 線性 : [數學] [物理學] linear; linearity線性代數 linear algebra; 線性方程 linear equation; 線性規劃 line...
  • 逼近 : 1 （靠近 接近） press on towards; gain on [upon]; approach; crowd on; close in on; draw near 2 [...
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  1. A globally convergent inexact successive approximation method for nonlinear complementarity problems

    非線性互補問題非精確逐次逼近法的全局收斂性
  2. A smoothing approximation algorithm for nonlinear complementar ity problems

    求解非線性互補問題的一個光滑逼近演算法
  3. In recent years, nonlinear methods have attracted more and more attention and there have been some successful cases, such as median filter, mathematical morphology, etc. as a preferred way to inverstigate nonlinear numerical problems, the continued fractions method can effectively express the gradually changing data or abrupt data, so it is meaningful to study image processing by means of the continued fractions theory and algorithms

    近年來在圖像處理領域，利用非線性方法進行圖像處理取得較好效果的有中值濾波、數學形態學等，非線性方法已引起越來越多研究者的重視。作為研究非線性數值問題的首選方法?連分式方法，不僅能反映數據的漸變性，也能反映數據的突變性。鑒于這些原因，本文將連分式插值和逼近引入到數字圖像處理領域，開展了圖像插值、圖像重建等方面的研究。
  4. 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的關于空間和時間的最優階誤差估計。
  5. This paper mainly focuses on the noise limiting by means of the direct sequence spread spectrum ( dsss ) and the analysis of the transmission performance of the plc and some digital modulation technology. the contents of the paper is as follows : 1 ) the technical feasibility is proved after simulating noise limiting principle of dsss by means of systemview, the simulation software ; 2 ) a kind of band pass filter ( bpf ) is realized according to the requirement of filter and the principle of butterworth approximation, which satisfies the index of performance of dsss. 3 ) the low voltage plc system includes the sc1128, the specific modulation / demodulation ic, the bpf filter and other circuit components, furthermore, the control function of system is realized by means of the personal computer and the microcontroller

    本課題在對低壓電力線的傳輸特性和數字調制技術進行分析的基礎上，將通信理論中的直接序列擴頻技術（ dsss ）用於解決低壓電力線通信的干擾問題，主要研究內容如下： （ 1 ）用通信模擬軟體systemview對dsss技術的通信和抗干擾原理進行模擬分析，分別對時域和頻域下採用dsss技術前後接收信號的頻譜進行分析，驗證dsss技術在本系統中的可行性； （ 2 ）由dsss技術對濾波系統的要求，根據濾波理論分析了巴特沃思型濾波器的逼近原理並設計了合適的濾波電路； （ 3 ）用調制解調晶元sc1128和自行設計的濾波器加之輔助外圍電路，構造出低壓電力線載波通信系統，並採用atmel公司的單片機設計了接收和發射電路的微控制器； （ 4 ）分別對採取抗干擾措施前後輸入和輸出信號進行對比實驗，並對結果進行分析，驗證了dsss技術對干擾信號的抑制作用。
  6. The iteration scheme with errors for zero point of maximal monotone operator in hilbert space

    賦范線性空間中一類運算元的不動點逼近問題
  7. 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曲線、曲面的特點，通過一系列數學變換，將其降階問題轉化為多項式的保上界降階逼近，再應用線性規劃和最優逼近方法求解，給出幾種逼近演算法，並探討通過約束不等式的鬆弛，進一步改進逼近效果。
  8. 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變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  9. One of the important prerequisites for nn to approximate the nonlinear function f ( x ) is the states x of the system should be in a compact set. therefore, the unkown unlinear systems can be expressed by nn and a model error e ( x ), and there exists a positive constant 6 such that e ( x ) < 8. so the problem can be incorporated into robust adaptive control

    神經網路可以逼近非線性函數f （ x ）的一個重要前提是x必須落入某一緊集s中，因此在一緊集u上，未知的非線性系統就可以用神經網路及一建模誤差項（ x ）表示出來，且存在一正的常數，使得（ x ） ，從而這一問題可以歸結到魯棒自適應控制中。
  10. For the nonlinear two - point boundary value problem with both time - delay terms and time - advanced terms driven by the optimal control theory, we build a sequence of nonhomogeneous linear two - point boundary value problems according to the successive approximation approach of constant differential equation

    再利用常微分方程的逐次逼近法，將由系統的最優控制問題得到的即含有時滯項又含有超前項的非線性兩點邊值問題化為非齊次線性兩點邊值問題族。
  11. A new successive approximation damped newton method for nonlinear complementarity problems

    求解非線性互補問題的逐次逼近阻尼牛頓法
  12. The quadratic programming perturbation approximation method for the linear programming problem

    求解線性規劃問題的二次規劃攝動逼近法
  13. Characterizations of some classes of ordered semigroups in terms of ordered ideals

    一類具有線性分母的有理插值樣條的逼近問題
  14. Compared with csm, two examples proved that ann could be trained successfully, even if the available data were insufficient and irregular, while csm showed the limit in selecting model type and non - linear optimization

    兩個實例的應用結果表明:人工神經網路通過神經原作用函數的簡單復合就能逼近有限子集的任意非線性函數，而傳統的統計方法則存在著如何選擇模型形式及非線性優化問題，表現出明顯的局限性，並且統計模型的更新工作相當繁重。
  15. Least - squares solutions for inverse problem of anti - hermitian generalized anti - hamiltonian matrices on the linear manifold and optimal approximation problem

    線性流形上反埃爾米特廣義反漢密爾頓矩陣反問題的最小二乘解及其最佳逼近問題
  16. At last, on several linear manifolds, the conditions for the existence of and the general expressions of the symmetric, skew - symmetric and symmetric semi - definite solution of the linear matrix equation f3 ( x ) = 0 are discussed. and the related optimal approximation solutions are obtained

    最後討論了六類線性流形土矩陣方程兒（ x ） = o分別具有對稱解，反對稱解和對稱半正定解的條件，得到了方程和l一s問題解的通式，同時解決了解的最逼近問題
  17. The objective function of the qp problem is a quadratic function which is an approximation of the lagrangian function of the constrained problem and the constraints of the qp problem are linear approximation of the constraints of the constrained problem

    這些二次規劃子問題的目標函數是原約束最優化問題的lagrange函數的二次某種近似，其約束條件是原約束最優化問題的線性逼近。
  18. Convergence analysis of a successive approximation quasi - newton method for solving nonlinear complementarity problems

    求解非線性互補問題的逐次逼近擬牛頓法的收斂性分析
  19. Both line search and trust region are well - accepted methods in the nonlinear programming to assure global convergence

    線搜索技術和信賴域策略是解非線性優化問題的兩種基本逼近方法，這兩種技術都能用來保證演算法的整體收斂性。
  20. Based on the analysis of the methods for optimizing the fuzzy neural networks before, this paper has finished following works : 1 ) we proposed a learning algorithm based on tabu search for fuzzy neural networks based on the model of anfis proposed by jyh - shing roger jang. then used the system for one variable function ' s approximation. 2 ) based on the first research, we improved the tabu search algorithm for the purpose of approximating complex functions. 3 ) analysis the capabilities of tabu search, and discuss the approximation ability and generalization ability of the fuzzy neural networks system according to the compute results

    本文在對以前的模糊神經網路參數學習演算法進行分析的基礎上，做了以下幾個方面的工作： 1 ）根據禁忌搜索演算法的特點，在jyh - shingrogerjang提出的anfis模型的基礎上，將禁忌搜索演算法應用於模糊神經網路線性和非線性參數的學習上，並將該模型用於單變量函數的逼近； 2 ）在第一階段的基礎上，對演算法進行了改進，使改進后的演算法能夠適用於復雜的ii函數逼近問題; 3 ）根據計算機模擬的結果，對禁忌搜索演算法的性能進行了分析，並對該模糊神經系統的函數逼近能力和泛化能力進行了討論。
分享友人
分享到 Line

分享到臉書