Abstract
Algorithms are proposed for solving linear equations and systems of such equations in associative noncommutative rings with unit provided that all coefficients in the equations are unit divisors. Basic concepts of the theory of rings and examples of operation of the proposed algorithms are given. The complexity of the algorithms depends on the properties of the elements of the ring over which the equations and systems of equations are considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. L. Kryvyi, “Algorithms for solving systems of linear diophantine equations in residue rings,” Cybern. Syst. Analysis, Vol. 43, No. 6, 787–798 (2007). https://doi.org/https://doi.org/10.1007/s10559-007-0103-1.
S. L. Kryvyi, “An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers,” Cybern. Syst. Analysis, Vol. 45, No. 6, 875–880 (2009). https://doi.org/10.1007/s10559-009-9160-y.
A. I. Kostrikin, Introduction to Algebra, Pt. 2 [in Russian], Fizmatlit, Moscow (2004).
V. V. Skobelev, Automata over Algebraic Structures: Models and Methods of Its Investigation [in Russian], IPMM NANU, Donetsk (2013).
A. Bockmayr, V. Weispfenning, and M. Maher, “Solving numerical constraints,” in: Handbook of Automated Reasoning, Ch. 12 (2001), pp. 753–842.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetyka ta Systemnyi Analiz, No. 6, November–December, 2021, pp. 3–12.
Rights and permissions
About this article
Cite this article
Kryvyi, S. Algorithms for Solving Linear Equations over Associative Rings with Unit Element. Cybern Syst Anal 57, 843–852 (2021). https://doi.org/10.1007/s10559-021-00410-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-021-00410-5