查询词典 polynomial approximation

With some modifications of Laplace\'s approximation,we obtain uniform asymp-totic formulas for the Stieltjes-Wigert polynomial,the q~(-1)-Hermite polynomial and the q-Laguerre polynomial.

通过将Laplace逼近方法做一些改进，我们得到一些关于Stieltjes-Wigert多项式，q~(-1)-Hermite多项式和q-Laguerre多项式的一致渐近公式。

In theory of approximations, the classic methods of polynomial approximation for rational expression are various interpolations and operator approximations, such as Lagrange interpolation, Hermite interpolation and Bernstein polynomial approximation.

在逼近论中，用多项式逼近有理式的经典的方法是各种插值与算子逼近方法，如Lagrange插值、Hermite插值和Bernstein多项式逼近等。

The main procedures are as following: to generate small increment of parameters automatically and to calculate the FE several times and obtain the sensitivity of objective function to the parameters, and then form a Hermite polynomial approximation, the calculation of FE solutions are substitute by the calculation of polynomial approximation, so time cost decreases dramatically.

用n维埃尔米特插值技术建立设计变量在可行域上的目标函数的逼近函数；将局部寻优的梯度算法和全局寻优的随机算法结合起来，大幅度地降低寻优过程中电磁场的计算次数。

For the given endpoint interpolation conditions, a new approximation method of multidegree reduction is presented. Using Chebyshev polynomial approximation theory, the nearly best uniform approximation under the interpolation conditions of endpoints can be obtained.

对于给定的首末端点的各阶插值条件，给出了一种新的一次降多阶逼近算法，应用Chebyshev多项式逼近理论达到了满足端点插值条件下的近似最佳一致逼近。

After introducing the primary approximation approaches for curve and surface offset, we give an optimal approximation approach for offsetting curve based on shifting control points, which relies on approximating the normal by Legendre polynomial approximation.

在全面介绍了等距曲线曲面逼近的主要方法以后，作者首先利用Legendre多项式得到基曲线法矢曲线的最佳平方逼近，由此给出了基于控制顶点偏移的等距曲线最优逼近的算法，它在算法效果和效率上都远优于其他同类算法。

In the final chapter, we discuss interval polynomial approximation of rational surfaces. Firstly, we briefly state the interval-surface approximation based on the Taylor Expansion, and later, we give out a better interval-surface approximation based on the optimization method, which is also the main work of this paper.

第四章主要介绍了有理曲面的区间多项式的逼近，首先简单介绍了基于泰勒展开来做的区间曲面逼近，后面是本文的主要工作，我们基于优化方法得到了更好的区间曲面逼近，它也是本文的重要部分。

In this dissertation, the best simultaneous approximation with weight to infinite sequence from simultaneous-suns in complex normed linear space is considered, and in the case when the weight satisfies a certain condition, the characterizations of approximation from a simultaneous-sun and uniqueness of approximation from a RS-set are obtained; moreover, in the case when the weight is free, the characterizations of approximation to a totally bounded sequence from a convex set are established.

本文在复赋范空间中研究了同时太阳集对无限序列的加权同时逼近问题，在权满足一定条件时，通过把所研究问题转化为连续向量值函数空间中相应集对一个上半连续函数的最佳逼近问题，得到了逼近的特征和RS集逼近的唯一性定理，有例表明它们是已有结果的本质推广；在权不受限制时，得到了凸集对全有界序列逼近的特征。

First low order approximation of generating function and approximate optimal trajectory were obtained. Then using low order approximation of generating function of Hamilton "relative motion" to the approximate optimal trajectory, improvement of the approximate optimal trajectory was iteratively made. In this way, high order approximation accuracy can be obtained by only using low order approximation, which is much cost effective in computing.

首先以较低的计算代价，获得最优控制Hamilton系统生成函数的低阶近似，得到一条近似的最优轨线，然后将最优控制Hamilton系统相对于近似最优轨线求"相对运动"，该"相对运动"仍具有Hamilton性质，利用这一"相对运动"的生成函数低阶近似，可以对近似最优轨线进行迭代修正，从而以计算代价较小的低阶近似逼近计算代价高得多的高阶近似的精度。

In generic mathematical approximation methods Chebyshev multinomial approximation algorithm has better effect on reducing approximation error. This paper brought forward a parallel Chebyshev multinomial approximation algorithm based on a unique representation of complex curve, and implemented the parallel program in two Java methods.

常用的数学逼近法中切比雪夫多项式拟和法误差较小，对此，提出一种基於复杂曲线表示的切比雪夫多项式拟合并行算法，并采用两种Java方案实现并行程序。

Tested approaches where background reflectance is described as a n-degree polynomial in wavelength, resulting in a second degree polynomial (n=2) for the O2-A band, while a higher degree polynomial (n=6) was necessary for the O2-B band, as tested over a large database of many possible combinations of r and F cases.

测试(2009)方法在背景反射被描述为一个n-degree 多项式的波长，导致了第二学位多项式(n = 2)，而O2-A乐队更高程度的多项式(n = 6)是必要的，O2-B乐队测试在大型数据库的吗许多可能的组合和F的病例。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。