最优法

基本解释 (translations)

optimisation

与最优法相关的网络例句 [注：此内容来源于网络，仅供参考]

In this paper, by using complex configuration optimization method, we calculate the optimum parameters for a given mass TMD to meet the condition of minimum variance of displacement .

本文利用复形调优法进行TMD参数设计的优化计算，研究在满足结构最小均方位移条件下，对于给定质量比的调质阻尼器的最优参数，即最优频率和最优阻尼比。

First,by choosing a control function for a local adaptive optimal neighborhood,the filter window is set in the region with similar normals to avoid the problem of shrinkage and over-smoothing.

首先通过自适应选取最优邻域控制函数来将滤波窗口限制在顶点法向量相近的区域，以防止滤波后模型的收缩和过光顺；然后运用协方差矩阵分析的方法，在最优邻域内计算出各采样点的法向量和曲率；最后以采样点滤波参考平面为基准，分别平滑采样点的法向量和位置，即先对采样点的法向量进行多边平滑，然后根据新的法向量来多边平滑输出各采样点的位置偏移量，最后在法向方向上移动该顶点，以达到降噪的目的。

Missirlis in article [1]. At the same time, a sufficient condition for convergence of the PSD method is given to be compared when the coefficient matrix A of the linear system Ax = b is a symmetric, positively defective matrix. In §3.2, an example is given to state that the range of our sufficient condition is wider than theorem 3.3 of article [1]. On the other hand, following a.n analogous approach of [14] and starting the functional relationshipwe have a perfect analysis for the PSD method to converge and optimum valves for the involved parameters under different conditions.Under the assumptions that A is a consistent ordered matrix with nonvanishing diagonal elements and the eigenvalues of the Jacobi matrix of A are real,we get necessary and sufficient conditions for the PSD method to convergence.The result is equal to theorem 1 of article [9].Under the same condition, we can see the optimal parameter and of corresponding spectral radius of thePSD method in [8]:(2)When A is a consistent ordered matrix with nonvanishing diagonal elements and the eigenvalues of the Jacobi matrix of A are imaginary or zero,we get necessary and sufficient conditions for the PSD method to convergence.In chapter 3, the optimal parameter and of corresponding spectral radius of the PSD method are given by table 3.3. Moreover, under the assumption 0

Missirlis在文献[1]中定理3.3的不准确，同时给出了当线性方程组Ax=b的系数矩阵A为对称正定阵时，PSD迭代法收敛的一个充分条件与之比较，并且在§2.3中用实例说明了对于一部分矩阵而言本文得到的充分条件广于[1]中定理3.3的充分条件；另一方面，按照文献[14]的方法，我们从PSD迭代法的特征值λ与其Jacobi迭代矩阵B的特征值μ的关系式：出发，在不同条件下对PSD迭代法的收敛性和最优参数以及最优谱半径进行了完整的分析：(1)在系数矩阵A为(1，1)相容次序矩阵且对角元全不为零，其Jacobi迭代矩阵B的特征值全为实数的条件下，给出了PSD迭代法收敛的充分必要条件，此结果与[9]中的定理1等价，此时最优参数及最优谱半径由[8]得：(2)第三章表3.3中给出了，当系数矩阵A为(1，1)相容次序矩阵且对角元全不为零，其Jacobi迭代矩阵B的特征值全为纯虚数或零时的PSD迭代法的收敛范围和最优参数，并且我们可以得到当0

If the pattern has a low rate of convergence, the time of the human and machines will be wasted and the answer are not surely attainable.So,we must look for the patterns with the high rate of convergence or try to settle some parameters of the iteration patterns (for instance the overrelaxation parameter of SOR iterative method).

本文第二章针对AOR迭代法考察了当线性方程组的系数矩阵A为(1，1)相容次序矩阵且其Jacobi特征值为纯虚数或零时的迭代收敛范围，最优参数(即最优松弛因子和最优加速因子)及与之相应的谱半径，并将此最优谱半径与相应的SOR的进行比较，定量的给出在不同条件下，AOR和SOR迭代法各有其优越性，从而圆满的解决了在这两种迭代法之间如何适当的选择最佳迭代法的问题。

Fourth, Based on sample data collected in Shenzhen city in 2003, the paper, from various perspectives, calculates nominal VAT rate for goods sold domestically or internationally. By the means of the calculation of the extent of indirect nominal tax burden shifting, we can get the economy tax burden from evaluating some trades'tax burden shifting range of Shenzhen VAT taxpayer. This paper also analyses the problems and the reasons of it and proved that the result of the separate calculation of domestic sales nominal tax burden and export sales tax burden can more realistically reflects the enterprises'nominal tax burden.. Enterprises with higher nominal tax burden can transfer their most parts of their nominal tax burden to the consumers, but the enterprises with lower nominal tax burden have to bear all nominal tax burden. Thus, when measuring the properness of tax burden from the VAT taxpayer, a comparison between economic tax burden and optimum tax burden should be considered.

