{"title":"Randomized detection of extraneous factors","authors":"Manfred Minimair","doi":"10.1145/2608628.2608631","DOIUrl":null,"url":null,"abstract":"A projection operator of a system of parametric polynomials is a polynomial in the coefficients of the system that vanishes if the system has a common root. The projection operator is a multiple of the resultant of the system, and the factors of the projection operator that are not contained in the resultant are called extraneous factors. The main contribution of this work is to provide a randomized algorithm to check whether a factor is extraneous, which is an important task in applications. A lower bound for the success probability is determined which can be set arbitrarily close to one. This algorithm uses certain matrices rather than Gröbner bases and seems to be the first algorithm of this kind for this task.","PeriodicalId":243282,"journal":{"name":"International Symposium on Symbolic and Algebraic Computation","volume":"237 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2608628.2608631","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A projection operator of a system of parametric polynomials is a polynomial in the coefficients of the system that vanishes if the system has a common root. The projection operator is a multiple of the resultant of the system, and the factors of the projection operator that are not contained in the resultant are called extraneous factors. The main contribution of this work is to provide a randomized algorithm to check whether a factor is extraneous, which is an important task in applications. A lower bound for the success probability is determined which can be set arbitrarily close to one. This algorithm uses certain matrices rather than Gröbner bases and seems to be the first algorithm of this kind for this task.