The workshop on Symbolic Combinatorics and Computational Differential Algebra was held from September 14 to September 20, 2015 as part of the Thematic Program on Computer Algebra at the Fields Institute in Toronto, Canada. The workshop was devoted to algorithmic developments in Combinatorics and Differential Algebra with a particular focus on the interaction of these two areas.
{"title":"Workshop on symbolic combinatorics and algorithmic differential algebra","authors":"Manuel Kauers, P. Paule, G. Reid","doi":"10.1145/2930964.2930968","DOIUrl":"https://doi.org/10.1145/2930964.2930968","url":null,"abstract":"The workshop on Symbolic Combinatorics and Computational Differential Algebra was held from September 14 to September 20, 2015 as part of the Thematic Program on Computer Algebra at the Fields Institute in Toronto, Canada. The workshop was devoted to algorithmic developments in Combinatorics and Differential Algebra with a particular focus on the interaction of these two areas.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"13 1","pages":"27-34"},"PeriodicalIF":0.0,"publicationDate":"2016-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81055224","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}
During the second half of 2015, the Fields Institute hosted the Thematic Program on Computer Algebra. This program attracted some 125 individuals working in the subject's various areas.
{"title":"Thematic program in computer algebra: July 1 -- Dec 31, 2015","authors":"G. Labahn, S. Watt","doi":"10.1145/2930964.2930967","DOIUrl":"https://doi.org/10.1145/2930964.2930967","url":null,"abstract":"During the second half of 2015, the Fields Institute hosted the Thematic Program on Computer Algebra. This program attracted some 125 individuals working in the subject's various areas.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"190 1","pages":"25-26"},"PeriodicalIF":0.0,"publicationDate":"2016-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90077536","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}
In the past decade, the introduction of low-level heterogeneous programming models, in particular CUDA, has brought supercomputing to the level of the desktop computer. However, these models bring notable challenges, even to expert programmers. Indeed, fully exploiting the power of hardware accelerators with CUDA-like code often requires significant code optimization e.ort. While this development can certainly yield high performance, it is desirable for some programmers to avoid the explicit management of device initialization and data transfer between memory levels. To this end, high-level models for accelerator programming, like OpenMP and OpenACC, have become an important research direction. With these models, programmers only need to annotate their C/C++ code to indicate which code portion is to be executed on the device and how data maps between host and device.
{"title":"Abstracts of the 2015 east coast computer algebra day","authors":"S. Ilie, A. Storjohann","doi":"10.1145/2930964.2930969","DOIUrl":"https://doi.org/10.1145/2930964.2930969","url":null,"abstract":"In the past decade, the introduction of low-level heterogeneous programming models, in particular CUDA, has brought supercomputing to the level of the desktop computer. However, these models bring notable challenges, even to expert programmers. Indeed, fully exploiting the power of hardware accelerators with CUDA-like code often requires significant code optimization e.ort. While this development can certainly yield high performance, it is desirable for some programmers to avoid the explicit management of device initialization and data transfer between memory levels. To this end, high-level models for accelerator programming, like OpenMP and OpenACC, have become an important research direction. With these models, programmers only need to annotate their C/C++ code to indicate which code portion is to be executed on the device and how data maps between host and device.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"36 1","pages":"35-39"},"PeriodicalIF":0.0,"publicationDate":"2016-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90088117","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}
We survey influential quantitative results on the convergence of the Newton iterator towards simple roots of continuously differentiable maps defined over Banach spaces. We present a general statement of Kantorovich's theorem, with a concise proof from scratch, dedicated to wide audience. From it, we quickly recover known results, and gather historical notes together with pointers to recent articles.
{"title":"A short survey on Kantorovich: like theorems for Newton's method","authors":"Grégoire Lecerf, Joelle Saadé","doi":"10.1145/2930964.2930965","DOIUrl":"https://doi.org/10.1145/2930964.2930965","url":null,"abstract":"We survey influential quantitative results on the convergence of the Newton iterator towards simple roots of continuously differentiable maps defined over Banach spaces. We present a general statement of Kantorovich's theorem, with a concise proof from scratch, dedicated to wide audience. From it, we quickly recover known results, and gather historical notes together with pointers to recent articles.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"43 1","pages":"1-11"},"PeriodicalIF":0.0,"publicationDate":"2016-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87994000","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}
In this presentation, we discuss the application of classical Gröbner basis (or standard basis) techniques to algebraic problems in polynomial rings over fields with non-trivial valuation arising in tropical geometry. The key problem we will study is the computation of a tropical variety, given its ideal in the polynomial ring. All algorithms in this presentation have been implemented in the computer algebra system Singular and are available as part of the official distribution.
{"title":"Computing tropical varieties over fields with valuation using classical standard basis techniques","authors":"Yue Ren","doi":"10.1145/2893803.2893809","DOIUrl":"https://doi.org/10.1145/2893803.2893809","url":null,"abstract":"In this presentation, we discuss the application of classical Gröbner basis (or standard basis) techniques to algebraic problems in polynomial rings over fields with non-trivial valuation arising in tropical geometry.\u0000 The key problem we will study is the computation of a tropical variety, given its ideal in the polynomial ring. All algorithms in this presentation have been implemented in the computer algebra system Singular and are available as part of the official distribution.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"28 1","pages":"127-129"},"PeriodicalIF":0.0,"publicationDate":"2016-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84251592","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}
The purpose of the software presentation is to announce a library to track many solution paths defined by a polynomial homotopy on a Graphics Processing Unit (GPU). Developed on NVIDIA graphics cards with CUDA SDKs, our code is released under the GNU GPL license. Via the C interface to PHCpack, we can call our GPU library from Python.
{"title":"Polynomial homotopy continuation on GPUs","authors":"J. Verschelde, Xiangcheng Yu","doi":"10.1145/2893803.2893810","DOIUrl":"https://doi.org/10.1145/2893803.2893810","url":null,"abstract":"The purpose of the software presentation is to announce a library to track many solution paths defined by a polynomial homotopy on a Graphics Processing Unit (GPU). Developed on NVIDIA graphics cards with CUDA SDKs, our code is released under the GNU GPL license. Via the C interface to PHCpack, we can call our GPU library from Python.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"69 1","pages":"130-133"},"PeriodicalIF":0.0,"publicationDate":"2016-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88405015","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}
We would like to introduce our package using Maple to compute within the q-deformed1 quasi-shuffle algebras and to represent structure of multiple zeta values (MZVs). For this package, we can define an arbitrary alphabet from which the letters associated with indices totally ordered and then carry out computations on words, that will complement functions for the package StringTools in Maple. In the vector space of (noncommutative) polynomials which is equipped q-deformed quasi-shuffle products and concatenation product [1, 2], we compute the bases in duality and express an arbitrary homogeneous polynomial in terms of these bases. Moreover, due to our algorithms, we can represent structure of MZVs on the transcendence bases in terms of irreducible elements [4]. We used this package to compute all examples and verify the results in the paper [4] which was present at the conference ISSAC 2015.
{"title":"Computation tool for the q-deformed quasi-shuffle algebras and representations of structure of MZVs","authors":"V. Bui, G. Duchamp, V. H. N. Minh","doi":"10.1145/2893803.2893806","DOIUrl":"https://doi.org/10.1145/2893803.2893806","url":null,"abstract":"We would like to introduce our package using Maple to compute within the q-deformed1 quasi-shuffle algebras and to represent structure of multiple zeta values (MZVs). For this package, we can define an arbitrary alphabet from which the letters associated with indices totally ordered and then carry out computations on words, that will complement functions for the package StringTools in Maple. In the vector space of (noncommutative) polynomials which is equipped q-deformed quasi-shuffle products and concatenation product [1, 2], we compute the bases in duality and express an arbitrary homogeneous polynomial in terms of these bases. Moreover, due to our algorithms, we can represent structure of MZVs on the transcendence bases in terms of irreducible elements [4]. We used this package to compute all examples and verify the results in the paper [4] which was present at the conference ISSAC 2015.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"15 1","pages":"117-120"},"PeriodicalIF":0.0,"publicationDate":"2016-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75887638","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}
CoCoA is a well-established Computer Algebra System for Computations in Commutative Algebra, and specifically for Gröbner bases. In the last few years the CoCoA software has undergone a profound change: the code has been totally re-written in C++, and includes CoCoA-5 (an interactive system) and CoCoALib (an open source C++ library). The new CoCoA-5 language resembles the old CoCoA-4 language, but has clearly defined semantics, making it both more robust and more flexible than CoCoA-4. CoCoALib is the mathematical core; its design focusses on ease of use so that other software can readily use it as a library for multivariate polynomial computations and other Commutative Algebra operations. The internal design of the software makes it easy to integrate other libraries and to render all CoCoALib extensions accessible via the interactive CoCoA-5 system.
{"title":"What is new in CoCoALib and CoCoA-5?","authors":"J. Abbott, Anna Maria Bigatti","doi":"10.1145/2893803.2893805","DOIUrl":"https://doi.org/10.1145/2893803.2893805","url":null,"abstract":"CoCoA is a well-established Computer Algebra System for Computations in Commutative Algebra, and specifically for Gröbner bases. In the last few years the CoCoA software has undergone a profound change: the code has been totally re-written in C++, and includes CoCoA-5 (an interactive system) and CoCoALib (an open source C++ library).\u0000 The new CoCoA-5 language resembles the old CoCoA-4 language, but has clearly defined semantics, making it both more robust and more flexible than CoCoA-4.\u0000 CoCoALib is the mathematical core; its design focusses on ease of use so that other software can readily use it as a library for multivariate polynomial computations and other Commutative Algebra operations.\u0000 The internal design of the software makes it easy to integrate other libraries and to render all CoCoALib extensions accessible via the interactive CoCoA-5 system.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"46 1","pages":"113-116"},"PeriodicalIF":0.0,"publicationDate":"2016-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75996082","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}
This is the Kickoff Workshop of European Network ARCADES, and also serves as a Recruitment event for the Network's 13 open PhD positions. There is funding available for student participants.
这是欧洲网络拱廊的启动研讨会，也是该网络13个开放博士职位的招聘活动。为学生参与者提供资金。
{"title":"Research workshop on algebraic representations in computer-aided design for complex shapes","authors":"I. Emiris","doi":"10.1145/2893803.2893811","DOIUrl":"https://doi.org/10.1145/2893803.2893811","url":null,"abstract":"This is the Kickoff Workshop of European Network ARCADES, and also serves as a Recruitment event for the Network's 13 open PhD positions. There is funding available for student participants.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"102 1","pages":"134"},"PeriodicalIF":0.0,"publicationDate":"2016-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76768569","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}
CloudMath is an interactive cloud based system for mathematical work independent of the local environment. It uses the advantages of modern web technologies and open mathematical systems.
{"title":"CloudMath: mathematical collaboration within the cloud","authors":"Achim Hornecker","doi":"10.1145/2893803.2893808","DOIUrl":"https://doi.org/10.1145/2893803.2893808","url":null,"abstract":"CloudMath is an interactive cloud based system for mathematical work independent of the local environment. It uses the advantages of modern web technologies and open mathematical systems.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"57 1","pages":"125-126"},"PeriodicalIF":0.0,"publicationDate":"2016-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84786150","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：