助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   计算导数 的翻译结果: 查询用时:0.293秒
图标索引 在分类学科中查询
所有学科
化学
数学
更多类别查询

图标索引 历史查询
 

计算导数
相关语句
  computational derivative
     STUDIES ON COMPUTATIONAL DERIVATIVE SPECTROPHOTOMETRYⅠ.SIMULTANEOUS DETERMINATION OF TUNGSTEN AND MOLYBDENUM
     计算导数分光光度法的研究——Ⅰ.钨、钼的同时测定
短句来源
     STUDIES ON COMPUTATIONAL DERIVATIVE SPECTROPHOTOMETRY——Ⅱ. Simultaneous Determination of Copper, Zinc and Manganese
     计算导数分光光度法的研究——Ⅱ.铜、锌、锰的同时测定
短句来源
     Studies on Computational Derivative Spectrophotometry
     计算导数分光光度法的研究
短句来源
  “计算导数”译为未确定词的双语例句
     It possesses the second order convergent rate and does'nt need to compute derivative.
     它具有对函数性质要求低,不需要计算导数、且有二阶收敛速度的特点。
短句来源
     A derivative-free iteration formula with 4-order convergence
     一个不用计算导数具有4阶收敛性的迭代公式
短句来源
     A weighted derivative numerical computation solving constant differential equations
     常微分方程数值计算导数权重法
短句来源
     It isproposed on the basis of the analysis on Newton method and the preconditioned conjugategradient method (PCG method). Numerical derivatives can be evaluated by symbolic differ-entiation (SD), finite difference approximation and automatic differelltiation (AD).
     自动微分是一种新的能精确而有效地计算导数的方法,它优越于传统的微分方法,例如它比符号微分和差分方法的计算成本低,又比差分方法计算精确,自动微分在近几年发展迅速,应用广泛。
短句来源
     A CLASS OF ITERATIVE METHODS OF HIGH ORDER WITHOUT COMPUTING DERIVATIVES
     不计算导数值的高阶迭代类
短句来源
更多       
  相似匹配句对
     The Method on Solving the Derivativeof the Piecewise Defined Function
     分段函数导数计算
短句来源
     We also give a new correction factor to simplify the calculation of the Unstatistic.
     的计算
短句来源
     Studies on Computational Derivative Spectrophotometry
     计算导数分光光度法的研究
短句来源
     Calculation of Skewed Plates
     斜板的计算
短句来源
查询“计算导数”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  computational derivative
The critical regions are now identified by the computational derivative q/, which is smoother than the physical derivative q/x.
      


In this paper a numerical method of branching of solutions of nonlinear equations F(x;λ)=o is discussed, where F:R~n×R→R~n are sufficientlly smooth functions. Suppose(x,λ)is its any known singular point.when Jacobi matrix of F at singular point has rang n-1, by means of classical Newton-Polygon theory we present a new numerical method which may diterminate numbers of bnanching from singulr point and new started points on the branching solutions.Different from Newton-Polygon method, our method needs not to compute...

In this paper a numerical method of branching of solutions of nonlinear equations F(x;λ)=o is discussed, where F:R~n×R→R~n are sufficientlly smooth functions. Suppose(x,λ)is its any known singular point.when Jacobi matrix of F at singular point has rang n-1, by means of classical Newton-Polygon theory we present a new numerical method which may diterminate numbers of bnanching from singulr point and new started points on the branching solutions.Different from Newton-Polygon method, our method needs not to compute derivatives, but only valuation of functions itself, so that it is available in particular application. At the end ofthis paper a few numerical examples are given.

本文讨论了非线性方程F(x;λ)=o的分支解的数值方法,其中F∶R~2xR→R~n是充分光滑的函数。设(x,λ)是一个已知奇点。当F的Jacobi矩阵在奇点的秩为n-1时,我们利用古典的牛顿多边形理论提出了一种计算由奇点分叉出去的解支个数和分叉解支上的新起点的新的数值方法。和牛顿多边形方法不同,我们的方法不需要计算导数值而只需要计算函数值本身,因而在具体应用中是行之有效的。本文的末尾给出了一些数值例子。

As one of practical methods for optimization, which don't require evaluation of derivatives and don't take line searches, Rosenbrock method is-in use with the feature of including directional searches of flexible step-length and rotations of search directions. In this paper, some modifications are given for algorithm model of Rosenbrock method as follows: descent threshold is introduced at each step, suitable conditions are checked before taking rotation of search directions, and adjustments of uniform steplengthes...

As one of practical methods for optimization, which don't require evaluation of derivatives and don't take line searches, Rosenbrock method is-in use with the feature of including directional searches of flexible step-length and rotations of search directions. In this paper, some modifications are given for algorithm model of Rosenbrock method as follows: descent threshold is introduced at each step, suitable conditions are checked before taking rotation of search directions, and adjustments of uniform steplengthes are taken after rotations of search directions. Based on an estimation of descent amount, the convergence of Rosenbrock method is proved without the assumption of convexity of objective functions.

Rosenbrock方法作为不计算导数又不使用一维搜索的一种实用最优化方法,其要点是将变步长轴向搜索与方向旋转结合起来。在本文中,以理论分析为引导,对Rosenbrock方法的算法模型从下列方面进行若干修正:引入下山门槛,方向旋转时检验适当的条件,方向旋转后步长向量的适当调整。在建立目标函数下降量的估计之后,我们证明了Rosenbrock方法的此种算法模型在没有凸性限制下的收敛性。

A new optimization algorithm is presented. This algorithm using highorder approximation for the objective function requires nether derivative calculation nor linear search, and has high convergent rate. It has been incorporated into ADIC-2,an analysis and designprogram for general curpose circuits. Its high efficiency is illustrated by some numerical andcircuit design examples.

本文提出了一个新的最优化算法,它对目标函数采用高阶近似,不需要计算导数,也不需要进行一维搜索,且收敛速度较快。该算法已用于通用电路分析和设计程序ADIC-2,数值计算及电路设计的例子表明该算法是十分有效的。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关计算导数的内容
在知识搜索中查有关计算导数的内容
在数字搜索中查有关计算导数的内容
在概念知识元中查有关计算导数的内容
在学术趋势中查有关计算导数的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社