computing process meaning in Chinese
计算过程
Examples
- 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加固混凝土结构的载荷?变形全过程曲线,并预测其极限承载力。 - For this reason , the following problems are researched emphatically : firstly , the long - term prediction method for calculating the extreme values of slamming pressure is founded . the effects of sea conditions , ship speeds , traveling directions , loading conditions on the results of long - term prediction are studied . on this basis , the computing process is simplified rationally , so as to this method can be used in practical engineering computations
为此,本文主要在下面几个方面进行了探索:首先,建立了底板砰击极值压力的长期预报方法,通过分析海况、航速、航向角、装载状态等不同的影响,合理简化了长期预报的计算过程。 - A new modeling method is applied to build the real - time mathematical model of the turbofan engine . in this model , the relations of the engine components " parameters can be expressed by analytical formula , which avoid the complex and time - consuming iterations in the components computing process
本文应用的发动机实时数学模型,提出了一种新的实时模型建模方法,该方法通过将发动机部件参数间的关系通过解析式表示,从而避免了部件计算过程中复杂而又耗时的迭代过程。 - 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算法过程中的谱信息,确定预处理;第三种算法是在第二种算法的基础上,运用收缩技巧,形成近似不变子空间,以提高收敛速度和数值稳定性。