多元多项式函数的极值

多元函数求极值的方法已经众所周知,然而对于一些结构较为复杂的函数,无法求得它的极值,甚至一些驻点都无法得到.本文系统地讨论了多元多项式函数的极值求法,包括自由极值和条件极值.可以看到关键在于解多元多项式方程组,由于比较关心它们的符号解,因此使用了Maple软件,它对于计算帮助很大.     

高考数学（新课程）卷第（20）题分析

新课程卷理20题、文21题是一个求最大值的实际应用题．此题的特点是所建立的数学模型是一个3次的多项式函数．这样设计有两个用意,一是考虑文、理科学生都能做;二是3次多项式函数的极值问题用初等的方法,如二次函数配方求极值的方法、均值定理求极值的方法、判别式求极值的方法等都比较困难,从而引导学生用求导数的方法求极值．这里考查了以下几个方面的知识．     

改进Lagrange插值多项式误差上界的系数

当用Lagrange插值多项式逼近函数时,重要的是要了解误差项的性态.本文研究具有等距节点的Lagrange插值多项式,估计了Lagrange插值多项式逼近函数误差项的上界,改进了小于5次Lagrange插值多项式逼近函数误差界的系数.     

函数系数线性自回归模型的样条估计

基于多项式样条全局光滑方法,建立函数系数线性自回归模型中系数函数的样条估计.在适当条件下,证明了系数函数多项式样条估计的相合性,并给出了它们的收敛速度.模拟例子验证了理论结果的正确性.     

关于等距节点(2n+1)次样条的存在性与唯一性

1.前言 关于系数用偶阶导数表示的(2n 1)次样条函数,使用性能较好,但其存在性与唯一性迄今尚未给出证明.这种样条函数与一般的奇次多项式样条函数一样,当n≥2时,方程组的系数矩阵已不具有明显的主对角元素占优,致使J.H.Ahlberg等人说,直接依赖系数矩阵的性质来证明多项式样条函数的存在性是十分困难的,即便是对于     

关于三次函数及其曲线性质的讨论

就三次函数及其曲线的对称性、极值进行了讨论,得出任何三次函数所表示的曲线都存在唯一拐点,并且关于拐点对称;同时讨论了三次函数存在极值的条件,并给出极值的计算公式。     

n元二次式的极值问题——二次型理论的一种应用

本文用代数工具对n元二次式的极值作一讨论,给出极值的判定和求出极值的一个一般方法。 首先,一般的n元二次多项式形如     

亚纯函数系数微分方程的解和小函数的关系

研究了一类亚纯函数为系数的二阶非齐次线性微分方程的解及其微分多项式和小函数的关系,并得到了这类微分方程解以及解的一阶,二阶导数与微分多项式的不动点性质.     

一类无理函数积分能表成初等函数的充要条件

本文得到了公式式中的Ｐｎ（Ｘ）为ｎ次多项式，Ｑｎ－１（ｘ）为各项系数待定的（ｎ－１）次多项式，λ为待定常数．并在此基础上彻底解决了　　　　　　　　　（ｍ＞２，ｍ∈Ｎ）能表成初等函数的充要条件，这是用其他任何积分法都无法做到的。     

关于Faber多项式的一个注记

Faber多项式通常被用来研究单叶函数的性质,同时也提供了用多项式逼近区域内的解析函数的一个有价值的工具.本文给出一个关于∑类单叶函数的Faber多项式递推公式,并由此得到计算Faber系数的新公式,在一定情形下,它比已有的公式更为简单.     

An expression for the Homflypt polynomial and some applications

Associated with each oriented link is the two variable Homflypt polynomial. The Morton–Franks–Williams (MFW) inequality gives rise to an expression for the Homflypt polynomial with MFW coefficient polynomials. These MFW coefficient polynomials are labeled in a braid-dependent manner and may be zero, but display a number of interesting relations. One consequence is an expression for the first three Laurent coefficient polynomials in z as a function of the other coefficient polynomials and three link invariants: the minimum v-degree and v-span of the Homflypt polynomial, and the Conway polynomial.     

整系数多项式在整数环上不可约性的进一步探讨

本文首先给出了整系数多项式有二次整系数多项式因式的一个必要条件，进而通过对整系数多项式ｆ（ｘ）＝ＡｎＸ２十αｎ－１Ｘｎ－１＋…＋αｏ中ｘｎ－２的系数αｎ－２的讨论，得到一类整系数多项式在整数环上是否可约的一个判别法。     

Skew Schubert functions and the Pieri formula for flag manifolds

