【24h】

A Unified Algorithm for Multivariate Analytic Factorization

机译:多元解析因子分解的统一算法

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

摘要

The expansion base algorithm, which was devised by Ab-hyankar, Kuo and McCallum is very efficient for analytic factorization of bivariate polynomials. The author had extended it to more than two variables but it was only for polynomials with non-vanishing leading coefficient at the expansion point. In this paper, we improve it to be able to apply to polynomials including the case of vanishing leading coefficient, that is, singular leading coefficient, which comes to a specific problem only for more than two variables.
机译:Ab-hyankar,Kuo和McCallum设计的扩展基础算法对于双变量多项式的解析因式分解非常有效。作者将其扩展到两个以上的变量,但仅适用于扩展点处前导系数不消失的多项式。在本文中,我们对其进行了改进,使其能够应用于多项式,包括超前系数(即奇异超前系数)消失的情况,仅对于两个以上的变量,这才成为一个特定问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号