Algorithms for the Computing Determinants in Commutative Rings

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

Two known computation methods and one new computation method for matrix determinant over an integral domain are discussed. For each of the methods we evaluate the computation times for different rings and show that the new method is the best.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2017

Computation of the Adjoint Matrix

The best method for computing the adjoint matrix of an order n matrix in...
research
03/27/2020

A new method for the computation of eigenvalues

In this paper we are concerned to find the eigenvalues and eigenvectors ...
research
01/25/2023

Stray field computation by inverted finite elements: a new method in micromagnetic simulations

In this paper, we propose a new method for computing the stray-field and...
research
12/08/2019

Improved Algoritms in Parallel Evaluation of Large Cryptographic S-Box

Nowadays computational complexity of fast walsh hadamard transform and n...
research
06/01/2023

A fast and accurate computation method for reflective diffraction simulations

We present a new computation method for simulating reflection high-energ...
research
10/12/2020

Computation of the Complex Error Function using Modified Trapezoidal Rules

In this paper we propose a method for computing the Faddeeva function w(...
research
11/03/2020

Fast Computation of Strong Control Dependencies

We introduce new algorithms for computing non-termination sensitive cont...

Please sign up or login with your details

Forgot password? Click here to reset