首页> 外文期刊>urnal of Symbolic Computation >Sylvester-Habicht Sequences and Fast Cauchy Index Computation
【24h】

Sylvester-Habicht Sequences and Fast Cauchy Index Computation

机译:Sylvester-Habicht序列和快速柯西索引计算

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

摘要

In this paper we show how Schonhage's strategy for computing continued fractions Schonhage (1971) can be combined with the theory of sub-resultants (Habicht, 1948; Collins, 1967; Brown, 1971; Brown and Traub, 1971; Loos, 1982; Gonzalez et al., 1990, 1994; Ducos, 1996; Ho and Yap, 1996; Lazard, 1998; Quitte, 1998) in order to compute the Cauchy index of a rational function or the signature of a non-singular Hankel matrix in a fast and also storage efficient way.
机译:在本文中,我们展示了Schonhage的计算连续分数的策略如何将Schonhage(1971)与子结果理论相结合(Habicht,1948; Collins,1967; Brown,1971; Brown and Traub,1971; Loos,1982; Gonzalez (1990,1994; Ducos,1996; Ho and Yap,1996; Lazard,1998; Quitte,1998),以便快速计算有理函数的柯西指数或非奇异Hankel矩阵的签名以及高效的存储方式

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号