查询词典 Jacobi polynomial

Our results improve the former results. For periodic Jacobi matrix, some new spectral properties of periodic Jacobi matrix are given by studying the relationship of the eigenvalues of periodic Jacobi matrix and its n—1 principal submatrix. Applying these spectral properties, we present a necessary and sufficient condition for the solvability of an inverse problem of periodic Jacobi matrices and discuss the number and the relationship of its solutions. Furthermore, we propose a new algorithm to construct its solution and compare it with the former algorithms. As this inverse problem of periodic Jacobi matrix usually has multiple solutions as many other eigenvalue inverse problems, we study the uniqueness of this problem. And a necessary and sufficient condition is given to ensure its uniqueness, under which an algorithm is presented and the stability analysis is also given. Finally, we put forward a new inverse problem for periodic Jacobi matrix which has not been solved.

对周期Jacobi矩阵特征值反问题，通过研究周期Jacobi矩阵与其n-1阶主子阵特征值的关系，给出了周期Jacobi矩阵的一些新的谱性质；利用这些谱性质，研究了一类周期Jacobi矩阵特征值反问题，用新的方法推导出了该类特征值反问题有解的充分必要条件，并讨论了解的个数以及解与解之间的关系；此外，提出了一种新的构造周期Jacobi矩阵反问题解的数值算法，并与前人的算法做了一定比较；由于周期Jacobi矩阵特征值反问题和其他很多特征值反问题一样往往存在多个解，本论文给出了周期Jacobi矩阵反问题解唯一的充要条件，并发现周期Jacobi矩阵特征值反问题的解唯一当且仅当构造的矩阵满足一定的条件；在解唯一的情况下，给出了构造唯一解的数值算法，并做了相应的稳定性分析；最后，提出了一类新的有待于解决的周期Jacobi矩阵特征值反问题。

Firstly, this paper describes the history and state of the research to the minimal polynomial and the characteristic polynomial and then gives the main methods and its computational complexities for computing the characteristic polynomial and of a constant matrix, the characteristic polynomial of a polynomial matrix and the minimal polynomial of a polynomial.

本文先叙述了对最小多项式和特征多项式的国内外的研究历史和现状，然后给出了已有的计算常数矩阵特征多项式、多项式矩阵的特征多项式和常数矩阵最小多项式的主要算法及其复杂性。

The main results are:(1) the L1 boundedness of the Cesaro means operator of the harmonic expansions on the unit sphere with reflection-invariant measures is proved, and the characterization of the convergence index is given; for the points not in the planes with singularities, the pointwise convergence is also proved; these results are the generalizations of those both for the classical spherical harmonic expansions and for the Jacobi expansions;(2) Using the differential-reflection operators of Dunkl type, the uncertainty principle of a class of Sturm-Liouville operators is established, and as consequences, the uncertainty principles of some well-known classical orthogonal expansions such as Jacobi, Hermite and Laguerre expansions are obtained;(3) by introducing the Cauchy-Riemann equations in terms of the differential-reflection operators of two variables, the harmonic analysis of the extended Jacobi expansions is studied; the results include the Lp boundedness and the weak-L1 boundedness of the conjugate extended Jacobi expansions; specially, for some indexes p smaller than 1, the basic theory of the related Hardy spaces is established.

主要成果有：（1）证明了带有反射不变测度的球面调和展开蔡沙罗平均算子的L1有界性，给出了收敛指标的特征刻划，对不在奇性平面上的点，还证明了点态收敛性，这些成果同时推广了经典球面调和展开和雅可比展开的结果；（2）利用Dunkl型的微分-反射算子建立了一类斯特姆-刘威尔算子的测不准原理，并由此得到一些著名的经典正交展开如雅克比展开、赫米特展开和拉盖尔展开的测不准原理；（3）利用由两个变量的微分-反射算子定义的柯西-黎曼方程组来研究扩展雅克比展开的调和分析，证明了共轭扩展雅克比展开的Lp有界性和弱L1有界性，特别是对小于1的一些指标p，建立了相应的哈代空间的基本理论。

