收斂插值法 的英文怎麼說

中文拼音 [shōuliǎnchāzhífǎ]
收斂插值法 英文
interpolation by convergents
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 插 : 動詞1. （把細長或薄的東西放進、擠入、刺進或穿入; 插上; 插進） stick in; insert 2. （中間加進去; 加進中間去） interpose; insert
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  1. A new harmonic analysis method for electric power systems based on triangle basis functions neural network was presented, the convergence theorem of the algorithm was proposed, and a window function and interpolation algorithm were employed to correct the frequency of fundamental waves

    摘要提出了一種新的基於三角基函數神經網路的電力系統諧波測量方法，給出了該神經網路演算法的收斂定理，並採用加窗插值演算法修正基波頻率的準確度。
  2. The main innovation of our method is that we only need construct polygonal mesh possessing simple symmetric properties on both sides of control polygon edges of interpolated curves, and do n ' t need modify the subdivision rules near the interpolation curves during the process of subdivision. thus the subdivision rules are simple. the process is convergent and the limit surface is c everywhere except a finite number of points

    該方法的主要創新思想是，在被插值曲線的控制多邊形兩側構造具有簡單對稱性質的多邊形網格，而在細分過程中，則無須修改被插值曲線附近的細分規則，兇此細分演算法是簡單的，細分過程是收斂的，且最終的插值曲面除有限個點外是c ~ 2連續的。
  3. In this paper, we analyze difference solutions of the burgers - kdv type equations with the periodic boundary condition by use of functional analysis method. the existence of difference solutions is proved by fixed - point theorem and the priori estimates of the difference solution are obtained using interpolation formula of sobolev space. the convergence and stability are proved

    本文應用泛函分析方法對一系列burgers - kdv型方程周期邊值問題的差分解進行了分析，運用各種不動點原理證明了差分解的存在性，應用sobolev空間的離散內插公式得到了差分解及其各階差商的先驗估計，利用得到的先驗估計證明了差分解的收斂性和穩定性。
  4. When a < 0, move / v to the right side and look upon it as source term. the calculation result shows that the r indirect method can compute deeper than k indirect method in subcritical system. but the y indirect method has no inner iteration, it ca n ' t ensure the convergence of neutron flux and it will also fail in deep subcritical

    作參數的嘗試插值法把/分情況處理，當由插值法得到的新值大於零時，仍將/放在輸運方程左端作為吸收項，若0 ，則將其移至右端作為源項處理計算表明，該方法比作參數的嘗試插值法算得的次臨界度深一些，但由於沒有內迭代過程，不能保證通量收斂，在深次臨界情形下同樣會失效。
  5. There are many papers ( cf [ l ] - [ 3 ] ) have studied the method and error estimate for boundary integeral equation and elliptic boundary value problems, and obtain some superconvergent results by varied post - processings such as interpolation, average and extrapolation etc. in this paper, we mainly study the galerkin solution for first - kind boundary integeral equation and elliptic boundary value preblem. further more we can obtain superconvergence results by ( l _ ( 2 ) project ion ) least - squares processing for derivative of elliptic boundary value problems

    對于邊界積分方程與橢圓邊值問題的解法及誤差估計已有很多文章（參[ 1 ] - [ 3 ] ）研究，並且通過各種后處理如插值、平均、外推等得到一系列的超收斂結果，本文則著重探討一型邊界積分方程galerkin解通過l ~ 2投影（最小二乘）運算元處理后以及橢圓邊值問題的導數進行l ~ 2投影（最小二乘法）處理后可獲得超收斂結果。
  6. Later on, after elaborating the disadvantages of the old methods in detecting and recognizing moving objects, a series of corresponding approaches are proposed, such as grid scan, local tracking bug and dynamic window in object tracing to reduce the huge data needed to be processed, maximum and minimum for selecting a proper segmentation threshold and improved conversion from rgb model to hsv and so on to decrease the influence of inhomogeneous lighting and the color noise, a bilinear interpolation in each quadrant to eliminate the bad effect on the recognition precise because of the distortions of the camera. after that, much emphasis is given on application study in pattern recognition with a feed - forward neural network. both the basic bp algorithm and improved bp algorithm in the study process are described in detail, and the later is used to quicken convergence speed and improve validity of the network

    然後，分析和闡明了傳統的運動目標檢測方法的不足，並在此基礎上結合研究中的實際實驗環境，提出了一系列解決方法，包括針對降低龐大數據量而提出的網格掃描、局部「跟蟲」追蹤和動態窗口掃描等目標檢測方法，針對實驗環境中光照不均和顏色干擾提出基於人機交互的最大最小值閾值選取方法和引入改進的rgb模型到hsv模型的轉換方法，為消除圖像畸變對識別精度的惡劣影響而採用的通過控制點進行雙線性插值進行畸變校正的方法；緊接著，概述了神經網路的發展歷史和幾種常用神經網路模型的特點，重點研究了前饋型神經網路在模式識別中的應用問題，詳細闡述了基本的bp演算法和學習過程中bp演算法的改進，從而使網路收斂速度更快，解決問題更有效，並在此基礎上，設計了一個基於bp神經網路的運動目標識別系統，給出了實驗結果。
  7. First, we present the equivalent variatial formulations of the least - squares mixed method and prove the existence and uniques for the weak problems. on the basis of l2 - projections and raviart - thomas projections, we obtain the superconvergence of the least - squares mixed finite element approx - imations on uniform triangulations, where triangular mixed finite elements of the lowest order raviart - thomas spaces are used to approximate the flux p. in the second chapter, we briefly recall the standard and mixed finite methods for second order elliptic problems, and introduce a modified least - squares mixed method

    作者首先導出了最小二乘混合元方法的等價變分形式，並且證明了變分問題廣義解的存在唯一性；在此基礎上，我們採用強一致三角形剖分，選取最低階的raviar - thomas空間對未知函數的通量進行逼近，利用l ~ 2投影和raviart - thomas投影，得到了插值投影和最小二乘混合元解之間的超收斂結果。
分享友人
分享到 Line

分享到臉書