迭代加法 的英文怎麼說
中文拼音 [diědàijiāfǎ]
迭代加法
英文
iterative addition-
Parallel algorithms of accelerative iteration for solving implicit difference equations
求解隱式差分方程的加速迭代并行演算法Finally, this thesis explored incremental algorithm, which featured normally in addable and non - iterative with some advantages, such as applicable to large and dynamic database, lower demand for memory, implementation of parallel processing and incremental update
增量演算法的要求是聚類特徵一般是可加的、非迭代的，該文提出了一種基於密度的網格聚類演算法gdclus ，並在此基礎上提出了增量式演算法igdclus 。The procedure functions in the compare between partial image of dynamic collection and corresponding image of the airscape. in chapter 5, basing on the analysis of correlative theory of digital image, we introduce the improved fasted - down algorithm and simulative anneal algorithm, which applies to nn calculation, an d bring forward the unique and effective means, correlative original value evaluation. basing on the combination of correlative arithmetic, a stable, high - speed and exact correlative arithmetic is formed, which makes it possible to apply computer vision detection of single - needle quilting in industrial production
本文展開研究並取得一定成效：構建了基於pci總線的微機實時圖像採集系統；在採集的布料總圖（鳥瞰圖）的基礎上，通過數字圖像的數字濾波、圖像增強、邊緣檢測等處理，提取布料圖像的邊緣，對輪廓的矢量化的象素點進行搜索，得到相應的圖案矢量圖，從而確定絎縫的加工軌跡，生成加工指令；在進給加工過程中，主計算機對動態局部圖像與總圖（鳥瞰圖）的對應部分進行圖像相關的匹配計算，應用數字圖像理論，結合神經網路計算的改進最速下降法和模擬退火演算法，提出獨特而有效的相關迭代初始值賦值方法，形成穩定、高速和準確的相關運算，實現單針絎縫視覺測量和自動控制。A new numerical procedure for analyzing the coupled vibration of a framed arch bridge with a single moving vehicle is presented to solve the equations of motion of a bridge with many degrees of freedom. the procedure consists in dividing the bridge - vehicle systems, which are solved separately, into 2 subsystems at the interface of the bridge and vehicle. the compatibility at the interface is obtained by an iterative procedure with aitken acceleration
本文提出新的計算橋梁車激振動反應的方法，車?橋系統被分成兩個相互作用的子系統，這兩個子系統通過接觸點的協調條件耦合在一起，從而應用aiken動態加速法對橋梁運動方程、車輛運動方程和車?橋耦合方程進行高效迭代求解。Compared with straight ray tracing, inversion of bending ray tracing is better when data of test are accurate. on the other hand, natural weight is introduced and numerical simulations and experiments of wlm on inversion of velocity and attenuation are also made, which show that wlm, with resistance of noises and convergence of iteration, may get good re - construction images
本文引入了物理意義明確的自然權，對基於自然權的加權阻尼最小二乘反演演算法（ wlm ）在速度反演、衰減反演中進行了數值模擬和試驗研究，結果表明wlm均能獲得良好的重建圖像，迭代收斂，抗噪能力強。In this dissertation, we firstly prove that any dirichlet problem is indeed equal to a voltages problem of networks. we give five solutions to dirichlet problem in two dimensions ; among these five solutions, we prove that the iteration solution and the solution of relaxations are exponential convergence, then we estimate their respective convergence rates ; secondly, we discuss random walks on general networks, prove that there is an one to one correspondence between networks and reversible ergodic markov chains ; thirdly, we give probabilistic interpretation of voltages for general networks : when a unit voltage is applied between a and b, making va = 1 and vb = 0, the voltage vx at any point x represents the probability that a walker starting from x will return to a before reaching b ; furthermore, we study the relationship between effective resistance and escape probability : starting at a, the probability that the walk reaches b before returning to a is the ratio of the effective conductance and the total conductance
本文證明了任何邊值的dirichlet問題都可轉化為求解電路電壓的問題：給出了計算平面格點上dirichlet問題的5種方法：證明了迭代法和松馳法都是指數收斂的，並分別給出收斂速度的估計；討論了一般電路上的隨機徘徊，驗證了電路與可逆的遍歷markov鏈是一一對應的；給出了電路電壓的概率解釋：當把1伏電壓加於a ， b兩端，使得v _ a = 1 ， v _ b = 0時，則x點的電壓v _ x表示對應的markov鏈中，從x出發，到達b之前到達a的概率；進一步地，給出了逃離概率與有效電阻之間的關系：從a出發，在到達b之前到達a的概率為有效傳導率與通過a的總傳導率之比。Through ( multi - level ) bordered block partition of the power system topology matrix, a bbdf coefficient matrix which is suitable for above decomposition is formed. when the equation is solved with parallel iterative method, convergence acceleration is achieved through damping newton method
通過採用（多重）對角加邊的方法進行電力網路拓撲分割，以形成適合以上分解法求解的對角加邊形式的系數矩陣，并行求解后並對迭代過程進行阻尼牛頓法修正，以達到加速收斂的作用。A normal transform is introduced, and there are enough much grids in the region between the critical layer and the wall, where the variation of the disturbance is the quickest. the finite - difference of governing equations with fourth - order accuracy in the normal direction is utilized in full regions including points close the wall, and is very important for accurately discreting equations. the combination of global and local methods is implemented, and a new iterative formula is derived
對于曲線坐標系下的拋物化穩定性方程，文中發展了求解的高效數值方法:引進法向變換，使得在臨界層與壁面之間的擾動量變化最快的區域有更多的法向網格點;導出包含邊界鄰域在內的完全四階精度的法向有限差分格式，這對方程精確離散至關重要;採用全局法和局部法相結合的方法及其新的迭代公式，大大加速收斂並得到更精確的特徵值。Abstract : based on the iterative bit - filling procedure, a computationally efficient bit and power allocation algorithm is presented. the algorithm improves the conventional bit - filling algorithms by maintaining only a subset of subcarriers for computation in each iteration, which reduces the complexity without any performance degradation. moreover, a modified algorithm with even lower complexity is developed, and equal power allocation is introduced as an initial allocation to accelerate its convergence. simulation results show that the modified algorithm achieves a considerable complexity reduction while causing only a minor drop in performance
文摘:基於迭代的比特和功率分配機制，提出了一種低復雜度的比特和功率分配演算法.與傳統的迭代分配演算法不同，該演算法在每次迭代中只需要比較幾個特定的子載波.該方法在保持傳統迭代演算法性能的前提下極大地減小了迭代分配演算法的復雜度.此外，通過選擇等功率分配方案作為初始方案加快了演算法的收斂速度，進一步降低了演算法復雜度.模擬結果表明，提出的改進演算法在基本不犧牲系統性能的前提下有效地降低了演算法復雜度Using iterative reweighted least squares method for evaluating flatness errors
使用迭代重加權最小二乘法求解平面度誤差The detail is clarified as follows : l ) based on the chaotic technology and contemporary encryption approach the paper put forward a new chaotic sequence, which introduced the m - sequence and the method of shrink key - the stream generator. the complexity of the sequence was promoted as the random alteration of the parameters of chaotic mapping, and at the same time, the shrinking key was used to enhance the security further more ; 2 ) the performance of one - way hash function was improved and new hash function construction methods are proposed through a novel hash method based on chaotic mapping and the aes - the rijndael algorithm. the algorithm of hashing messages of arbitrary length into 256 bits hash values was designed
按照這種方法，輸出序列的周期性得以大大提高，理論分析和計算機模擬結果表明，該方法可以產生具有良好統計特性的密鑰流，而且易於軟硬體實現： 2 ）實現了一種基於混沌映射和分組密碼rijndael演算法的單向hash函數的構造方法，即使用logistic混沌映射產生混沌二值序列，序列的分組與明文序列分組進行按位異或后，進入rijndael加密模塊，所得的結果再加入到反饋端，參與下一分組輸入的異或運算，迭代結束時的rijndael加密結果即為所求的hash函數值。The main part of this hybrid algorithm is a chebyshev iteration which applies chebyshev polynomials to act on initial vectors and makes the obtained vectors close to the wanted eigenvectors ; the second one is the preconditioning subspace iteration method which uses a preconditioning matrix to impact the residual matrix obtained from the iteration procedure, so the distribution of eigenvalues is improved
第一個改進演算法是用chebyshev多項式加速的子空間迭代法，它是用chebyshev多項式作用初始向量，使其更接近所要求的特徵向量。第二個改進演算法是對每次迭代所得的殘余矩陣直接進行預處理以改善矩陣特徵值的分佈。It also gave out some reference for the future soc. the fec system can increase the error - correcting ability if we increase the iterative times, which express the excellence of top - down designing and blocking
在本文所提出的糾錯系統的基礎上，通過增加解碼迭代次數，可以根據要求提高糾錯能力，這使糾錯系統的升級成為可能，再次體現了top - down和模塊化設計方法的優越之處。Secondly, with combination of a certain type of radar, the application of genetic algorithm to optimum code selection and the iteratively reweighted least - square mismatched filter design for sidelobe reduction are discussed. the favorable experimental results are obtained, especially for 64 phase code
最後，我們結合某型雷達，以64相碼信號為例，說明了遺傳優化演算法在編碼搜索中的優越性，並採用了迭代加權最小二乘演算法來設計失配濾波器以達到相位編碼信號的優化副瓣抑制目的，且給出了相應的模擬結果。First of all, the algorithm base on the boundary problem of helmholtz equation and finite - difference technique, calculate the field in “ cold ” cavity and disperse the helmholtz equation, as a result of the formula : ax = x. secondly, according to the eigenvalue of matrix theory and applied iterative methods, eigenmode adopt a numerical approach which allows the improved chebyshev polynomial iteration which based on the power method to extract the isolated eigenmode in the spectrum. finally, we resolve the problem of compatibility in software and insert the eigenmode module into the chipic which will have the function of eigenmode analysis
具體的說: （ 1 ）首先以電磁理論中的亥姆霍茲方程的邊值問題理論和計算電磁學中的有限差分法為基礎，計算冷腔中的場分佈並離散亥姆霍茲方程，得到標準的本徵值問題: ax = x ; （ 2 ）然後根據矩陣理論中的eigenvalue問題和數值計算中的迭代方法，採用改進后的chebyshev多項式，在power迭代法的基礎上對ax = x進行多項式迭代，實現對頻譜中孤立本徵模的萃取; （ 3 ）最後將用fortran語言編制的eigenmode模塊加入到chipic軟體中，解決了eigenmode模塊與chipic主代碼的兼容問題，從而實現了chipic軟體的模式分析功能。On the other hand, the irls algorithm is employed to design mismatched filters for other signals, such as linear frequency modulated chirp. the methods of improving tolerance of low doppler shifts are given finally
同時我們還將迭代加權最小二乘演算法推廣應用於其它信號形式的脈沖壓縮濾波器設計，並提出了有關多普勒頻率性能的改善方法。Further more, with the knowledge of the relations between new and old samples, the article put forward the iteration algorithm of the weight in ordered samples " weighted least - square estimation, the model if good at forecasting
其次，在新樣品與原樣品的關系確知的情況下，該文提出了有序樣品的加權估計中權重的一種迭代取法，再進行新預測，效果顯著。Finally according to the load - capacity superposition concept, a simplified design equation for determination of the load capacity of circular composite columns with h - shaped and box - shaped structural steel is proposed. through comparison with the accurate computer - based method, it is found that the proposed simplified equation is accurate enough and can meet the requirement of practical applications
同時基於承載力疊加的概念，提出了配置工字型和箱型結構鋼的圓形截面組合柱在單向和雙向偏壓荷載下的承載力簡化計算公式，通過與精確的計算機數值迭代方法的比較發現，當荷載偏心較小時該簡化計算公式具有足夠的準確度，能夠滿足工程應用的要求。In the thesis a new count expression of mesh fractal dimension is introduced, on the basis of it the storage and operation counts of directs solution methods, assembly global stiffness iterative methods and ebe iterative methods have been analyzed and compared, a conclusion has been obtained that the storage and operation counts of direct solution methods is the most, the storage counts of the ebe iterative methods is the least. estimating compute scale for ebe iterative methods at shuguang 2000 parallel computer, it is make out that compute scale is large in the extreme if make the most of the memory of every processor. by analyzing the parallel compute performance of 2d upend - step flow calculation, it is proved that ebe iterative methods can achieve upper speedup rations
本文還提出了一種網格分維新的計算公式，並基於網格分維對直接解法，組集總剛矩陣的迭代解法和基於ebe的迭代解法等三種方法的存儲量和計算量進行了分析和比較，得出了直接解法無論存儲量和計算量均最大，基於ebe迭代解法存儲量最小的結論；在曙光2000并行機上估計了基於ebe迭代解法的計算規模，說明只要充分利用各處理機的內存，可解問題的規模是非常巨大的；對二維倒臺階流并行計算進行了性能分析，表明基於ebe策略的迭代解法能獲得較高的加速比。This paper deals with the existence of two positive solutions for critical elliptic equations with a changed sign perturbation and with an auxiliary condition. first of all, the super - sub - solution can be obtained by this positive solution and by the auxiliary condition if perturbation is the positive side of the changed sign perturbation, and then the equation has a positive solution by the method of monotone in teraction and by the maximum principle. because that the positive solution of the equation isnt monotone to parameter. although all of the equations have a positive solution to two given parameters, the existence of the positive solutions of its equation to a parameter between the two given parameters cant be proved. finally, if the first positive solution exits the second solution for the equation can be proved by the mountain pass lemma. 7refs
討論了帶變號擾動並且具有一定附加條件的臨界橢圓方程的兩個正解存在性.首先由變號擾動的正部對應的方程的正解和附加條件構造出原方程的一個上、下解，再由迭代方法和極值原理得到方程的第一個正解.考慮到方程的正解對參數沒有單調性，因此，即使對于兩個使得方程都有正解的參數，但在這兩個參數之間的參數對應的方程不一定有正解.最後，如果方程存在第一個正解，那麼由山路引理可得到方程的另一個正解.參7分享友人