approximate convergence 中文意思是什麼

approximate convergence 解釋
近似收斂
  • approximate : vt 1 使接近。2 接近；走近。3 近似，約計。4 模擬。5 估計。vi 近於。 His income this year approxima...
  • convergence : n. 1. 聚合，會聚，輻輳，匯合。2. 集合點；【數、物】收斂；【生物學】趨同（現象）。
  1. The relation of radius of curvature and error as well as formulas of increasing parameters on condition of constant error are diverted. the equation of the line on the center of approximate circular arc is obtained ， and it can avoids the trouble that numerical solution owns possibility of no convergence and simplifies node calculation of non - circular curve

    導出了曲率半徑與逼近誤差之間的關系和等誤差條件下的參數遞推公式，建立了通過逼近圓弧圓心的直線方程和圓心坐標計算公式.按這種方法用圓弧逼近平面參數曲線，不需要求解非線性方程組，避免了計算可能不收斂的麻煩，簡化了非圓曲線的節點計算過程
  2. Finally, take example for a non - linear function, method mentioned in this paper is used to design wavelet neural network to approximate this function. the computer simulations confirm the method that is brought out in this paper is useful, and prove that wavelet neural network has not only fast convergence and better precision of approximation, but also good capability of forecasting and escaping error

    最後，對於一個實際的非線性函數，用本文介紹的方法來設計小波神經網路來逼近函數，模擬結果表明該方法的有效性，並且表明小波神經網路在函數逼近上，網路的收斂速度快，逼近精度高的特點，並且網路具有很好的泛化能力和容錯性。
  3. We get the estimates of the upper bounds of hausdorff and fractal dimensions for the global attractors. in section 5. 3, the cauchy problem is studied, by using the weighted function space and the interpolating inequality, the existence of the global attractors for the damped generalized coupled nonlinear wave equations in an unbounded domain is proved. in section 5. 4, the time periodic solution problem of damped generalized coupled nonlinear wave equations with periodic boundary conditions is studied, the existence of time periodic soluation of this problem is proved by using the convergence of approximate time periodic solution sequences

    第五章，考慮了一類廣義耦合的非線性波動方程組，在第二節中討論了周期初值問題，證明了整體光滑解的存在性和唯一性，得到了整體吸引子，給出了hausdorff維數和分形維數的上界估計；在第三節中討論了cauchy問題，利用加權函數和加權空間的插值不等式，證明了無界區域上整體吸引子的存在性；在第四節中證明了時間周期解的存在性。
  4. Their learning and training rules have been analyzed profoundly and their abilities to approximate arbitrary nonlinear function have been testified and compared by the simulation. a new rbf neural network has been presented which uses a raised - cosine function as activation transfer function. it provides a wider generalization in comparison with gaussian rbf neural networks by simulation as well as strong approximation ability, fast convergence, a rule to select the parameters of the networks

    本文詳細研究了兩種典型的前向神經網路（ bp網路和rbf網路）的學習和訓練演算法，提出了一種新穎的基於緊支集餘弦函數的徑向基神經網路，其克服了常用的高斯型rbf神經網路雖具有緊支集但各基函數非正交的不足，其收斂速度快、網路參數選取有理論依據且相比于高斯型rbf神經網路具有更強的泛化能力，模擬驗證了其有效性。
  5. Approximate fixed point sequences and convergence theorems for lipschitz pseudocontractive mappings in banach spaces

    偽壓縮映射的近似不動點序列及其收斂定理
  6. The paper makes simulation studies into the field oriented control systems based on multiplayer feedforward networks and dynamic recursive networks respectively, and compares the convergence speed and approximate extent between the two learning algorithms

    對採用多層前向網路和動態遞歸網路的矢量控制系統分別進行了模擬實驗，比較了兩種學習演算法收斂的快速性和逼近程度。
  7. Chapter 2 establishes the theoretical framework of a class of dual algorithms for solving nonlinear optimization problems with inequality constraints. we prove, under some mild assumptions, the local convergence theorem for this class of dual algorithms and present the error bound for approximate solutions. the modified barrier function methods of polyak ( 1992 ) and the augmented lagrange function method of bertsekas ( 1982 ) are verified to be the special cases of the class of dual algorithms

    第2章建立求解不等式約束優化問題的一類對偶演算法的理論框架，在適當的假設條件下，證明了該類演算法的局部收斂性質，並給出近似解的誤差界，驗證了polyak （ 1992 ）的修正障礙函數演算法以及bertsekas （ 1982 ）的增廣lagrange函數演算法都是這類演算法的特例。
  8. The convergence of approximate solution for galerkin finite elements method and the existence of generalized solutions of the unsteady neutron transport equation in multidimension

    有限元法近似解的收斂性和廣義解的存在性
分享友人
分享到 Line

分享到臉書