We show the equivalence of the Pieri formula for flag manifolds with certain identities among the structure constants for the Schubert basis of the polynomial ring. This gives new proofs of both the Pieri formula and of these identities. A key step is the association of a symmetric function to a finite poset with labeled Hasse diagram satisfying a symmetry condition. This gives a unified definition of skew Schur functions, Stanley symmetric functions, and skew Schubert functions (defined here). We also use algebraic geometry to show the coefficient of a monomial in a Schubert polynomial counts certain chains in the Bruhat order, obtainng a combinatorial chain construction of Schubert polynomials.

     

V-BILIPSCHITZ DETERMINACY OF WEIGHTED HOMOGENEOUS ANALYTIC FUNCTION-GERMS ON WEIGHTED HOMOGENEOUS REAL ANALYTIC VARIETIES

In this article, we provide estimates for the degree of V bilipschitz determinacy of weighted homogeneous function germs defined on weighted homogeneous analytic variety V satisfying a convenient Lojasiewicz condition.The result gives an explicit order such that the geometrical structure of a weighted homogeneous polynomial function germs is preserved after higher order perturbations.     

Static and dynamic stability for geometrically nonlinear governing equations of elastic thin shallow shells

In this study, the governing equations for large deflection of elastic thin shallow shells are deduced into an algebraic cubic equation to determine the unknown coefficient of the assumed deflection by applying Galerkin's method in combination with the algebraic polynomial and Fourier series. For the dynamic problem, the coefficient is replaced by an unknown function of time; after the same process is applied, the governing equations are deduced to be a nonlinear ODE of order two called the Duffing equation, and its analytical solution is known. The combination of the algebraic polynomial and Fourier series gives very rapid convergence in the asymptotic solutions.     

Taylor公式逼近精度的研究

Taylor公式在数值计算中占有很重要的地位;它的余项反映了多项式Qn(x)逼近函数f(x)的程度.在数值计算中,逼近精度的提高,往往要提高其误差的阶,因此本文对Taylor公式的阶进行了提高,并给出了其误差的表达式.     

三奇次散乱点多项式自然样条插值

为解决较为复杂的三变量散乱数据插值问题,提出了一种三元多项式自然样条插值方法.在使得对一种带自然边界条件的目标泛函极小的情况下,用Hilbert空间样条函数方法,构造出了插值问题的解,并可表为一个分块三元三奇次多项式.其表示形式简单,且系数可由系数矩阵对称的线性代数方程组确定.     

A filtered polynomial approach to density estimation

In this paper, a little known computational approach to density estimation based on filtered polynomial approximation is investigated. It is accompanied by the first online available density estimation computer program based on a filtered polynomial approach. The approximation yields the unknown distribution and density as the product of a monotonic increasing polynomial and a filter. The filter may be considered as a target distribution which gets fixed prior to the estimation. The filtered polynomial approach then provides coefficient estimates for (close) algebraic approximations to (a) the unknown density function and (b) the unknown cumulative distribution function as well as (c) a transformation (e.g., normalization) from the unknown data distribution to the filter. This approach provides a high degree of smoothness in its estimates for univariate as well as for multivariate settings. The nice properties as the high degree of smoothness and the ability to select from different target distributions are suited especially in MCMC simulations. Two applications in Sects. 1 and 7 will show the advantages of the filtered polynomial approach over the commonly used kernel estimation method.      

A generalization of the inertia theorem for quadratic matrix polynomials

We show that the inertia of a quadratic matrix polynomial is determined in terms of the inertia of its coefficient matrices if the leading coefficient is Hermitian and nonsingular, the constant term is Hermitian, and the real part of the coefficient matrix of the first degree term is definite. In particular, we prove that the number of zero eigenvalues of such a matrix polynomial is the same as the number of zero eigenvalues of its constant term. We also give some new results for the case where the real part of the coefficient matrix of the first degree term is semidefinite.     

FAST DENSE MATRIX METHOD FOR THE SOLUTION OF INTEGRAL EQUATIONS OF THE SECOND KIND

We present a fast algorithm based on polynomial interpolation to approximate matrices arising from the discretization of second-kind integral equations where the kernel function is either smooth, non-oscillatory and possessing only a finite number of singularities or a product of such function with a highly oscillatory coefficient function. Contrast to wavelet-like approximations, ourapproximation matrix is not sparse. However, the approximation can be construced in O(n) operations and requires O(n) storage, where n is the number of quadrature points used in the discretization. Moreover, the matrix-vector multiplication cost is of order O(nlogn). Thus our scheme is well suitable for conjugate gradient type methods. Our numerical results indicate that the algorithm is very accurate and stable for high degree polynomial interpolation.