第四，本文以2003年度深圳市数据为例，从不同的口径分别用经典名义税负测算法和内外销分别测算法测算了深圳市增值税纳税人的名义税负，运用间接税税负转嫁程度测算模型，测算了深圳市增值税纳税人部分行业税负转嫁的程度，进而得出其经济税负，并分析了深圳市增值税纳税人税负存在的问题以及成因，验证了内外销分别测算法得出的结果更能真实地反映企业的名义税负，得出以下结论：名义税负较高的行业，其经济税负不一定高，而名义税负较低的行业，其经济税负并不一定低，在衡量增值税纳税人的税收负担是否适度的问题上，不能简单的将名义税负与最优税负比较，而应将经济税负与最优税负比较。

Addressing to deficiencies of this method,optimum partition method which is widely used in mass analysis is developed to fit thermocline boundary calculation.

针对垂直梯度法的不足，引入水团分析中的最优分割法，对典型剖面，以及边界型、逆变型、多层型等几类特殊剖面的跃层边界分别进行了计算，并对垂直梯度法与垂直梯度法的计算结果进行了比较分析，结果表明最优分割法确定的跃层边界更为合理。

Thus closed control structure is available, which fits for application on line and avoids the inadaptable for serious disturbance caused by linearized model.

本文首先以单机无穷大系统为例，分别采用OVAC和直接反馈线性化最优法设计了HVDC功率调制与发电机励磁的协调控制规律。

Through adding new state variable and using supplement functions,the problem with restriction conditions was converted into nonrestriction problem.

通过增加新的状态变量和用补偿函数法，将本课题的有约束条件问题化为无约束条件问题，并提出了最优步长参数的动态搜索法来修改传统的梯度法，从而较完善地解决了多变量最优周期控制的计算问题。

Through adding new state variable and using supplement functions,the problem with restriction conditions was converted into nonrestriction problem.In addition,the dynamic searching method of optimal step coefficient was developed to modify the conventional gradient method,consequently the calculation problem of the multivariable optimal periodic control was able to be resolved better.

通过增加新的状态变量和用补偿函数法，将本课题的有约束条件问题化为无约束条件问题，并提出了最优步长参数的动态搜索法来修改传统的梯度法，从而较完善地解决了多变量最优周期控制的计算问题。

An opti-mization model is proposed,which can determine the optimal number of sectionalizing switches and their locations in distribution networks.

提出了一种开关配置模型，能够确定配置开关的总数以及每个开关的最佳安装位置，并采用改进的分步最优法进行求解。

与最优法相关的网络解释 [注：此内容来源于网络，仅供参考]

steepest descent method：最速下降法

最速下降法(steepest descent method)由法国数学家Cauchy于1847年首先提出. 在每次迭代中,沿最速下降方向(负梯度方向)进行搜索,每步沿负梯度方向取最优步长,因此这种方法称为最优梯度法. 最速下降法是一种最基本的算法,

energetic optimum：能量最优(状态)

endpoint titration 终点滴定(法) | energetic optimum 能量最优(状态) | energy band 能量带

optimum gradient method：最优梯度法

optimum formation 合理队形 | optimum gradient method 最优梯度法 | optimum heating temperature 最佳加热温度

optimum gradient method：最优斜量法

optimum gliding angle 最佳滑翔角 | optimum gradient method 最优斜量法 | optimum grind 最佳磨矿粒度

Alternate Optima：交替最优法,交替最佳法

轮替操作 alternate operation | 交替最优法,交替最佳法 alternate optima | 第二通路 alternate path

Alternate Optima：交替最优法

alternate operations 轮换操作 | alternate optima 交替最优法 | alternate order 二者择一的订单

Pontryagin's Principle of Optimality：庞特里亚金最优性原理

政治学与经济学 Politics and Economics | 庞特里亚金最优性原理 Pontryagin's Principle of Optimality | 济贫法 Poor haw

simplex method：单体法

单体法 (simplex method)是一种解线性规划的反覆程序 (iterative procedure),直到得出最优解才停止. 基本原理:首先选出一组可行解和一判断准则,判断目前的解是否为最优解,若不是,则设法取另一端点取代,使目标函数值增大 (或减小)如此不断进行,

tangentially optimal property：切向最优法

tangential-feed-method grinding 切向进给磨法 | tangentially optimal property 切向最优法 | tangentially-fired soaking pit 切向烧嘴均热炉

Alternate Optima：交替最优法

alternate operations ==> 轮换操作 | alternate optima ==> 交替最优法 | alternate order ==> 二者择一的订单