首页> 外文会议>Asian Symposium on Computer Mathematics >Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact
【24h】

Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact

机译:多项式的无约束参数最小化:近似和准确

获取原文

摘要

We consider a monic polynomial of even degree with symbolic coefficients. We give a method for obtaining an expression in the coefficients (regarded as parameters) that is a lower bound on the value of the polynomial, or in other words a lower bound on the minimum of the polynomial. The main advantage of accepting a bound on the minimum, in contrast to an expression for the exact minimum, is that the algebraic form of the result can be kept relatively simple. Any exact result for a minimum will necessarily require parametric representations of algebraic numbers, whereas the bounds given here are much simpler. In principle, the method given here could be used to find the exact minimum, but only for low degree polynomials is this feasible; we illustrate this for a quartic polynomial. As an application, we compute rectifying transformations for integrals of trigonometric functions. The transformations require the construction of polynomials that are positive definite.
机译:我们认为甚至是偶数度的单多项式,具有象征系数。我们给出了一种用于在多项式的值的值上获得的系数(被视为参数)中的表达式,或者换句话说在多项式的最小值上的下限。与确切最小最小值的表达相比,接受最小界限的主要优点是结果的代数形式可以保持相对简单。最小的任何确切结果都必须需要代数数字的参数表示,而这里给出的界限更加简单。原则上,这里给出的方法可用于找到确切的最小值,但仅用于低度多项式是这种可行的;我们说明了这一点的四种多项式。作为应用程序,我们计算三角函数的积分的整流转换。变换需要构建积极确定的多项式。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号