Based on polynomial-interpolation and curve-fitting theory, this paper presents a special feed-forward neural network using Jacobi orthogonal polynomial activation-functions, which exploits a group of order-increased Jacobi orthogonal polynomial functions as the activation-function of hidden-layer neurons.

根据多项式插值与逼近理论，以一组零阀值特例 Jacobi 正交多项式（第二类 Chebyshev 正交多项式）作为隐层神经元的激励函数，构造一种基于 Jacobi 正交基的前向神经网络模型。

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存在且唯一，则称插值问题适定。

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存在且唯一，则称插值问题适定。

It is proved that if'sparse NP complete sets under polynomial-time Turing reductions exist'then 'SAT is polynomial-time non-adaptively search reducible to decision', and that if 'P is not equal to NP'then either'SAT is not polynomial-time non-adaptively search reducible to decision'or'SAT is not polynomial-time truth-table reducible to bounded approximable sets', and that if'P is not equal to NP'then'sparse complete sets for NP under polynomial-time disjunctive reductions do not exist'.

因为用现有的证明技术不可能绝对地解决这个假设，本文研究了这个假设与其他关于SAT结构性质的假设之间的关系，证明了如果'NP有多项式时间图灵归约下的稀疏完全集'则'SAT是多项式时间并行地搜索归约为判定'，以及如果假设'P不等于NP'，则要么'SAT不是多项式时间并行地搜索归约为判定'，要么'SAT不能用多项式时间真值表归约归约为有界可近似集'。

When to get the coefficients of polynomial directly,the ill-conditioned matrix may be produced and effect the precision of result.Using orthogonal polynomial can avoid this problem.This paper introduces 4 orthogonal polynomial.In our discussion,it is proposed to use Chebyshev polynomial and Legendre polynomial,they are easier to sa...

讨论4种常用正交多项式在拟合卫星轨道与时间函数时的适用性；通过计算实例说明利用切比雪夫多项式和勒让德多项式做数据拟合时具有很高的精度；分析得出评定多项式拟合数据精度的适用阶数，实际应用中可降低工作量，提高计算效率；最后讨论同一多项式阶数下不同历元数对拟合结果的影响。

A new method that transforms bitlevel waveform polynomial to word-level polynomial model is given, allowing for simple composition This method offers an efficient way to determine whether two descriptions from different design levels are equivalent, so component reuse, synthesis and verification across design levels can be realized. In addition, an experimental system using C language is established, including modules such as representation of waveform polynomial, decision of path senstization, delay computing, clocking based on single-period sensitization, clocking based on multi-period sensitization, test generation considering noise and transformation from bit-level waveform polynomial to word-level polynomial model. They respectively used to test models and techniques proposed in this paper.

另外，基于C语言本人设计开发了一个实验软件系统，该系统包括波形多项式表示模块、敏化通路判定模块、延时计算模块、单周期敏化的最小时钟周期精确确定模块、多周期敏化的最小时钟周期确定方法模块、考虑噪声的测试生成模块和位级波形多项式描述转化成字级多项式描述模块，分别用于对本文各章中提出的自动化设计的模型和方法进行实验验证。

In the second part, we gave several basic and essential knowledge of inverse eigenvalue problems for Jacobi matrices: such as the properties of tridiagonal matrices, Jacobi matrices, orthogonal polynomials, Gauss quadrature formula and inverse eigenvalue problem for Jacobi matrices.

第二部分介绍了求解Jacobi矩阵反问题的基础：三对角矩阵和Jacobi矩阵，正交多项式，高斯积分方法的性质和Jacobi矩阵特征值反问题。

"Please accept this talisman as a token of our thanks."

请收下这个护身符以表达我们的感谢。

If I have that magic, I will be more acceptable in the society.

如果我拥有那种魔法，我将更加被这个社会所容纳。