\textsc{Rings}: an efficient Java/Scala library for polynomial rings

DOI10.1016/J.CPC.2018.09.005MaRDI QIDQ6159541zbMATH OpenOpenAlexFDO

Authors Stanislav Poslavsky

Publication date 5 May 2023

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1712.02329

zbMATH Keywords

computer algebracommutative algebrapolynomial arithmetic

Mathematics Subject Classification ID

Packaged methods for numerical algorithms (65Y15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Software, source code, etc. for problems pertaining to quantum theory (81-04) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

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

Recommendations

• Rings: an efficient JVM library for commutative algebra (invited talk)
• On a Java computer algebra system, its performance and applications
• The basic polynomial algebra subprograms
• The basic polynomial algebra subprograms
• Basic polynomial algebra subprograms

Cites work

• scientific article; zbMATH DE number 3977110 (Why is no real title available?)
• scientific article; zbMATH DE number 3785004 (Why is no real title available?)
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 1273640 (Why is no real title available?)
• scientific article; zbMATH DE number 481965 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• A monte carlo method for factorization
• A new efficient algorithm for computing Gröbner bases (F₄)
• A new polynomial factorization algorithm and its implementation
• A novel approach to integration by parts reduction
• Absolute irreducibility of polynomials via Newton polytopes
• Computing GCDs of polynomials over algebraic number fields
• FORM version 4.0
• Factoring polynomials and the knapsack problem
• Factoring polynomials with rational coefficients
• Hilbert functions and the Buchberger algorithm
• Introduction to the GiNaC framework for symbolic computation within the \(\text{C}^{++}\) programming language
• Modular algorithms for computing Gröbner bases.
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On an installation of Buchberger's algorithm
• Prime sieves using binary quadratic forms
• Probabilistic algorithm for testing primality
• Sparse polynomial multiplication and division in Maple 14
• The EEZ-GCD algorithm
• The computation of polynomial greatest common divisors over an algebraic number field
• \$\texttt{Apart}: a generalized \textsc{Mathematica} \texttt{Apart} function
• \textsc{MultivariateResidues} : a Mathematica package for computing multivariate residues

Cited in

(2)

• Rings: an efficient JVM library for commutative algebra (invited talk)
• Accelerating parameter synthesis using semi-algebraic constraints

This page was built for publication: \textsc{Rings}: an efficient Java/Scala library for polynomial rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159541)