求解多项式系统的多重结构计算

Proceedings of the 2005 international symposium on Symbolic and algebraic computation Pub Date : 2005-07-24 DOI:10.1145/1073884.1073902

Barry H. Dayton, Zhonggang Zeng

{"title":"求解多项式系统的多重结构计算","authors":"Barry H. Dayton, Zhonggang Zeng","doi":"10.1145/1073884.1073902","DOIUrl":null,"url":null,"abstract":"This paper presents algorithms for computing the multiplicity structure of a zero to a polynomial system. The zero can be exact or approximate with the system being intrinsic or empirical. As an application, the dual space theory and methodology are utilized to analyze deflation methods in solving polynomial systems, to establish tighter deflation bound, and to derive special case algorithms.","PeriodicalId":311546,"journal":{"name":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"143","resultStr":"{\"title\":\"Computing the multiplicity structure in solving polynomial systems\",\"authors\":\"Barry H. Dayton, Zhonggang Zeng\",\"doi\":\"10.1145/1073884.1073902\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents algorithms for computing the multiplicity structure of a zero to a polynomial system. The zero can be exact or approximate with the system being intrinsic or empirical. As an application, the dual space theory and methodology are utilized to analyze deflation methods in solving polynomial systems, to establish tighter deflation bound, and to derive special case algorithms.\",\"PeriodicalId\":311546,\"journal\":{\"name\":\"Proceedings of the 2005 international symposium on Symbolic and algebraic computation\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"143\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2005 international symposium on Symbolic and algebraic computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1073884.1073902\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1073884.1073902","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 143

摘要

本文给出了计算零到多项式系统的多重结构的算法。零点可以是精确的，也可以是近似的，系统是固有的或经验的。作为应用，利用对偶空间理论和方法分析了多项式系统的压缩方法，建立了更紧的压缩界，并推导了特殊情况下的压缩算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Computing the multiplicity structure in solving polynomial systems

This paper presents algorithms for computing the multiplicity structure of a zero to a polynomial system. The zero can be exact or approximate with the system being intrinsic or empirical. As an application, the dual space theory and methodology are utilized to analyze deflation methods in solving polynomial systems, to establish tighter deflation bound, and to derive special case algorithms.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

自引率

0.00%

发文量