一个Matlab包计算多项式的根和多重

SIGSAM Bull. Pub Date : 2004-03-01 DOI:10.1145/980175.980189
Zhonggang Zeng
{"title":"一个Matlab包计算多项式的根和多重","authors":"Zhonggang Zeng","doi":"10.1145/980175.980189","DOIUrl":null,"url":null,"abstract":"MULTROOT is a collection of Matlab modules for accurate computation of polynomial roots, especially roots with high multiplicities, using standard machine precision. As a blackbox-type software, MULTROOT requires the polynomial coefficients as the only input, and outputs the computed roots, multiplicities, backward error, estimated forward error, as well as the pejorative condition number.There are two common limitations for standard numerical root-finding software when multiple roots are present. Namely, those methods suffer from severe loss of accuracy and lack the capacity of multiplicity identification. Symbolic polynomial factorization requires exact rational coefficients. In contrast, the most significant features of MULTROOT are the multiplicity identification capability and the remarkable accuracy on multiple roots without using the multiprecision arithmetic, even if the polynomial coefficients are inexact.There is a so-called \"attainable accuracy\" for conventional root-finders: the attainable number of corrected digits of a computed root is limited by the data/machine precision divided by the multiplicity. For roots with high multiplicities, this accuracy barrier suggests that multiprecision arithmetic is required in addition to exact coefficients. Using a novel approach based on the pejorative manifold theory, MULTROOT achieves high accuracy even if the polynomial is perturbed and the machine precision is not extended. A stable numerical polynomial GCD-finder is also developed as an essential component that determines the multiplicity structure.MULTROOT is a combination of two programs that can be used independently. GCDROOT calculates the multiplicity structure and initial root approximation. PEJROOT refines the root approximations by projecting the polynomial onto a prescribed pejorative manifold. A comprehensive test suit of polynomials that are collected from the literature is included for numerical experiments and performance comparison.The detailed algorithm and analysis is presented in this conference [1].","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A Matlab package computing polynomial roots and multiplicities\",\"authors\":\"Zhonggang Zeng\",\"doi\":\"10.1145/980175.980189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"MULTROOT is a collection of Matlab modules for accurate computation of polynomial roots, especially roots with high multiplicities, using standard machine precision. As a blackbox-type software, MULTROOT requires the polynomial coefficients as the only input, and outputs the computed roots, multiplicities, backward error, estimated forward error, as well as the pejorative condition number.There are two common limitations for standard numerical root-finding software when multiple roots are present. Namely, those methods suffer from severe loss of accuracy and lack the capacity of multiplicity identification. Symbolic polynomial factorization requires exact rational coefficients. In contrast, the most significant features of MULTROOT are the multiplicity identification capability and the remarkable accuracy on multiple roots without using the multiprecision arithmetic, even if the polynomial coefficients are inexact.There is a so-called \\\"attainable accuracy\\\" for conventional root-finders: the attainable number of corrected digits of a computed root is limited by the data/machine precision divided by the multiplicity. For roots with high multiplicities, this accuracy barrier suggests that multiprecision arithmetic is required in addition to exact coefficients. Using a novel approach based on the pejorative manifold theory, MULTROOT achieves high accuracy even if the polynomial is perturbed and the machine precision is not extended. A stable numerical polynomial GCD-finder is also developed as an essential component that determines the multiplicity structure.MULTROOT is a combination of two programs that can be used independently. GCDROOT calculates the multiplicity structure and initial root approximation. PEJROOT refines the root approximations by projecting the polynomial onto a prescribed pejorative manifold. A comprehensive test suit of polynomials that are collected from the literature is included for numerical experiments and performance comparison.The detailed algorithm and analysis is presented in this conference [1].\",\"PeriodicalId\":314801,\"journal\":{\"name\":\"SIGSAM Bull.\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGSAM Bull.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/980175.980189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGSAM Bull.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/980175.980189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

MULTROOT是一个Matlab模块的集合,用于精确计算多项式根,特别是具有高多重的根,使用标准的机器精度。MULTROOT是一个黑箱型软件,只需要多项式系数作为输入,输出计算根、多重、后向误差、估计前向误差以及贬义条件数。当存在多个根时,标准数值寻根软件有两个常见的限制。也就是说,这些方法存在着严重的准确性损失和缺乏多样性识别能力的问题。符号多项式分解需要精确的有理系数。相比之下,MULTROOT最显著的特点是即使多项式系数不精确,也能在不使用多精度算法的情况下对多个根进行多重识别和显著的精度。对于传统的寻根器来说,有一个所谓的“可达到的精度”:计算出的根的可达到的校正位数受到数据/机器精度除以乘数的限制。对于具有高多重的根,这种精度障碍表明,除了精确系数外,还需要多精度算法。利用一种基于贬抑流形理论的新方法,MULTROOT在多项式扰动和机器精度不扩展的情况下也能获得较高的精度。开发了稳定的数值多项式GCD-finder,作为确定多重结构的重要组成部分。mulroot是两个可以独立使用的程序的组合。GCDROOT计算多重结构和初始根近似。PEJROOT通过将多项式投影到指定的贬损流形上来改进根近似。从文献中收集了一个综合的多项式测试套件,用于数值实验和性能比较。详细的算法和分析在会议[1]中提出。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Matlab package computing polynomial roots and multiplicities
MULTROOT is a collection of Matlab modules for accurate computation of polynomial roots, especially roots with high multiplicities, using standard machine precision. As a blackbox-type software, MULTROOT requires the polynomial coefficients as the only input, and outputs the computed roots, multiplicities, backward error, estimated forward error, as well as the pejorative condition number.There are two common limitations for standard numerical root-finding software when multiple roots are present. Namely, those methods suffer from severe loss of accuracy and lack the capacity of multiplicity identification. Symbolic polynomial factorization requires exact rational coefficients. In contrast, the most significant features of MULTROOT are the multiplicity identification capability and the remarkable accuracy on multiple roots without using the multiprecision arithmetic, even if the polynomial coefficients are inexact.There is a so-called "attainable accuracy" for conventional root-finders: the attainable number of corrected digits of a computed root is limited by the data/machine precision divided by the multiplicity. For roots with high multiplicities, this accuracy barrier suggests that multiprecision arithmetic is required in addition to exact coefficients. Using a novel approach based on the pejorative manifold theory, MULTROOT achieves high accuracy even if the polynomial is perturbed and the machine precision is not extended. A stable numerical polynomial GCD-finder is also developed as an essential component that determines the multiplicity structure.MULTROOT is a combination of two programs that can be used independently. GCDROOT calculates the multiplicity structure and initial root approximation. PEJROOT refines the root approximations by projecting the polynomial onto a prescribed pejorative manifold. A comprehensive test suit of polynomials that are collected from the literature is included for numerical experiments and performance comparison.The detailed algorithm and analysis is presented in this conference [1].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信