计算最近的Gcd认证

Symbolic-Numeric Computation Pub Date : 2009-08-03 DOI:10.1145/1577190.1577200

Guillaume Chèze, Jean-Claude Yakoubsohn, A. Galligo, B. Mourrain

{"title":"计算最近的Gcd认证","authors":"Guillaume Chèze, Jean-Claude Yakoubsohn, A. Galligo, B. Mourrain","doi":"10.1145/1577190.1577200","DOIUrl":null,"url":null,"abstract":"A bisection method, based on exclusion and inclusion tests, is used to address the nearest univariate gcd problem formulated as a bivariate real minimization problem of a rational fraction.\n The paper presents an algorithm, a first implementation and a complexity analysis relying on Smale's α-theory. We report its behavior on an illustrative example.","PeriodicalId":308716,"journal":{"name":"Symbolic-Numeric Computation","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Computing nearest Gcd with certification\",\"authors\":\"Guillaume Chèze, Jean-Claude Yakoubsohn, A. Galligo, B. Mourrain\",\"doi\":\"10.1145/1577190.1577200\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A bisection method, based on exclusion and inclusion tests, is used to address the nearest univariate gcd problem formulated as a bivariate real minimization problem of a rational fraction.\\n The paper presents an algorithm, a first implementation and a complexity analysis relying on Smale's α-theory. We report its behavior on an illustrative example.\",\"PeriodicalId\":308716,\"journal\":{\"name\":\"Symbolic-Numeric Computation\",\"volume\":\"128 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symbolic-Numeric Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1577190.1577200\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symbolic-Numeric Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1577190.1577200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

基于排除和包含检验的二分法用于解决最近的单变量gcd问题，该问题表述为有理分数的二元实极小化问题。本文给出了基于Smale α-理论的算法、初步实现和复杂度分析。我们用一个说明性的例子来报告它的行为。

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

查看原文本刊更多论文

Computing nearest Gcd with certification

A bisection method, based on exclusion and inclusion tests, is used to address the nearest univariate gcd problem formulated as a bivariate real minimization problem of a rational fraction. The paper presents an algorithm, a first implementation and a complexity analysis relying on Smale's α-theory. We report its behavior on an illustrative example.

求助全文

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

来源期刊

Symbolic-Numeric Computation

自引率

0.00%

发文量