computational efficiency中文是什么意思

• 计算效率

• computational    adj. 计算的。
• efficiency    n. 1.功效。 2.效率；效能；实力，能力。 3.【物 ...
• cm computational    计算方面的
• cmp computational    计算方面的
• computational accuracy    计算精度
• computational aids    计算工具
• computational algorithm    计算逻辑算法; 计算算法
• computational analysis    计算分析
• computational astrophysics    计算天体物理学
• computational biology    计算生物学; 生物计算
• computational capabilities    计算能力
• computational chemistry    计算化学
• computational complexity    计算复杂性; 计算量
• computational condition    计算条件
• computational costs    计算费用
• computational data    计算数据
• computational details    计算细节
• computational domain    计算区域
• computational dynamics    计算动力学
• computational effort    计算工作量
• computational element    计算单元
• computational envelope    计算封套
• computational error    计算错误; 计算误差
• computational finance    金融工程学
• computational formula    计算公式

• But the former is nonlinear combining optimal problem and the latter is nonlinear planning optimal problem . so it ' s prone to result in " combination exploration " and lower computational efficiency simply combining the above two means to carry on the coordination optimism of distribution network ' s reactive power
  但一个是非线性组合优化问题，一个是非线性规划优化问题，因此用传统方法将这两者结合进行配电网络无功综合优化，容易产生“组合爆炸” ，而且计算效率低。
• Abstract : in this paper , we propose an improved lagrangian relaxation algorithm to solve job - shop scheduling problems . besides the addition of augmented objective , we expand the search scope of near - optimal solutions and improve the computational efficiency greatly by restricting the solution scope of sub - problems and modifying the search method of dual problem . at the same time , we develop a genetic algorithm combining with the lr ( lagrangian relaxation ) method . using the numerous useful solutions we get in the lagrangian relaxation as the original genes , we can improve the solution further . test results show that these methods achieve satisfied outcome for job - shop problems . they can also be applyed to other programming problems with constraints
  文摘:针对车间调度问题，提出了一种改进的拉氏松弛算法.在增加辅助目标函数的基础上，通过对子问题的限制和搜索策略的改变，使拉氏算法的计算量减少，近优解的搜索能力有很大改善.本文还提出了一种基因优化算法，充分利用拉氏算法得到的多个近优解，进一步优化结果.仿真结果表明对车间调度问题得到了较好的结果.本方法也可用于其它有约束的规划问题
• 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类型的伪时间子迭代技术使时间推进精度提高至二阶。
• Through the research in this thesis , following conclusion can be drew : on the condition of nearly incompressible limit , the n - s equations can be recovered by the lb method ' s models with 2 - order numerical precision ; computational efficiency in simulating flow fields can be improved effectively by perfection of the lb method ' s theory ; development of parallel computation can contribute to the simulation of large - scale flow field with complex geometry
  通过本文的研究，可得出如下结论： lb方法的模型在接近不可压缩的条件下能够以二阶精度逼近n - s方程； lb方法理论的完善能够有效地提高流场模拟的计算效率；并行计算的发展有利于lb方法模拟大尺度的复杂流场。
• This method is proved to be an accurate solution of random vibration equation , in which all cross - correlation items , either between earthquake inputs or between participant modes are involved naturally . compared to conventional method , the computational efficiency of the developed method is much higher
  此法计算结果自动包含了振型间及各输入分量间的相关项，理论上是随机振动方程的精确解法，且与传统方法相比可大大减少计算量，非常适合分析大型网壳这种自振频率密集结构的随机地震响应。
• The conventional ways has low efficiency , which result in the application of overlap grid in moving - grid problem , which need re - disposes the interpolating connection in every step in time direction , is very difficult considering the computational efficiency . aim at the above problem in application of overlap grid , this paper using an new manner rooting in analysissitus to put forward a “ method of distinguishing points of intersection ” and develop corresponding computational soft , which could realize the automatic and shape - independent pre - disposal process for overlap grid . to deal with the problem of low efficiency for pre - disposal process in moving - grid , this paper bring forward the “ mosaic ” method and adt method which based on the huge memory of modern computer
  对于重叠网格在动网格应用中的计算效率问题,本文通过进一步研究插值信息的高速查询方法,提出不同于传统算法思路,以现代计算机大内存为基础,用计算机物理内存空间换计算时间的” mosaic ”方法以及应用基于二叉树数据结构的adt ( alternatingdigitaltree )方法两类方法,成功的将原处理时间提高了两个数量级? ?即将网格规模在百万量级的重叠网格预处理时间从传统方法的耗时30 60分钟提高到几十秒钟,从而成功解决了这一问题。
• And when going on reliability analysis of slope stability , confirm with critical split surface using traditional definite value analysis method ( namely most dangerous sliding surface ) , then calculate reliability index and failure probability of slope in this sliding surface . compare with using trial method to look for critical sliding surface in the past , it reduces time of calculating greatly , improves computational efficiency , can get safety coefficient and failure probability of slope stability at the same time
  并且在进行边坡稳定可靠性分析时，用传统的定值分析方法确定公路边坡的临界滑裂面(即最危险滑裂面) ，然后以此为基准计算边坡的稳定可靠指标及边坡失效概率，与以往寻找临界滑裂面的试算法相比，大大减少了计算时间，提高了计算效率，可以同时求得边坡稳定安全系数和边坡失效概率。
• A highly efficient numerical algorithm by using multi - grid method ( mgm ) is introduced to solve the three dimensional field distribution in the present paper . formulae of the restriction and prolongation in mgm computation is deduced , and a 3d program of mgm is accomplished , which can solve the field distributions in electron optical systems for various electrostatic lenses . the 3d field distribution in an electrostatic concentric spherical model is tested with mgm algorithm and an algorithm based on finite difference method ( fdm ) respectively . comparing these two results in view of computational efficiency and computational accuracy , it appears that mgm is superior to fdm in solving electrostatic field distribution for the electron optics problem . this paper shows that the 3d field computation using mgm greatly improves the computational efficiency of field distributions in electron optical systems and shortens the computational time
  本文将一种高效率的数值计算方法? ?多重网格法引入三维静电场分布的计算，多重网格法利用限制和延拓可迅速求得满足精度要求的场分布.研究了求解各种静电透镜电子光学系统三维场分布的多重网格法程序，验算了静电同心球模型的三维场分布.通过与目前在场计算中常用的有限差分法进行比较，可以看出多重网格法的计算效率和计算精度优于有限差分法.本文表明利用多重网格法计算三维场大大提高了场分布的计算效率，缩短了计算时间，因此为后续计算打下了良好的基础
• Its principal means is to regulate transformer rate and to parallel with capacitors . thie paper implements reactive power optimization calculation based on above mathematical model by genetic algorithm . to overcome the poorly computational efficiency of genetic algorothm , we also makes an improvement of it to enhances its convergence speed and search efficiency
  无功优化主要采用调整变压器分接头和并联电容器两种方法，用遗传算法实现了基于以上数学模型的配电网无功优化计算，针对遗传算法计算效率低的现象对常规遗传算法加以改进，进一步提高了算法的计算效率和全局寻优能力。
• A new approach for initial localization of the mobile robots , namely complete line segments ( cls ) based localization was proposed . the definitions of cls as well as its properties and decision rules were given . the experimental results show that this method has much higher computational efficiency and better localization accuracy
  作者先针对目前机器人定位研究中的难点? ?初始定位，结合激光测距雷达的数据特点，提出了基于完整线段( completelinesegments ， cls )的初始定位方法，包括cls的定义、性质和判定方法，并在机器人试验平台上进行了实验。