Algorithms for the solution of systems of linear equations in commutative ring

11/26/2017
by   Gennadi Malaschonok, et al.
0

Solution methods for linear equation systems in a commutative ring are discussed. Four methods are compared, in the setting of several different rings: Dodgson's method [1], Bareiss's method [2] and two methods of the author - method by forward and back-up procedures [3] and a one-pass method [4]. We show that for the number of coefficient operations, or for the number of operations in the finite rings, or for modular computation in the polynomial rings the one-pass method [4] is the best. The method of forward and back-up procedures [3] is the best for the polynomial rings when we make use of classical algorithms for polynomial operations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2017

Solution of a System of Linear Equations in an Integral Ring

A modified Gauss's algorithm for solving a system of linear equations in...
research
06/12/2017

Beyond Polyhedral Homotopies

We present a new algorithmic framework which utilizes tropical geometry ...
research
12/29/2016

Computing in quotients of rings of integers

We develop algorithms to turn quotients of rings of rings of integers in...
research
04/14/2023

Operations on Fixpoint Equation Systems

We study operations on fixpoint equation systems (FES) over arbitrary co...
research
11/26/2017

Computation of the Adjoint Matrix

The best method for computing the adjoint matrix of an order n matrix in...
research
12/30/2016

On the computation of the HNF of a module over the ring of integers of a number field

We present a variation of the modular algorithm for computing the Hermit...
research
09/22/2020

On Approximating Polynomial-Quadratic Regulator Problems

Feedback control problems involving autonomous polynomial systems are pr...

Please sign up or login with your details

Forgot password? Click here to reset