1) angle approaching method
角度逼近法
2) angle approaching
角度逼近
1.
On the basis of interpolation theory, the algorithm of angle approaching circular interpolation works out the coordinate of interpolation points by angle approaching theorem.
角度逼近圆弧插补算法是在插补原理的基础上,利用角度逼近定理进行迭代计算得到插补点的坐标。
4) Degree of approximation
逼近度
1.
The convergence of these operators in the space Lp is studied and the estimation of the degree of approximation is obtained.
构造了一类Kantorovich型算子,讨论该算子在Lp空间的收敛性并对其逼近度进行估计,给出了李文清构造Bn*(f,x)算子时的相应结果。
2.
In this paper,a kind of generalized Kantorovic operators are constructed,the convergence of these operators in the space Lp (1<p<+∞) is studied and the estimate of the degree of approximation is obtained.
构造了一类推广的Kantorovic型算子,讨论了它们在Lp空间(1
5) approximation order
逼近度
1.
Let D denote the rectangular triangulated by a so-called Type-Ⅱtriangulation △_mn~(2),In this paper,we discuss the transfinite interpolation and appronimation on △_mn~(2) by bivariate cubic splince,with some boundary conditions,we obtain the existence and uniqueness and express of interpolation splines and esitimate their approximation order.
本文主要给出了矩形区域在Ⅱ型剖分下的一类带有边界条件的二元三次样条超限插值，并估计了它的逼近度。
2.
In this paper,we discussed the existence,uniqueness,and approximation order of interpolation by bivariate quartic splines with B-Net in three direction meshes.
本文主要用B－网方法研究了平行六边形区域在三向部分△63下的一类二元四次样条插值，并给出了它的存在性、唯一性及逼近度问题。
3.
The approximation order is discussed,and a numerical solution of PDE and graphical display are also provided.
我们证明了这类插值问题的解的存在性和唯一性,给出了解样条的分片表达式及其逼近度的估计。
6) approximation quality
逼近精度
1.
This paper regards the significance of attributes defined from the approximation quality with respect to the partition and condition attributes set as heuristic information,and proposes the heuristic information into genetic algorithm based on optimizing initial population.
为了获得决策系统中属性的极小相对约简,将决策表中相对于每个条件属性的集合和划分的粗糙逼近精度作为衡量属性重要程度的准则,并以此作为启发式信息引入遗传算法,提出一种在优化初始种群的基础上提高算法性能的启发式遗传算法。
2.
Based on Jelonek s algorithm and approximation quality for a single attribute, an improved reduction algorithm of attributes is given in this paper.
利用单属性的逼近精度 ,在Jelonek属性约简算法的基础上 ,得到一个改进的属性约简算法 。
3.
A criterion is given for measuring attributes importance according to the approximation quality with respect to the partition and condition attributes set.
４３（２０００）０１－０００７－０４摘要：根据信息表中相对每个条件属性的集合和划分的粗糙逼近精度，给出衡量属性重要性程度的一种准则。
补充资料：渐近逼近法
分子式：
CAS号：
性质：又称润滑逼近，逐步逼近，渐近逼近法。是数学中求解函数的一种叠代方法。对函数类A中给定的函数f(x)，要求在另一类较简单的便于计算的函数类B中，求函数p(x)∈B，使P(x)与f(x)之差在某种度量意义下最小。函数类A通常是C[a、b]，函数类B通常是代数多项式、分式有理函数或三角多项式。
CAS号：
性质：又称润滑逼近，逐步逼近，渐近逼近法。是数学中求解函数的一种叠代方法。对函数类A中给定的函数f(x)，要求在另一类较简单的便于计算的函数类B中，求函数p(x)∈B，使P(x)与f(x)之差在某种度量意义下最小。函数类A通常是C[a、b]，函数类B通常是代数多项式、分式有理函数或三角多项式。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条