computational matrices 中文意思是什麼
-
The research for m - matrices plays an important role in computational mathematics and other lots of applied fields
對于m -矩陣的研究在計算數學和其它許多應用領域中起著非常關鍵的作用。 -
The algorithm takes advantages of all nonredundant information of the fourth - order cumulant matrices and so reduces the computational cost
該方法利用了四階累積量陣的所有非冗餘信息，在很大程度上降低了運算量。 -
After analyzing the functions of the weighting matrices q and r, an efficient method, which is very easy to calculate with clear meaning, to select q and r is proposed. without iteration process, this method can save computational time considerably
同時分析了加權矩陣在最優控制器設計中的作用，提出了一種簡單有效、意義明確、計算量小、不需要疊代計算的加權矩陣選取和計算方法。 -
This paper suggests that the integral of the state equation is evaluated directly through the exponential matrix based on the pim, thus several series solutions are obtained. utilizing the symmetry of matrices and the idea of substructure, the computational precision and efficiency of the pim are improved
本文深入研究精細積分及動力方程演算法，基於指數矩陣計算、 pade逼近理論，在時域上對非線性動力狀態方程直接積分求解，構建若干系統響應求解格式，並分析了演算法精度、效率；通過矩陣變換，利用矩陣對稱性、子結構等方法改進精細積分計算效率。 -
Fast computational method for inverse matrices based on
正交化的快速求逆法 -
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
與直接法相比，迭代法只需存儲原系數矩陣、對應于預處理的幾個輔助矩陣與少量幾個向量，且迭代中除求解輔助線性方程組外，其餘的計算主要是稀疏矩陣與向量乘積，從而能充分利用稀疏性減少計算量，但迭代法的收斂速度一般與系數矩陣的譜分佈有關。 -
The explicit method is widely used for its simpleness and little memory consumed with local time step and variable coefficients implicit residual smooth to accelerate the convergence procedure. according to yoon and jameson ' s ideas, an efficient implicit lu - sgs algorithm is carefully constructed by combing the advantages of lu factorization and symmetric - gauss - seidel technique in such a way to make use the l and u operators scalar diagonal matrices, thus the numeric algorithm requires only scalar inversion. the computational efficiency is greatly improved with this scheme
顯式方法具有簡單，消耗內存小等優點，並採用當地時間步長、變系數隱式殘值光順等加速收斂措施，在定常流動的模擬中得到了廣泛的應用;根據yoon和jameson提出的簡化正、負矩陣分裂，構造的l 、 u運算元只需進行標量對角陣求逆，極大提高了流場數值求解過程的計算效率;採用newton類型的偽時間子迭代技術使時間推進精度提高至二階。
分享友人