Proceedings of the 2015 International Workshop on Parallel Symbolic Computation最新文献_第2页

GPU-acceleration of optimal permutation-puzzle solving 最优排列解谜的gpu加速

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation Pub Date : 2015-07-10 DOI: 10.1145/2790282.2790289

Hayakawa Hiroki, Ishida Naoaki, M. Hirokazu

引用次数: 3

Parallel sparse interpolation using small primes 使用小素数的并行稀疏插值

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation Pub Date : 2015-06-13 DOI: 10.1145/2790282.2790290

Mohamed Khochtali, Daniel S. Roche, Xisen Tian

引用次数: 2

Gröbner bases over algebraic number fields Gröbner代数数域上的基

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation Pub Date : 2015-04-17 DOI: 10.1145/2790282.2790284

Dereje Kifle Boku, C. Fieker, W. Decker, Andreas Steenpaß

{"title":"Gröbner bases over algebraic number fields","authors":"Dereje Kifle Boku, C. Fieker, W. Decker, Andreas Steenpaß","doi":"10.1145/2790282.2790284","DOIUrl":"https://doi.org/10.1145/2790282.2790284","url":null,"abstract":"Although Buchberger's algorithm, in theory, allows us to compute Gröbner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field K = Q(α), a simple extension of Q, where α is an algebraic number, and let f ∈ Q[t] be the minimal polynomial of α. In this paper we present a new efficient method to compute Gröbner bases in polynomial rings over the algebraic number field K. Starting from the ideas of Noro [11], we proceed by joining f to the ideal to be considered, adding t as an extra variable. But instead of avoiding superfluous S-pair reductions by inverting algebraic numbers, we achieve the same goal by applying modular methods as in [2, 3, 10], that is, by inferring information in characteristic zero from information in characteristic p > 0. For suitable primes p, the minimal polynomial f is reducible over Fp. This allows us to apply modular methods once again, on a second level, with respect to the factors of f. The algorithm thus resembles a divide and conquer strategy and is in particular easily parallelizable. At current state, the algorithm is probabilistic in the sense that, as for other modular Gröbner basis computations, an effective final verification test is only known for homogeneous ideals or for local monomial orderings. The presented timings show that for most examples, our algorithm, which has been implemented in Singular [7], outperforms other known methods by far.","PeriodicalId":384227,"journal":{"name":"Proceedings of the 2015 International Workshop on Parallel Symbolic Computation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116844111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Accelerating polynomial homotopy continuation on a graphics processing unit with double double and quad double arithmetic 用双双和四双算法在图形处理单元上加速多项式同伦延拓

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation Pub Date : 2015-01-26 DOI: 10.1145/2790282.2790294

J. Verschelde, Xiangcheng Yu

引用次数: 8

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation 2015年并行符号计算国际研讨会论文集

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation Pub Date : 1900-01-01 DOI: 10.1145/2790282

引用次数: 1