Top

Programming and Computer Software

Published in:

01-03-2020

Computation of Involutive and Gröbner Bases Using the Tableau Representation of Polynomials

Author: D. A. Yanovich

Published in: Programming and Computer Software | Issue 2/2020

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

For the work with polynomials such data representations as lists of terms, geobuckets, and heaps are usually used. In this paper, an attempt to give a new look on the representation of polynomials for computing involutive and Gröbner bases of systems of nonlinear polynomial equations is made. The proposed approach makes it possible to execute a part of this computational task on the GPU, which opens prospects for solving more complicated problems.

previous article Minimal Representations and Algebraic Relations for Single Nested Products

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

B. Buchberger, B., Gröbner-bases: An algorithmic method in polynomial ideal theory, Multidimensional Systems Theory— Progress, Directions and Open Problems in Multidimensional Systems, Dodrecht: Reidel, 1985, pp. 184–232.

Cox, D., Little, J., and O’Shea, D., Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, New York: Springer, 1997.CrossRef

Gerdt, V.P. and Blinkov, Yu.A., Involutive bases of polynomial ideals, Math. Comp. Simul., 1998, vol. 45, pp. 519–542.MathSciNetCrossRef

Gerdt, V.P. and Blinkov, Yu.A., Involutive divisions of monomials, Program. Comput. Software, 1998, vol. 24, no. 6, pp. 283–285.MathSciNetMATH

Yanovich, D.A., Parallel modular computation of Gröbner and involutive bases, Program. Comput. Software, 2013, vol. 39, no. 2, pp. 110–115.MathSciNetCrossRef

Johnson, S.C., Sparse polynomial arithmetic, ACM SIGSAM Bull., 1974, vol. 8, no. 3, pp. 63–71.CrossRef

Yan, T., The geobucket data structure for polynomials, J. Symb. Comput., 1998, vol. 25, pp. 285–293.MathSciNetCrossRef

Cid, C., Murphy, S., and Robshaw, M.J.B., Small scale variants of the AES, 12th Int. Workshop, FSE 2005, Paris, 2005, pp. 145–162.

Faugère, J.-C. and Joux, A., Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröobner bases, Proc. of the 23rd Annual Int. Cryptology Conf., Santa Barbara, Calif., 2003, pp. 44–60.

10.

Yanovich, D.A., Compact representation of polynomials for algorithms for computing Gröbner and involutive bases, Program. Comput. Software, 2015, vol. 41, no. 2, pp. 126–131.MathSciNetCrossRef

11.

Zimmermann, P., Casamayou, A., Cohen, N., Connan, G., et al. Computational mathematics with SageMath, SIAM, 2018, pp. 203–205.CrossRef

12.

Verschelde, J., The Database with Test Examples. http://www.math.uic.edu/ jan/demo.html

13.

Monagan, M., Sparse polynomial division using a heap, J. Symb. Comput., 2011, vol. 46, pp. 807–822.MathSciNetCrossRef

14.

http://www.valgrind.org

15.

https://github.com/sparsehash/sparsehash

Title: Computation of Involutive and Gröbner Bases Using the Tableau Representation of Polynomials
Author: D. A. Yanovich
Publication date: 01-03-2020
Publisher: Pleiades Publishing
Published in: Programming and Computer Software / Issue 2/2020
Print ISSN: 0361-7688
Electronic ISSN: 1608-3261
DOI: https://doi.org/10.1134/S0361768820020115

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Technik"

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Other articles of this Issue 2/2020

Construction of a Periodic Solution to the Equations of Motion of Generalized Atwood’s Machine using Computer Algebra

On a Machine-Checked Proof for Fraction Arithmetic over a GCD Domain

Algorithm for Constructing an Analogue of the Binet Formula

Bifurcations of Periodic Solutions of a Hamiltonian System with a Discrete Symmetry Group

Normalization of a Periodic Hamiltonian System

Procedures for Searching Laurent and Regular Solutions of Linear Differential Equations with the Coefficients in the Form of Truncated Power Series

Premium Partner