逼近

This thesis is concerned with metric Diophantine approximation for formal Laurent series over a finite base field.

我们将在本论文中探讨有限体下正规Laurent级数上的Diophantine逼近。

Papers analyzed the management flexibility and value of mining engineering, and set up the model of value of a developed mine,value of an undeveloped mine and value of an exploration project under the conditions of uncertainty with the theory of real option,and worked out the solution of model above-mentioned through three numerical methods,i.e.the Fig Tree,finite difference approximation and Monte Carlo simulation.

论文最后研究了矿业工程中的管理灵活性及其价值，运用实物期权方法分别建立了不确定条件下矿业生产阶段、开发阶段和详查、普查、预查阶段的矿业投资评价模型，并运用二叉树图、有限差分逼近和Monte Carlo模拟三种数值方法对所建模型进行了求解，同时通过实例对论文的研究结果进行了佐证。

Jacobian, Hessian Matrix Properties, Sensitivity Analysis w.r.t Design Variables, Fixed Parameters and Constraints, Normalization, Finite Difference Approximation, Automatic Differentiation, ANOVA, Adjoint Methods, Examples

Jacobian， Hessian矩阵属性，灵敏度分析w.r.t设计变量，固定参数和约束，归一化，有限差分逼近算法，自动差分算法，ANOVA，伴随矩阵法，举例

Based on the spherical harmonic functions expansion and finite difference for discretization of transport equation, an inverse power scheme is presented for calculation of the k-eigenvalue problem.

基于球谐函数展开和有限差分离散，给出了中子输运方程的源项反演逼近的反幂算法，该方法的优势是在适当的初值条件下可以显著提高计算速度。

It shows that the derivative of finite discrete function is locally a pproximate to the one under continuous case.

通过引入最佳平均逼近直线，分别从几何直观和极限情形两个角度，研究了有限离散函数的导数概念的表现。

The approach of an infinite series to a finite limit .

无限级数向有限数的级限的逼近。

We first review two existing approximation approaches, and an exact approach proposed by Pearn et al.

本文一开始会先回顾三个针对此类问题的方法，其中两种为大样本时的逼近方法，另一个则是由Pearn et al。

The Black-Scholes options pricing model is one of the most famous equations in finance and offers a useful first approximation for prices for option contracts.

的Black - Scholes期权定价模型是在金融业中最有名的方程，并提供一个有用的为期权合约价格首次逼近。

The experimental data were trained by BP neural network, and the results were curve fitted to set up a fitting function which was used in the genetic algorithm process to reach the optimum.

首先利用BP神经网络来训练已有实验值，然后将训练后的神经网络作为知识源，通过曲线拟合与逼近求得设计变量与目标函数值的函数关系表达式，最后将这一函数表达式作为遗传算法的适应度函数进行遗传迭代寻找最优解。

In complete convex metric spaces , we use Ishikawa iterative process to approximate common fixed point of quasi - contractive mapping pair.

在完备凸度量空间中，运用广义的Ishikawa迭代序列列逼近拟压缩映射对的公共不动点。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。