預處理矩陣 的英文怎麼說

中文拼音 [yùchǔlǐjǔzhèn]
預處理矩陣 英文
preconditioning matrix
  • 預 : Ⅰ副詞（預先; 事先） in advance; beforehand Ⅱ動詞（參與） take part in
  • 處 : 處名詞1 （地方） place 2 （方面; 某一點） part; point 3 （機關或機關里一個部門） department; offi...
  • 理 : Ⅰ名詞1 （物質組織的條紋） texture; grain （in wood skin etc ） 2 （道理;事理） reason; logic; tru...
  • 矩 : 名詞1. （畫直角或正方形、矩形用的曲尺） carpenter's square; square2. （法度; 規則） rules; regulations 3. [物理學] moment
  • 陣 : Ⅰ名詞1 （作戰隊伍的行列或組合方式） battle array [formation]: 布陣 deploy the troops in battle fo...
  • 矩陣 : [數學] matrix; array
  1. Preconditioned matrix and its structure methods

    預處理矩陣及其構造方法
  2. In order to improve the efficiency of the mesh generation, we employ the transfinite interpolation method. in low speed flow ( m < 0. 05 ), the low mach will aggravate the difference between eigenvalues of the system and make the convergence sharply difficult. as for this, we use the preconditioning method to remove it

    另外，我們求解的是極低馬赫數下的流場（ m 0 . 05 ） ，極低的馬赫數會導致可壓流動方程十分僵硬而難以收斂，對此，我們對n - s方程進行了矩陣預處理。
  3. In the case of the main - lobe interference, we construct the preprocessing matrix, which cancels the main - lobe interference before adaptive beam forming. so the main - lobe aberrance is taken off. the dissertation focuses on the dbf of conformal array

    特別針對主瓣內干擾情況下的寬帶自適應波束形成，通過構造圓陣預處理矩陣，消除主瓣內干擾后再作自適應波束形成，解決了主瓣畸變的問題。
  4. 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多項式作用初始向量，使其更接近所要求的特徵向量。第二個改進演算法是對每次迭代所得的殘余矩陣直接進行預處理以改善矩陣特徵值的分佈。
  5. Standard face images are formed through the above - mentioned processing. during the feature extraction, for those standard face images, regarding the between - class scatter matrix as generating matrix, we extract the algebraic features of face images through k - l transform and singular value decomposition

    在人臉特徵提取過程中，對經過預處理的標準人臉圖像，以類間散布矩陣為產生矩陣，通過k - l變換降維並結合奇異值分解來提取人臉代數特徵。
  6. Specifically, according to the w - w five parameters failure theory, the fracture criterion of crack is established, and the state of crack ( open or close ) is judged by the values of the crack strain. combining the two points, the predict - model about the failure of concrete material is established. this predict - model can predict 16 failure forms, and basing the different failure form predicted after crack, the stress - strain relationship matrix of concrete material is adjusted

    具體來講，根據w - w的五參數混凝土破壞理論，建立混凝土的開裂準則，根據開裂應變值來判斷裂縫是張開還是閉合，從而在兩者基礎上建立了裂縫的開裂預測模式，總共有16種開裂模式；裂后根據具體的開裂模式及殘余抗剪能力來調整混凝土的本構關系矩陣，即用等效剛度代替原有剛度，考慮到垂直於裂縫方向的剛度為零，這樣會使裂后的總剛出現病態，為此文中通過引用鬆弛系數來對出現裂縫的單元進行預處理，一方面可解決因過大的舍入誤差導致計算結果的不可信問題，另一方面就是可加速收斂。
  7. An on - line minimum - variance estimator was developed for thrust acceleration applied to orbit transfer using discrete - time radar measurements. the mass - flow - rate of propellant was selected as a state variant, which was estimated by employing an integral state model and ekf filter. the variation equations for measurement vector to mass - flow - rate have been established to linearize the discrete - time measurement equations. the algorithm has applied successfully to maneuver process in commanding satellite into geo - stationary orbit. the results show that the algorithm developed here can monitor and determine whether engine works well or failure precisely and quickly during orbit transfer process

    飛行器軌道機動過程中，為跟蹤、定位機動目標和干預機動控制過程，需要統計處理離散的雷達觀測量實時估計推進發動機的推力，進而確定飛行器的瞬時軌道參數.本文所述演算法是該工程問題的探討和解決方案.文章建立了軌道機動過程中連續變質量運動模型和離散雷達量測模型，推進發動機的質量秒耗量作為表徵推力加速度的一個近似常量，應用擴展卡爾曼濾波對離散的雷達測量數據進行順序統計處理給出秒耗量的最小方差估計;文章詳細地推導了線性化量測模型的變分方程和觀測矩陣;模擬結果表明該演算法能快速、準確地估計推進發動機的質量秒耗量和向機動目標施加的實際推力
  8. The other are a hybrid preconditioning strategy, in which a simple pivoting preconditioner is used in combination with the standard inverse - midpoint method and a new scheme for selecting the real point in formulating interval newton equation

    使用混合預處理和優化實數向量：所謂混合預處理，就是聯合了標準中點逆矩陣預處理和中樞預處理。優化實數向量就是選擇合適的實數向量來縮小線性區間等式的解向量n （ x ）所包括的范圍。
  9. As for the numericial mthods we present a method using newton iteration and lp ( lift - projection ) iteration to slove inverse real symmetric eigenvalue problems. then wo can choose any starting points, then wo can get good starting value for the purpose of the preconditioning the numerical examples show the method is efficient and available

    對于數值演算法，將lp迭代和一般的newton迭代法結合起來求解含參變量的實對稱矩陣特徵值反問題， lp迭代預處理了newton迭代法的初始值，拓寬了newton迭代法初始值的選取范圍，數值例子也說明lp ? newton法具有較高的效率和實用性。
  10. Considering the features of fingerprint. i. e. the local orientation, we employ a preprocessing algorithm based on double coordinates, not based on gray level distribution

    摘要本文提出了一種基於雙坐標系的指紋預處理方法，通過計算指紋圖的局部方向矩陣而非基於灰度分佈來求解灰度方向。
  11. Based on the formers, this dissertation efficiently selects the face features abstracting using ica. with no decline of recognition rate, the feature dimension is reduced, so the course of recognition is accelerated. support vector machine pattern recognition method is based on vc dimension theory, adopting the srm principle and considering training error and the generalization ability, which has shown many special advantages in dealing with small samples, non - linear and pattern recognition in high dimension

    本文採用基於矩陣s的人臉表示方法，將ica特徵選擇的概念和演算法用於人臉特徵的提取和優化，在不影響識別率的情況下，降低了特徵維數，提高了識別速度；支持向量機（ svm ）模式識別方法基於vc維理論，採用結構風險化原理，兼顧訓練誤差和泛化能力，在解決小樣本、非線性及高維模式識別問題中表現出許多特有的優勢；對于多類問題，介紹並採用了「一對一」的策略進行svm分類器設計；對于圖像預處理，詳細介紹了幾何歸一化的演算法步驟。
  12. For the first time in china the ebe - pcg and ebe - bictstab algorithin have been got by combining ebe technology with pcg and bicgstab, and precondition matrix on the basis of ebe has been attained

    本文首次將ebe技術與pcg和bicgstab迭代法結合起來，得到并行的ebe - pcg演算法和ebe - bicgstab演算法，選取了基於ebe的預處理矩陣。
  13. Instead, there needs to store only the original coefficient matrix, some auxiliary matrices for the preconditioner and several vectors in the iteration methods. further, the core of the iteration is the matrix - vector multiplication and the solution of the auxiliary equations corresponding to the preconditioner. if the solution of the auxiliaries spend not very much, the computational cost in each iteration step will be very cheap, due to the fact that the sparsity of the matrix can be exploited sufficiently

    與直接法相比，迭代法只需存儲原系數矩陣、對應于預處理的幾個輔助矩陣與少量幾個向量，且迭代中除求解輔助線性方程組外，其餘的計算主要是稀疏矩陣與向量乘積，從而能充分利用稀疏性減少計算量，但迭代法的收斂速度一般與系數矩陣的譜分佈有關。
  14. In chapter 3, we discuss the problem of doa estimation in the presence of spatially nonstationary noise fields. an estimate of the colored noise covariance matrix is firstly given. the received data for parameter estimation is then prewhitened using the estimated noise covariance, hence, overcoming the highly biased estimates. finally, adaptive beamforming with the modified weight is also performed. computer simulations show that the proposed method can completely remedy beam distortion. 3

    在第三章討論了一種在環境噪聲為白噪聲而陣元噪聲為空間非平穩情況下的doa估計問題，給出了一種有效的估計陣元噪聲功率的方法，進而利用估計的噪聲協方差矩陣進行預處理而實現色噪聲環境下的doa估計，理論分析和模擬結果均表明了本章提出的方法的有效性。
  15. We firstly introduce several presentations of fundamental matrix, which are theoretical foundations of the algorithms for fundamental matrix. as to two images, we give the algorithins which preliminarily process data to inhibit noises. then we give robust algorithms

    首先介紹基本矩陣的幾種表示，它們是基本矩陣演算法的理論依據；對于兩幅圖像，給出了對圖像數據進行預處理以抑制噪聲的演算法，進而給出魯棒性演算法；最後根據三幅圖像的射影約束，我們提出了基於三幅圖像的6點ransac演算法，這是一種非常魯棒的演算法。
  16. In normalization of the iris image preprocessing stage, the iris image is normalized into a 64 1024 grey pixel image. after normalization, the normalized image is divided into three parts and then these parts are divided into eighteen bands

    接著，在虹膜圖像預處理的歸一化演算法中，本文採用直角坐標與極坐標映射理論把定位后的圖像歸一化到一個64 1024的灰度矩陣中。
  17. The method ' s advantage is that can improve the calculation ' s stability and can avoid the species ' density to become negative during the calculation

    同時?用了時間預處理矩陣的線性化方法，較好地解決了非平衡化字反應與流場耦合的剛性問題。
  18. After a brief description of concepts involved in the paper, such as rough set theory and the indiscernibility relation, the methods of how to preprocess the loss value of data and how to discrete the data are discussed. the algorithms of attribute < wp = 6 > reduction and value reduction in rough set theory are researched in depth, and then the ordinary reduction algorithms are given. the improved algorithms based on discernibility matrix and decision matrix are put forward

    論文在對所涉及的粗糙集理論以及不可分辨關系等概念進行了簡要的闡述后，接著對數據缺失值如何進行預處理以及如何進行數據的離散化處理等方法進行了探討，然後展開了對粗糙集理論中屬性約簡以及值約簡等演算法更進一步的研究，給出了常規約簡演算法，並在此基礎上提出了基於可辨識矩陣以及決策矩陣的改進演算法，結果表明演算法具有更高的約簡效果。
  19. To sidestep the deficiency of sampling way, we take a precondition on the initial polynomial system, and use the optimal solution of new system to approximate the optimal solution of initial system

    針對矩陣montecarlo方法的特點，本文提出了對多項式系統的預處理，並用預處理之後最小m -齊次b zout數對應的分組來近似原方程組的最優分組。
  20. The high - vectorization of multinomial preprocessing conjugate gradient method makes it be effectively realized in large - scale parallel structure

    多項式預處理共軛梯度演算法的高度向量化，且不需要構造全局矩陣，它在大規模并行結構中能被有效地實現。
分享友人
分享到 Line

分享到臉書