矩陣迭代 的英文怎麼說

中文拼音 [jǔzhèndiědài]
矩陣迭代 英文
matrix iteration
  • 矩 : 名詞1. （畫直角或正方形、矩形用的曲尺） carpenter's square; square2. （法度; 規則） rules; regulations 3. [物理學] moment
  • 陣 : Ⅰ名詞1 （作戰隊伍的行列或組合方式） battle array [formation]: 布陣 deploy the troops in battle fo...
  • 迭 : Ⅰ動詞（輪流; 替換） alternate; change Ⅱ副詞1 （屢次） repeatedly; again and again 2 （及） in tim...
  • 代 : Ⅰ動詞1 （代替） take the place of; be in place of 2 （代理） act on behalf of; acting Ⅱ名詞1 （歷...
  • 矩陣 : [數學] matrix; array
  1. In the self - calibration scheme, the thesis emphasizes the accuracy of camera intrinsic and extrinsic parameters. we presents an accurate f method based on corresponding point adjustment. the method adjusts coresponding points according to the fixedness of projective transformed cross ratio, then calculates f matrix accurately through linear and non - linear methods. when computing intrinsic parameter, a matrix, we simplify the step, and stress on the two important parameters of a. the result will be getten through solving kruppa equation based on svd decomposition. in order to compute extrinsic parameters, we use linear method to get initial r and t, then apply non - linear method to accurate them

    提出了基於匹配點調整的f求精方法，先根據攝影交比不見性對手工選擇的匹配點進行調整，再用線性、非線性結合的方法求精f矩陣；在計算內部參數a中，進行了一定的簡化，把重心放在a中重要的兩個參數上，用svd分解法計算kruppa方程；在計算外部參數時，首先用線性法求解r 、 t ，然後再用非線性法迭代求精。
  2. Iterative approximation algorithm of hessian matrix in structural optimization

    結構優化中的海森矩陣的近似迭代方法
  3. A preconditioned iterative method for h - matrices systems

    矩陣方程組的預條件迭代法
  4. However, in existing global newton ' s methods a linearized variational inequality subproblem has to be solved at each iteration, whose computational cost is equivalent with a qp problem, and the local fast convergence is usually established theoretically incompletely

    通過應用fiseher一burmeister非線性互補問題函數， h . qi和l . qi在17 ]中對以前的qp一free演算法做了有效的改進，使得迭代矩陣的一致非奇異性得到保證。
  5. Consequently, on the basis of non - winkler foundation model, a finite - element method that utilizes foundation flexibility matrix into iterative calculation is proposed in this paper originated from the item " the optimal design theory and research of pile capping beam " sponsored by natural science fund of hunan province, which the continuity of soil mass can be accounted for under various boundary conditions, different loadings and irregular beam characters

    本文結合湖南省自然科學基金項目「樁基承臺梁優化設計理論與方法研究」 ，針對非文克爾地基（半空間、線性變形層或單向壓縮層地基模型等）上的樁基承臺梁，提出一種利用地基柔度矩陣來進行迭代的有限單元法，可充分考慮梁下土體的連續性，並對基礎與土體脫開、承臺梁截面變化、梁體邊界條件復雜、上部荷載類型變化以及梁下基樁承載力差異等情況進行分析計算。
  6. 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

    通過採用（多重）對角加邊的方法進行電力網路拓撲分割，以形成適合以上分解法求解的對角加邊形式的系數矩陣，并行求解后並對迭代過程進行阻尼牛頓法修正，以達到加速收斂的作用。
  7. In the end, the impedance matrix of any three - dimensional conducting object can be portioned into sub - matrices by the projection iterative method ( pim ), the surface current and rcs can be calculated with convergent iterations, the wide - band electromagnetic scattering characteristics of three - dimensional conducting objects are also analyzed with the asymptotic waveform evaluation technique

    最後應用投影迭代方法（ pim ）將三維導體目標的阻抗矩陣剖分成小矩陣，通過迭代計算出表面電流和雷達散射截面，並與漸近波形估計技術結合分析了三維導體目標的寬帶電磁散射特性。
  8. The property shows that the maximal solution is well - conditioned. two new iteration methods for finding the maximal solution are proposed. of these two methods, one is a linearly convergent iteration without matrix inversion, and one is related to newton s method and quadratically convergent

    這2種方法，一種是線性收斂的，其優點是迭代過程不需要求矩陣的逆另一種是二次收斂的，數值試驗的結果表明該方法在計算速度和精度方面都明顯地優于現有的其他幾種迭代方法。
  9. We analyze the assembly model and propose a mathematics model and tree - representing model of the assembly who not only has a small data size, but also can be manipulated easily. this thesis not only gives the virtual representing concept the instance representing one, but also defines the concept of assembly constraint such as coupling, being alignment, being coaxial and being equidirectional. based on such concepts, a revised newton - raphson iterative algorithm is proposed, which can deal with the singularity and ill - condition of jacobi matrix

    首先分析了裝配體的模型問題，提出了裝配體的數學模型及樹形式表示的裝配體表示模型，模型具有數據量小、操作簡單的優點：文章對所涉及的約束諸如耦合、對齊、同軸、同向的裝配體位置描述概念進行了定義，引入了裝配約柬概念，從而提高了裝配設計效率；在此基礎上，文章討論了裝配約束的求解方法，提出了newton rapson迭代法的改進演算法，使得系統能更好地處理jacobi矩陣的奇異和病態的情形。
  10. Initial vector and iteration control in the matriy iteration method

    矩陣迭代法求結構自振特性的初始向量及循環控制
  11. 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多項式作用初始向量，使其更接近所要求的特徵向量。第二個改進演算法是對每次迭代所得的殘余矩陣直接進行預處理以改善矩陣特徵值的分佈。
  12. 4. because there are sub - elements in a member with the introduction of inner joints, when tile spatial stifmess matrix of main joints of a member is made, there are some cases of solving the double nonlinear equations, negative stifmesses, and singular stiffness matrices in process of iterating

    4 、由於引入了內結點，構件存在子單元，在形成主節點的構件空間單元剛度矩陣時，存在雙重非線性方程求解，迭代過程中負剛度和剛度矩陣奇異問題。
  13. We use a scaling matrix which make the algorithm generate sequences of point in trust region and the interior of the feasible set. because of the boundedness of the trust region, trust region algorithm can use non - convex approximate models

    構造合理的仿射變換矩陣，在投影空間構造信賴域子問題，產生迭代方向，使迭代點既保持在信賴域內，又是嚴格可行域的內點。
  14. In the first part, we study three kinds of pre - conditioners - - block - triangular preconditioner, constraint preconditioner and block - diagonal preconditioner respective1y and fast iterative so1vers for indefinite 2 by 2 b1ock linear systems with zero ( 2, 2 ) block. the spectrum and form of eigenvalues of each preconditioned nlatrix are presented. all of the three kinds of preconditioned linear systems are so1ved by gmres ( 20 ) and theii efficiencies are cornpared

    在第一部分中，我們研究了三種不同的預條件矩陣一塊三角預條件矩陣、約束預條件矩陣和塊對角預條件矩陣作用到2 2塊線性系統（其中右下角塊為零）以後的快速迭代解法，給出了預條件作用后系統的特徵值的譜和形式，比較了三種不同預條件作用后採用cmres （ 20 ）方法求解的有效性。
  15. In the paper, the load incremental method is adopted. by the way of reducing the elastic model of the destructive blocks in the elements, the finite element analysis model is revised and the repeated computing process does n ' t finish until the results are converged. the proposed method can simulate the entire process of concrete structures from crack to complete damage

    分析中採用載荷增量法，對各級載荷下單元中破壞的材料分塊進行彈模折減處理，並重新生成單元剛度矩陣，經過多次迭代直至計算收斂，從而可以給出各類cfrp加固混凝土結構的載荷?變形全過程曲線，並預測其極限承載力。
  16. A iteration method to seek the complex matrix inversion

    一種求復數矩陣逆的迭代方法
  17. For this method, the matrix inversion and iterative reconstruction are selected based on the quantity and quality of data, and then the physical model and the actually measured data are processed by using this method

    層析成像演算法根據數據量大小、品質來選擇矩陣反演法與迭代重建法，然後對物理模型、實測資料進行層析成像處理，結果獲得滿意的重建異常體圖像。
  18. A fast and real - time algorithm to obtain some vectors of the projection matrix is proposed in this dissertation to solve the conflict of time cost by matrix obtainment and memory occupied by matrix, and speed the iterative algorithm

    作者根據扇形掃描幾何的對稱性和重疊性，提出了一種快速實時獲取投影矩陣分量的方法，較好地解決了獲取投影矩陣所需速度和存放其所佔內存空間的矛盾，提高了迭代重建演算法的速度。
  19. ( 2 ) based on the wave equation in the acoustic fluid space and the theory of thin - wall structure, the non - symmetrical coupled structure - acoustic dynamic equation without damping is studied. the non - symmetric system of the finite element model for coupled structure - acoustic response is solved by the conjugate subspace iteration method

    由聲空間波動方程和薄板理論出發，對聲場?結構耦合系統的模態分析提出了有限元數值方法，採用共扼子空間迭代法對非對稱特徵方程進行處理，採用靜凝聚法消除質量矩陣的奇異性。
  20. Thus, it is very difficult to decode the hashing algorithm ; the security is enhanced via using the selected matrix and iteration time as the secret keys

    將所選用的矩陣和迭代次數作為浮水印的密鑰，提高了演算法的安全性。
分享友人
分享到 Line

分享到臉書