首页> 外文期刊>urnal of Symbolic Computation >Approximate solutions of polynomial equations
【24h】

Approximate solutions of polynomial equations

机译:多项式方程的近似解

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we introduce "approximate solutions" to solve the following problem: given a polynomial F(x, y)over Q, where x represents an n-tuple of variables, can we find all the polynomials G(x)such that F(x, G(x))is identically equal to a constant c in Q? We have the following: let F(x, y)be a polynomial over Q and the degree of y in F(x, y)be n. Either there is a unique polynomials g(x)∈Q[x], with its constant term equal to 0, such that F(x, y)=∑~n_j=0c_j(x)~j for some rational numbers c)j, hence, F(x, g(x)+a)∈Q for all a∈Q, or there are at most t distinct polynomials g1(x),..., g_t(x_, t≤n, such that F(x, g_i(x))∈Q for 1≤i≤t.
机译:在本文中,我们引入“近似解”来解决以下问题:给定Q上的多项式F(x,y),其中x表示变量的n元组,​​我们可以找到所有多项式G(x)使得F(x,G(x))等于Q中的常数c?我们有以下内容:令F(x,y)是Q上的多项式,而F(x,y)中y的阶数是n。有一个唯一的多项式g(x)∈Q[x],其常数项等于0,这样对于某些有理数c)j,F(x,y)= ∑〜n_j = 0c_j(x)〜j ,因此,对于所有a∈Q,F(x,g(x)+ a)∈Q,或至多存在t个不同的多项式g1(x),...,g_t(x_,t≤n,使得F 1≤i≤t的(x,g_i(x))∈Q。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号