矩陣的乘法 的英文怎麼說

中文拼音 [jǔzhèndechéngfǎ]
矩陣的乘法 英文
multiplication of matrices
  • 矩 : 名詞1. （畫直角或正方形、矩形用的曲尺） carpenter's square; square2. （法度; 規則） rules; regulations 3. [物理學] moment
  • 陣 : Ⅰ名詞1 （作戰隊伍的行列或組合方式） battle array [formation]: 布陣 deploy the troops in battle fo...
  • 的 : 4次方是 The fourth power of 2 is direction
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 矩陣 : [數學] matrix; array
  1. This paper introduces the basic idea and algorithm of sparse matrix multiplication by using incompact storage method

    摘要介紹了對稀疏矩陣進行壓縮存儲時，稀疏矩陣相乘運算的基本思想和演算法。
  2. The second part of this paper is mainly concerned about an interesting matrix inequality presented in [ 5 ], which is then generalized in m ~ " under the entry - wise nonnegative ordering. we introduced the concept of sub - kronecker product, and establish an inequality which relates the schur complement of a and b for positive semidefinite matrices a and b. our results improve the related known results obtained by t. l. markham and r. l. smith in 1998 ( see [ 5 ] )

    第二部分研究了文獻[ 5 ]中提出的一個有趣的矩陣不等式，並將此不等式在逆m -矩陣中推廣，然後引入次kronecker乘法的概念，提出並證明了一個更廣泛的不等式，改進了t . l . markham和r . l . smith在[ 5 ]中的有關結果。
  3. The sequential continuity of multiplication on a class of infinite matrix algebras

    一類無窮矩陣代數的乘法序列連續性
  4. As the core of the optical processor, optical vector - matrix multiplier ( vmm ) is a basic optical device of the optical computer

    光學矢量-矩陣乘法器是光計算機中最基本的一種功能部件。
  5. The implementation in this paper packs 4 cons 4 * 1 consecutive elements from a matrix column into a texel and thus performs a small number of 4 * 4 matrix by 4 * 1 vector products in a shader

    每次從矩陣中取出4個元素放入一個到文理單元的一個元素中， 4 4的小規模矩陣乘法就轉變成了4 1的向量乘法。
  6. Initial vector and iterating control in the solution to eigenvalue and eigenvector of a matrix by the matrix iterarion method

    乘冪法求矩陣特徵向量與特徵值的初始向量及循環控制
  7. Ranking method for interval numbers reciprocal judgment matrix based on goal programming and relative superiority degree

    區間數判斷矩陣的最小二乘排序法
  8. For a general linear model ( input matrix is deterministic ), under a certain conditions on variance matrix invertibility, the two estimates can be identical provided that they have the same priori information on the parameter under estimation. even if the above information is unknown only for the optimally weighted ls estimate, the sufficient condition and necessary condition, under which the two estimates are identical, is derived. more significantly, we know how to design input of the linear system to make the performance of the optimally weighted ls estimation identical to that of the linear minimum variance estimation in case of being lack of prior information

    在一般線性模型（即輸入矩陣為確定性）下，當兩種估計都利用有關被估參數的先驗信息時，二者在方差陣可逆的一定條件下可達到一致；當最優加權最小二乘估計不利用此先驗信息時，存在二者一致的充分條件和必要條件，進而找到一種設計輸入矩陣的方法，使得在先驗信息缺乏的條件下，仍可利用最優加權最小二乘估計達到與線性最小方差估計一樣優越的估計性能。
  9. This paper applies generalized multipler method to translate convex quadratic programs with equal constraints and non - negative constraints into simple convex quadratic programs with non - negative constraints. the new algorithm is gotten by solving the simple quadratic program. it avoids the computation of inverse matrix and exploits sparsity structure in the matrix of the quadratic form. the results of numerical experiments show the effectiveness of the algorithm on large scale problems

    根據廣義乘子法的思想，將具有等式約束和非負約束的凸二次規劃問題轉化為只有非負約束的簡單凸二次規劃，通過解簡單凸二次規劃來得到解等式約束和非負約束的凸二次規劃新演算法，新演算法不用求逆矩陣，這樣可充分保持矩陣的稀疏性，用來解大規模稀疏問題.數值結果表明：在微機486 / 33上就能解較大規模的凸二次規劃
  10. Matrix variation basis of sparse matrix multiplication

    矩陣相乘的壓縮存儲演算法
  11. And for geometrically split link, sharp integrality of the ohtsuki invariant is given. a new multiplicative group, braid array, is constructed through a series of basic changes in the second part, and we conclude that any tame knot or link can be represented by finite braid array

    第二部分，由於辮子群與紐結理論的密切聯系，本文構造了一個類似於矩陣的乘法群? ?辮子陣群，並給出了它的一系列基本變換，且得到所有溫良紐結或環鏈都可由有限階辮子陣惟一表示。
  12. The brief proof is given for " row elementary operations keep the linear relationship of column vectors of matrix ", by using multiplication of partitioned matrix and the relation between elementary matrix and elementary operation

    摘要利用初等矩陣與初等變換的對應關系及分塊矩陣的乘法，給出「矩陣的行初等變換不改變其列向量組的線性關系」的一個簡易證明。
  13. Gives techniques for improving the speed of matrix multiplication by more than a factor of two on superscalar risc processors

    講述在超標量risc處理器上用大於二的因子來提高矩陣相乘的速度的方法。
  14. Using gyro measurements during periods of thruster firing, with thruster outputs, mass property identification is achieved through recursive least squares algorithms on the basis of the refined dynamics equation. the approach addresses the issue by segmenting the problem into two sub - problems which both allow closed form solution to reduce computation load

    該方法利用衛星上的陀螺輸出和推力器控制指令作為演算法的輸入，在修正的衛星姿態動力學模型基礎上，推導了衛星質量特性在線辨識遞推最小二乘演算法，將質心位置和轉動慣量矩陣的辨識解耦以降低辨識演算法的維數，減少計算量。
  15. In term of the orthogonal property of alamouti scheme and the character of the ofdm system equivalent model expression of receiver signal for stbc - ofdm system was obtained by flexible transform method so that the inverse of matrix was avoided using direct - decision mode and the complexity of computation and receiver was decreased. the simulation results show the validity and efficiency of the proposed receiver. ( 6 ) an adaptive equalization algorithm used in space - time block coded ofdm ( stbc - ofdm ) system with alamou

    該演算法充分利用了alamouti編碼的正交特性和多發射天線ofdm系統特點，通過靈活的變換對接收信號進行等價的表示；通過對11矩陣求逆的研究，將塊最小二乘遞推演算法（ brl ）中的zkxzk的矩陣求逆分解為k個2x2矩陣的求逆，從而降低了自適應演算法的運算量和接收機的復雜度。
  16. Then discusses conventional encoding and efficient encoding using special sparse parity check matrix in encoding algorithm, and expatiates the principle of message passing and spa which has the best performance in decoding algorithm

    在編碼演算法里詳細討論了傳統的編碼演算法以及使用特殊形式奇偶校驗矩陣的快速編碼演算法。在譯碼演算法里介紹了mp演算法集的基本原理和譯碼性能最好的和乘積譯碼演算法。
  17. 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

    與直接法相比，迭代法只需存儲原系數矩陣、對應于預處理的幾個輔助矩陣與少量幾個向量，且迭代中除求解輔助線性方程組外，其餘的計算主要是稀疏矩陣與向量乘積，從而能充分利用稀疏性減少計算量，但迭代法的收斂速度一般與系數矩陣的譜分佈有關。
  18. Solving linear equations arise in a surprising number in the computing problems of engineering, but sometimes they are unsolvable. in this paper fast algorithms are presented which compute the minimal norm least square solutions for linear equations with special rectangular matrices coefficients, such as vandermonde matrices, toeplitz matrices, loewner matrices etc. and then, this paper presents an algorithm of computing the left inverse or right inverse for these special rectangle matrices

    工程中的計算問題大部分都可轉化成求解線性方程組的問題，而這些線性方程組有的時候是不相容的，本文研究以一些特殊的長方矩陣為系數陣的不相容方程組? ? vandermonde方程組， toeplitz方程組， loewner方程組等的極小范數最小二乘解的快速演算法，以及求這些特殊矩陣的左逆及右逆的快速演算法。
  19. Abstract : by applying the matrix rank method, in this note, the general expressions of the common least - square solutions to the matrix equations ax = c, xb = d is deduced, the extremal ranks of the common least - square solutions is obtained

    文摘:通過使用矩陣秩方法，我們給出了矩陣方程組ax = c ， xb = d的公共最小二乘解的通解表達式，以及公共最小二乘解的極大秩和極小秩
  20. And. . just. . i think a little bit about matrix notation and how do that multiplication, so let me say how i multiply a matrix by a vector

    同時…正…我再思考一下矩陣符號以及怎麼樣來做那個乘法，那麼，讓我來講我是怎麼樣用一個矩陣去乘以一個向量的。
分享友人
分享到 Line

分享到臉書