Rings: an efficient Java/Scala library for polynomial rings
Abstract
In this paper we briefly discuss \Rings --- an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gr\"obner bases are implemented with the use of modern asymptotically fast algorithms. \Rings can be easily interacted or embedded in applications in high-energy physics and other research areas via a simple API with fully typed hierarchy of algebraic structures and algorithms for commutative algebra. The use of the Scala language brings a quite novel powerful, strongly typed functional programming model allowing to write short, expressive, and fast code for applications. At the same time Rings shows one of the best performances among existing software for algebraic calculations. \Rings is available from http://github.com/PoslavskySV/rings
Cite
@article{arxiv.1712.02329,
title = {Rings: an efficient Java/Scala library for polynomial rings},
author = {Stanislav Poslavsky},
journal= {arXiv preprint arXiv:1712.02329},
year = {2018}
}
Comments
Computer Physics Communications (2018)