Related papers: Algorithms for the Computing Determinants in Commu…
For various $2\leq n,m \leq 6$, we propose some new algorithms for multiplying an $n\times m$ matrix with an $m \times 6$ matrix over a possibly noncommutative coefficient ring.
Motivated by Hirano-Tominaga's work \cite{HT} on rings for which every element is a sum of two idempotents and by de Seguins Pazzis's results \cite{de} on decomposing every matrix over a field of positive characteristic as a sum of…
We present a quantum algorithm for estimating the matrix determinant based on quantum spectral sampling. The algorithm estimates the logarithm of the determinant of an $n \times n$ positive sparse matrix to an accuracy $\epsilon$ in time…
The use of quadratic residues to construct matrices with specific determinant values is a familiar problem with connections to many areas of mathematics and statistics. Our research has focused on using cubic residues to construct matrices…
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time complexity of its algorithm. Among all definitions of determinant of rectangular matrices, used definition has special features which make…
By using a decomposition of the transfer matrix of the two dimensional $q$-state Potts Model to $V^{\prime}_1$ and $V_2$ its determinant is calculated. Our result is a proof for a conjectured formula by Chang and Shrock in [14].
We give a new combinatorial explanation for well-known relations between determinants and traces of matrix powers. Such relations can be used to obtain polynomial-time and poly-logarithmic space algorithms for the determinant. Our new…
We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual…
The computation of determinants or their signs is the core procedure in many important geometric algorithms, such as convex hull, volume and point location. As the dimension of the computation space grows, a higher percentage of the total…
We develop a method of reducing the size of quantum minors in the algebra of n x n quantum matrices. The method is used to show that quantum determinantal factor rings of n x n quantum matrices over the complex numbers are maximal orders,…
We evaluate determinants of "spiral" matrices, which are matrices in which entries are spiralling from the centre of the matrices towards the outside, with prescribed increments from one entry to the next depending on whether one moves…
We make an experimental comparison of methods for computing the numerical radius of an $n\times n$ complex matrix, based on two well-known characterizations, the first a nonconvex optimization problem in one real variable and the second a…
Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…
We extend our techniques developed in our earlier paper appeared in Computational Complexity, 2017 (preprint: arXiv:1508.00690) to obtain a deterministic polynomial time algorithm for computing the non-commutative rank together with…
This note provides formula for determinant and inverse of r-circulant matrices with general sequences of third order. In other words, the study combines many papers in the literature.
A novel algorithm for the computation of the quadratic numerical range is presented and exemplified yielding much better results in less time compared to the random vector sampling method. Furthermore, a bound on the probability for the…
There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…
This article introduces an iterative method for solving nonsingular non-Hermitian positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two non-Hermitian positive…
In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…