{"title":"稀疏多元多项式扩展Hensel构造的各种改进","authors":"Tateaki Sasaki, D. Inaba","doi":"10.1109/SYNASC.2016.025","DOIUrl":null,"url":null,"abstract":"The extended Hensel construction (EHC) is a direct extension of the generalized Hensel construction (GHC), and it targets sparse multivariate polynomials for which the GHC breaks down. The EHC consists of two Hensel constructions which we call separation of \"maximal\" and \"minimal\" Hensel factors (see the text). As for the minimal Hensel factor separation, very recently, we enhanced the old algorithm largely by using Groebner basis of two initial factors and syzygies for the elements of the basis. In this paper, we first improve the old algorithm for maximal Hensel factors. We then enhance further the Groebner basis computation in our recent algorithm. The latter is based on a theoretical analysis of the Groebner bases. Simple experiments show that the improved part for the minimal Hensel factors is much faster than the recent one.","PeriodicalId":268635,"journal":{"name":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"52 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Various Enhancements for Extended Hensel Construction of Sparse Multivariate Polynomials\",\"authors\":\"Tateaki Sasaki, D. Inaba\",\"doi\":\"10.1109/SYNASC.2016.025\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The extended Hensel construction (EHC) is a direct extension of the generalized Hensel construction (GHC), and it targets sparse multivariate polynomials for which the GHC breaks down. The EHC consists of two Hensel constructions which we call separation of \\\"maximal\\\" and \\\"minimal\\\" Hensel factors (see the text). As for the minimal Hensel factor separation, very recently, we enhanced the old algorithm largely by using Groebner basis of two initial factors and syzygies for the elements of the basis. In this paper, we first improve the old algorithm for maximal Hensel factors. We then enhance further the Groebner basis computation in our recent algorithm. The latter is based on a theoretical analysis of the Groebner bases. Simple experiments show that the improved part for the minimal Hensel factors is much faster than the recent one.\",\"PeriodicalId\":268635,\"journal\":{\"name\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"52 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2016.025\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2016.025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Various Enhancements for Extended Hensel Construction of Sparse Multivariate Polynomials
The extended Hensel construction (EHC) is a direct extension of the generalized Hensel construction (GHC), and it targets sparse multivariate polynomials for which the GHC breaks down. The EHC consists of two Hensel constructions which we call separation of "maximal" and "minimal" Hensel factors (see the text). As for the minimal Hensel factor separation, very recently, we enhanced the old algorithm largely by using Groebner basis of two initial factors and syzygies for the elements of the basis. In this paper, we first improve the old algorithm for maximal Hensel factors. We then enhance further the Groebner basis computation in our recent algorithm. The latter is based on a theoretical analysis of the Groebner bases. Simple experiments show that the improved part for the minimal Hensel factors is much faster than the recent one.