Implementation of a Near-Optimal Complex Root Clustering Algorithm-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Implementation of a Near-Optimal Complex Root Clustering Algorithm

Published:2018 Issue: Volume: Page:235-244
ISSN:0302-9743
Container-title:Mathematical Software – ICMS 2018
language:
Short-container-title:

Author:

Imbach Rémi,Pan Victor Y.,Yap Chee

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-96418-8_28

Reference16 articles.

1. Becker, R., Sagraloff, M., Sharma, V., Xu, J., Yap, C.: Complexity analysis of root clustering for a complex polynomial. In: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp. 71–78. ACM (2016)

2. Becker, R., Sagraloff, M., Sharma, V., Yap, C.: A near-optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration. J. Symb. Comput. 86, 51–96 (2018)

3. Bini, D.A., Fiorentino, G.: Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numer. Algorithms 23(2–3), 127–173 (2000)

4. Bini, D.A., Robol, L.: Solving secular and polynomial equations: a multiprecision algorithm. J. Comput. Appl. Math. 272, 276–292 (2014)

5. Brönnimann, H., Burnikel, C., Pion, S.: Interval arithmetic yields efficient dynamic filters for computational geometry. Discrete Appl. Math. 109(1–2), 25–47 (2001)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues;Lecture Notes in Computer Science;2023

2. Root-Squaring for Root-Finding;Computer Algebra in Scientific Computing;2023

3. Accelerated Subdivision for Clustering Roots of Polynomials Given by Evaluation Oracles;Computer Algebra in Scientific Computing;2022

4. Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation with Application to Real Root Isolation;Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation;2021-07-18

5. Approximate GCD in Lagrange bases;2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2020-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3