{"title":"求解代数方程组的更快算法","authors":"M. Bronstein","doi":"10.1145/32439.32489","DOIUrl":null,"url":null,"abstract":"We apply the elimination property of Gröbner bases with respect to pure lexicographic ordering to solve systems of algebraic equations. We suggest reasons for this approach to be faster than the resultant technique, and give examples and timings that show that it is indeed faster, and more correct, than MACSYMA's solve.","PeriodicalId":314618,"journal":{"name":"Symposium on Symbolic and Algebraic Manipulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Gsolve: a faster algorithm for solving systems of algebraic equations\",\"authors\":\"M. Bronstein\",\"doi\":\"10.1145/32439.32489\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We apply the elimination property of Gröbner bases with respect to pure lexicographic ordering to solve systems of algebraic equations. We suggest reasons for this approach to be faster than the resultant technique, and give examples and timings that show that it is indeed faster, and more correct, than MACSYMA's solve.\",\"PeriodicalId\":314618,\"journal\":{\"name\":\"Symposium on Symbolic and Algebraic Manipulation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Symbolic and Algebraic Manipulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/32439.32489\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Symbolic and Algebraic Manipulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/32439.32489","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Gsolve: a faster algorithm for solving systems of algebraic equations
We apply the elimination property of Gröbner bases with respect to pure lexicographic ordering to solve systems of algebraic equations. We suggest reasons for this approach to be faster than the resultant technique, and give examples and timings that show that it is indeed faster, and more correct, than MACSYMA's solve.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
