introduce a question

introduce a question的基本解释

-

[法] 开始讨论一个问题, 提出问题

与introduce a question相关的网络例句 [注：此内容来源于网络，仅供参考]

First, we introduce and discuss the various methods of multivariate polynomial interpolation in the literature. Based on this study, we state multivariate Lagrange interpolation over again from algebraic geometry viewpoint:Given different interpolation nodes A1,A2 .....,An in the affine n-dimensional space Kn, and accordingly function values fi(i = 1,..., m), the question is how to find a polynomial p K[x1, x2,...,xn] satisfying the interpolation conditions:where X=(x1,X2,....,xn). Similarly with univariate problem, we have provedTheorem If the monomial ordering is given, a minimal ordering polynomial satisfying conditions (1) is uniquely exsisted.Such a polynomial can be computed by the Lagrange-Hermite interpolation algorithm introduced in chapter 2. Another statement for Lagrange interpolation problem is:Given monomials 1 ,2 ,.....,m from low degree to high one with respect to the ordering, some arbitrary values fi(i= 1,..., m), find a polynomial p, such thatIf there uniquely exists such an interpolation polynomial p{X, the interpolation problem is called properly posed.

文中首先对现有的多元多项式插值方法作了一个介绍和评述，在此基础上我们从代数几何观点重新讨论了多元Lagrange插值问题：给定n维仿射空间K~n中两两互异的点A_1，A_2，…，A_m，在结点A_i处给定函数值f_i(i=1，…，m)，构造多项式p∈K[X_1，X_2，…，X_n]，满足Lagrange插值条件：p=f_i，i=1，…，m (1)其中X=(X_1，X_2，…，X_n)，与一元情形相似地，本文证明了定理满足插值条件(1)的多项式存在，并且按"序"最低的多项式是唯一的，上述多项式可利用第二章介绍的Lagrange-Hermite插值算法求出，Lagrange插值另一种描述是：按序从低到高给定单项式ω_1，ω_2，…，ω_m，对任意给定的f_1，f_2，…，f_m，构造多项式p，满足插值条件：p=sum from i=1 to m=Ai=f_i，i=1，…，m (2)如果插值多项式p存在且唯一，则称插值问题适定。

Whether we can get a right selection of NAE will lead to its success or not,there are lots of fuzzy conceptions in the evaluation system of partner selection,it is difficult to measure them,and we can not get a right selection easily,so we introduce fuzzy decision analytics theory to solve this question,and it offers theoretic guidance for partner selection of NAE.

在网络联盟企业中最佳合作伙伴选择的对错与否将直接影响到整个联盟的成败，在合作伙伴的评价体系中有很多模糊概念，很难精确量化，给其选择带来了困难，为此运用模糊分析理论来解决这个问题，从而为网络联盟企业寻找最佳合作伙伴提供理论依据。

First, we introduce and discuss the various methods of multivariate polynomial interpolation in the literature. Based on this study, we state multivariate Lagrange interpolation over again from algebraic geometry viewpoint:Given different interpolation nodes A1,A2 .....,An in the affine n-dimensional space Kn, and accordingly function values fi(i = 1,..., m), the question is how to find a polynomial p K[x1, x2,...,xn] satisfying the interpolation conditions:where X=(x1,X2,....,xn). Similarly with univariate problem, we have provedTheorem If the monomial ordering is given, a minimal ordering polynomial satisfying conditions (1) is uniquely exsisted.Such a polynomial can be computed by the Lagrange-Hermite interpolation algorithm introduced in chapter 2. Another statement for Lagrange interpolation problem is:Given monomials 1 ,2 ,.....,m from low degree to high one with respect to the ordering, some arbitrary values fi(i= 1,..., m), find a polynomial p, such thatIf there uniquely exists such an interpolation polynomial p{X, the interpolation problem is called properly posed.

文中首先对现有的多元多项式插值方法作了一个介绍和评述，在此基础上我们从代数几何观点重新讨论了多元Lagrange插值问题：给定n维仿射空间K~n中两两互异的点A_1，A_2，…，A_m，在结点A_i处给定函数值f_i(i=1，…，m)，构造多项式p∈K[X_1，X_2，…，X_n]，满足Lagrange插值条件：p=f_i，i=1，…，m (1)其中X=(X_1，X_2，…，X_n)，与一元情形相似地，本文证明了定理满足插值条件(1)的多项式存在，并且按&序&最低的多项式是唯一的，上述多项式可利用第二章介绍的Lagrange-Hermite插值算法求出，Lagrange插值另一种描述是：按序从低到高给定单项式ω_1，ω_2，…，ω_m，对任意给定的f_1，f_2，…，f_m，构造多项式p，满足插值条件：p=sum from i=1 to m=Ai=f_i，i=1，…，m (2)如果插值多项式p存在且唯一，则称插值问题适定。