收斂空間 的英文怎麼說

中文拼音 [shōuliǎnkōngjiān]
收斂空間 英文
convergence space
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 空 : 空Ⅰ形容詞（不包含什麼; 裏面沒有東西或沒有內容; 不切實際的） empty; hollow; void Ⅱ名詞1 （天空） s...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  • 空間 : space; enclosure; room; blank; interspace
  1. It is demonstrated that the solution for 141 000 order normal equations for a simulated astro - geodetic network ( 47 057 points ) and a space one ( 476 points ) iterates 4 993 times to converge to 1 10 - 18 second, taking 28 min and 47 seconds, on a pii / 233 computer, showing over 40 times more efficiency, as compared with the coefficients unadjusted

    利用模擬的天文大地網（ 47057點）和空間網（ 476點）在pii / 233微機上解算14 . 1萬階方程組共迭代4993次（收斂至1 10 - 18角秒） ，花費機時28分47秒，與未進行系數調整相比，功效提高40多倍。
  2. In this paper, the upwind scheme and the central scheme are presented for solving 3 - d n - s equations using the cell - center finite volume spatial discretization and four - stage runge - kutta time stepping scheme, with standard convergence acceleration techniques such as local time stepping and implicit residual smoothing

    在n - s方程的數值計算上，採用了中心差分格式和迎風格式，用格心格式的有限體積法進行了空間離散，用四步龍格?庫塔法作顯式時間推進，並採用了當地時間步長和隱式殘差光順等加速收斂措施。
  3. Some sufficient and necessary conditions for the multi - step iterative sequences of the asymptotically quasi - nonexpansive mappings ti to converge to certain common fixed points in the convex metric space are obtained

    摘要研究了凸度量空間中用多步迭代序列來逼近漸近非擴張映象的不動點，並給出了其收斂于不動點的充分必要條件。
  4. The application of sa and heuristic algorithm in packing problem is studied deeply. an improved sa, which utilizes heuristic approach in search tragedy and movement tragedy, is introduced and manifested to enhance the rate of convergence with an extent of exact solution

    對sa演算法和啟發式演算法在布局問題中的應用進行了研究，為提高收斂速度同時保證一定精確度，對sa演算法進行了改進，在演算法的搜索策略和變動策略中應用了啟發式方法，縮小布局狀態空間的搜索。
  5. Then, an improved genetic algorithm is proposed to solve this problem. this algorithm makes trees with the source and all destinations are the space of operation and filter operation. with hybrid selection operator, competition among brothers, greedy operation, filter operation

    然後給出了一種基於遺傳演算法的實時多播路由選擇方法，並用改進的遺傳演算法進行了求解，該演算法採用包含源節點和目的節點的樹作為交叉和變異的空間的方法，通過加入混合選擇、小范圍競爭擇優的交叉變異操作，提高了全局搜索能力和收斂速度。
  6. Because ga possesses the traits of can global random search, the robustness is strong, been use briefly and broadly, it didn ’ t use path search, and use probability search, didn ’ t care inherence rule of problem itself, can search the global optimum points effectively and rapidly in great vector space of complicated, many peak values, cannot differentiable. so it can offset the shortages of nn study algorithm, can reduce the possibility that the minimum value get into local greatly, the speed of convergence can improve, interpolation time shorten greatly, the quantity of training reduce

    因為遺傳演算法具有全局隨機搜索能力，魯棒性強、使用簡單和廣泛的特點，它不採用路徑搜索，而採用概率搜索，不用關心問題本身的內在規律，能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解，所以可以彌補神經網路學習演算法的不足，使陷入局部最小值的可能性大大減少，使得收斂速度提高，訓練量減小。
  7. The convergence of error brought about by the curvature of earth's surface obviously has no counterpart in free space.

    地球表面曲率產生的誤差是收斂的，顯然，在自由空間沒有類似的情況。
  8. Convergence of implicit iteration process for strictly pseudocontractive map in banach space

    空間中嚴格偽壓縮映射隱迭代過程的收斂性
  9. Lastly, the dissertation designs a rank - reduced blind space - time 2 - d rake receiver using time extraction which has not only the capability of space - time equilibrium but also reduces the convergence time of adaptive array and the rank of correlated matrix of the received data

    最後，設計了一種時間抽取降秩盲空時2 - drake接收機。分析了其性能和參考信號的提取方法。該接收機不但具有空時均衡的能力，而且降低了陣列的收斂時間和接收數據相關矩陣的秩。
  10. Some covergence of stochastic processes functional in hilbert space

    空間中隨機過程泛函的某些收斂性
  11. Chapter 2 of this paper, by using a new method of proof, we obtain the weak ergodic convergence theorem for general semigroups of asymptotically nonexpansive type semigroups in reflexive banach space. by theorem 2. 1 of chapter 1 we get the weak ergodic convergence theorem of almost orbit for general semigroups of asymptotically nonexpansive type semigroups in reflexive banach space. by this method of proof, we give the weak ergodic convergence theorems for right reversible semigroups. by theorem 2. 1 of chapter l, we generalize the result to almost orbit case. so we can remove a key supposition that almost orbit is almost asymptotically isometric. it includes all commutative semigroups cases. baillon [ 8 ], hirano and takahashi [ 9 ] gave nonlinear retraction theorems for nonexpansive semigroups. recently mizoguchi and takahashi [ 10 ] proved a nonlinear ergodic retraction theorem for lipschitzian semigroups. hirano and kido and takahashi [ 11 ], hirano [ 12 ] gave nonlinear retraction theorems for nonexpansive mappings in uniformly convex banach spaces with frechet differentiable norm. in 1997, li and ma [ 16 ] proved the ergodic retraction theorem for general semitopological semigroups in hilbert space without the conditions that the domain is closed and convex, which greatly extended the fields of applications of ergodic theory. chapter 2 of this paper, we obtain the ergodic retraction theorem for general semigroups and almost orbits of asymptotically nonexpansive type semigroups in reflexive banach spaces. and we give the ergodic retraction theorem for almost orbits of right reversible semitopological semigroups

    近年來， bruck [ 5 ] ， reich [ 6 ] ， oka [ 7 ]等在具frechet可微范數的一致凸banach空間中給出了非擴張及漸近非擴張映射及半群的遍歷收斂定理。 li和ma [ 13 ]在具frechet可微范數的自反banach空間中給出了一般交換漸近非擴張型拓撲半群的遍歷收斂定理，這是一個重大突破。本文第二章用一種新的證明方法在自反banach空間中，研究了揚州大學碩士學位論文2一般半群上的（ r ）類漸近非擴張型半群的弱遍歷收斂定理，即:定理3 . 1設x是具性質（ f ）的實自反banach空間， c是x的非空有界閉凸子集， g為含單位元的一般半群， s =仕工， 。
  12. By using bruck ' s lemma [ 10 ], passty [ 31 ] extended the results of [ 1, 16 ] to uniformly convex banach space with a frechet differentiable norm. however, there existed more or less limitations in their methods adopted. by using new techniques, chapter2 of this paper discussed the weak convergence theorem for right reversible semigroup of asymptotically nonexpansive type semigroup and the corresponding theorem for its almost - orbit in the reflexive banach space with a frechet differentiable norm or opial property

    Feattieranddotson 16 ]和bose [ l ]通過使用opial引理17 }在具弱連續對偶映照的一致凸b ~ h空間中證明了漸近非擴張映照的弱收斂定理， passty 31通過使用bruck引理10 ]把1 ， 16 ]的結果推廣到具freehet可微范數的一致凸banach空間，然而，他們的證明存在著種種局限性。
  13. The article studies the convergence properties of the sequence, net, filter base and filter in top space, proves the consistency between the convergences of the filter and its corresponding net, and proves the equivalence of filter derived net and its corresponding net

    摘要對拓撲空間中的序列、網、濾子基和濾子的收斂性質進行了研究，證明了濾子收斂與濾子對應的網收斂是一致的，並證明了濾子導出網與對應網是等價的。
  14. Weak convergence of the distribution of independent random variable series in hilbert space

    空間中獨立隨機變量序列分佈的弱收斂性
  15. In the course of modeling, we present multi - step generalized gradient method and multi - stage curve fitting technique, prove convergence of multi - step generalized gradient method by using differential equation stable theory, analyze the error of multi - stage curve fitting technique by using inner space, creat knowledge base of water network system by using the maximum subordinate principle of and near - select principle of pattern recognition. at last we make the optimal running scheme of water network system based on heuristic search technique of artificial intelligence and global feedback immediate coordination method of large scale system theory

    在建立系統模型的過程中，提出了多步廣義梯度法和多層曲線擬合的建模方法，並用微分方程穩定性理論證明了多步廣度梯度法收斂性，用內積空間的有關知識對多層曲線擬合進行誤差分析;應用模糊數學中的最大隸屬度原則和模糊識別中的擇近原則和人工智慧中狀態空間表示法建立注水系統的知識庫;用人工智慧中的啟發式搜索技術和大系統理論中的具有全局反饋的直接協調法制定注水系統的優化運行方案。
  16. Theconvergence towards the weak solution is proved for one - dimensional space with initial and boundaryconditions by using some subtle techniques such as the estimate of spatial derivative, perturbationtheory and weak compactness

    通過使用對空間導數的估計、弱緊性和奇異攝動理論證明了有限元方法的收斂性。
  17. This article probes into the essential characters of the theorem of the equivalence between uniformly convergent topology and compact open topology, resolves the errors and obscurities in the proof of the theorem in bibliography [ 1 ]

    摘要刻畫了映射空間一致收斂拓撲與緊開拓撲等價定理的本質特徵，化解了文[ 1 ]證明之誤及晦澀之處。
  18. The new algorithm starts from an initial estimate which is based on the hough transform, and a rectangular window is centered using the current line approximation, and a new line estimation is generated by making a total least squares fit through the pixels contained within the window. this is repeated until convergence is reached. lastly, we have suggested a new technique which may recover the motion and structure parameters of a moving object by using of 21 optical flow lines based on the optical flow fields of the feature line this thesis is the project supported by aeronautical foundation science ( no. 99f53065 ) and research center of measuring and testing technologies, and control engineering in nanchang institute of aeronautical technology ( no. 2001 - 15 )

    演算法的思路是：首先，在小區域內運用霍夫變換確定直線的初始值；其次，以直線的初始值所對應的直線為中心線，建立一個矩形框；最後，利用矩形框內所包含的邊緣點數據不斷地迭代直至收斂，從而達到進一步修正直線的坐標參數；本文基於特徵直線的光流場，即線流場，建立了一種利用21條光流線確定空間三維物體旋轉運動參數、平移運動參數以及對應的空間直線坐標的線性演算法。
  19. 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編碼結構，即：非鄰接重疊編碼和變尺度編碼，以提高直接梯度學習演算法的收斂速度和泛化性能。
  20. Two popular statistical - based techniques, namely, bayes and dempster - shafer methods are applied to develop radar target identification algorithms for our application. the performance of bayes method and d - s method is compared in convergence time and robustness

    運用兩種普遍使剛的統計推斷方法? bayes方法和d - s證據理論對以上空中目標進行識別，比較了它們的收斂時間和穩健性。
分享友人
分享到 Line

分享到臉書