比值驗斂法 的英文怎麼說
中文拼音 [bǐzhíyànliǎnfǎ]
比值驗斂法
英文
ratio test for convergence- 比 : Ⅰ動詞1 (比較; 較量高下、 長短、距離、好壞等) compare; compete; contrast; match; emulate 2 (比...
- 驗 : 動詞1. (察看; 查考) examine; check; test 2. (產生預期的效果) prove effective; produce the expected result
- 斂 : Ⅰ動詞1 (收起; 收住) hold back; keep back 2 (約束) restrain 3 (收集; 徵收) gather; collect; ...
- 法 : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
- 比值 : specific value; ratio比值法 ratio method; 比值計 ratio meter; 比值檢波器 ratio detector; 比值控制...
-
The new algorithm bases on bisection and secant iteration, which is different cuppen ' s method and newton iteration. the results of theoretical analysis and numerical testing show that convergent rant of our algorithm is obviously faster that of the classical algorithm
該演算法以割線法迭代為基礎,明顯不同與傳統的newton迭代法,理論和數值實驗表明改進的演算法的收斂性比經典演算法好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的總傳導率之比。The specific research methods include : the reliability and validity of the scale ( cronbach ’ s of the scale, split - half reliability, the reliability of each dimension, discriminant validity, convergent validity ) ; the factor analysis method to get the dimensions of internal service quality ; the independent - samples t - test and paired - samples t - test method to analyze every discrimination of internal service quality ; the comparison of means to evaluate the sequence of every dimension
具體的研究方法包括:對量表進行信度和效度分析,包括整個表的cronbach系數、分半信度、各維度的信度、區別效度和收斂效度的分析;使用因子分析的方法測量內部服務質量包含的維度;採用兩獨立樣本的t檢驗和兩配對樣本的t檢驗的統計方法對內部服務質量各差距進行分析;通過對樣本均值的比較,分別得出各維度在員工和管理者心目中的重要性排序。3 a novel recursive least - square ( rls ) blind space - time receiver algorithm based on the constrained condition, which can completely avoid the matrix inversion introduced into by constraints ( comparing with the normal rls ), is proposed for multi - path slow fading cdma channels. the computational complexity of this method is not only lower than that of the normal rls, but also lower than that of both lms and ls blind space - time receiver methods that are realized based on the rosen ' s gradient projection. and the speed of convergence of the presented rls blind space - time receiver algorithm is better than that of both lms and ls blind space - time receiver methods
3 、針對多徑慢衰落通道下ds - cdma盲空時接收機中線性約束二次規劃問題提出一種新的遞歸最小二乘演算法,該演算法完全避免因約束而引進的矩陣求逆運算(相對于常規的遞歸最小二乘演算法) ,不但運算量比常規的要低,而且比基於rosen梯度投影實現的最小均方( lms )與最小二乘盲空時接收機演算法還低,且收斂速度比基於rosen梯度投影實現的最小均方( lms )與最小二乘盲空時多用戶檢測都好,將提出的新的遞歸最小二乘演算法與提出的數據選擇方案結合起來可以進一步降低其運算量,具有很大的實用價值,最後通過模擬實驗進一步分析了其性能。Using the conic function model local approximation, w. cdavidon ( 1980 ) proposed a class of iterative algorithms with modified matrix combining function value, furthermore under the theory d. c. sorensen has used local quadratic approximation method, then applying collinear scaling idea improving on the above algorithm and generalizing it, getting a class of collinear scaling algorithm, unifying former quasi - newton. in the paper, using local quadratic approximation method, the first, constructing the new collinear scaling gene, getting a class of the new collinear scaling algorithm with briefness and numerical stability, ., we discusses some properties of the algorithm and its local linear convergence, q - superlinear convergence and the whole convergence ; secondly we have made numerical experimentation and numerical analysis ; the last, we have done much discussion for collinear scaling idea and given the several new collinear scaling algorithm
本文的工作就是基於局部二次逼近原理,首先通過構造新的共線調比因子,得到了一類新的更簡潔,數值穩定性更好的共線調比演算法,進而我們給出了本共線調比演算法的局部收斂性,全局收斂性以及演算法q -超線性速度的理論證明;其次,用經典的無約束優化五大考核函數就本共線調比演算法進行了數值試驗和數值分析;最後,就局部二次逼近思想,進行共線調比演算法思想進行更廣泛的討論,給出了幾個新共線調比演算法。Comparing with traditional successive approximation process algorithm, our method can improve quality of reconstruction result while speeding up convergence. further, proper threshold is adopted to enhance the robustness of the histogram constraint.,
和傳統的連續近似迭代法相比,該方法在加快收斂速度同時能夠有效地改善重建質量,同時我們採用閾值對先驗直方圖的影響進行動態地控制,有效地增強了直方圖約束的抗干擾性。We analyze the convergence of the new methods and give some results of numerical experiments in which we compare the new methods with the original subspace iteration method
本文分析了這兩個改進演算法的收斂性,給出了數值試驗的結果,並將新方法與原始子空間迭代法進行了比較。4 ) the euler equation is solved for the combination of wingbody by means of the finite volume method on the unstructured grids. several methods are used for quick convergence and the results are in correspondence with the experiment data
( 4 )應用格心格式的有限體積法對翼身組合體繞流進行了euler方程的數值模擬,同時引入各種加速收斂措施,與實驗相比,得到了較為滿意的計算結果。Numerical result shows that the new method is more efficient in convergence than the standard lanczos algorithm ; the second algorithm generalizes the implicitly restarted arnoldi ( ira ) augmented by soreesen to the implicitly restarted lanczos algorithm, which improves the convergence rate of lanczos algorithm by making good use of the spectral information obtained from the previous process. the last algorithm utilizes deflation strategies to the second algorithm to forming invariant subspace for a, so that the stability can be kept in computing process
數值試驗表明,該演算法比標準lanczos方法具有更好的收斂性;第二種演算法是將求解特徵值問題的隱式循環arnoldi方法( ira )應用於求解對稱不定線性方程組的lanczos演算法,充分利用lanczos演算法過程中的譜信息,確定預處理;第三種演算法是在第二種演算法的基礎上,運用收縮技巧,形成近似不變子空間,以提高收斂速度和數值穩定性。Second, for vector sequence coming from the steep - descent method, we use extrapolation method for the sequence and get some applied algorithms. we also give theoretical proofs for this algorithms. many numerical experiments tell us that the new algorithms sometimes can save 80 % computation
其次,對求解非線性優化問題的最簡潔的最速下降方法產生的迭代序列,運用向量序列加速收斂手段進行了討論,導出了一些實用的加速演算法,並從理論上證明快速演算法的有效性,眾多數值試驗進一步表明:加速收斂的方法相比較加速前幾乎都能夠節約80以上的計算量。分享友人