Related papers: Sarrus' Quilt: A Novel Way to Compute Determinants
This paper is devoted to the analysis of a false generalization of the rule of Sarrus and its properties that can be derived with the help of dihedral groups. Further, we discuss a Sarrus-like scheme that could be helpful for students to…
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…
The Cullis' determinant is a generalization of the ordinary determinant for rectangular matrices. It is defined as the alternating sum of maximal minors of given matrix. In this paper we express the Cullis' determinant of a matrix $X$ as…
In the following short paper we list some useful results concerning determinants and inverses of matrices. First we show, how to calculate determinants of $d \times d$ matrices, if their traces are known. As a next step $4 \times 4$…
We present here a new method for evaluating determinants -- the reduction method. Firstly, in the section 2, we apply it to third-order determinants and after, in the section 3, we generalize it to higher-order determinants. In the section…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…
A new matrix operation based on inserting columns and rows, similarly to the mediant operation between fractions, gives rise to the Farey determinants matrix or, equivalently, the matrix of the numerators of the differences of Farey…
We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from $\{0,1\}$ or $\{-1,1\}$. We describe efficient parallel algorithms for…
Based on geometric intuition, in this paper we are trying to give an idea and visualize the meaning of the determinants for the cubic-matrix. In this paper we have analyzed the possibilities of developing the concept of determinant of…
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…
In this paper, we present a new formula for the determinant of a $4 \times 4$ matrix. We approach via the sparse optimization problem and derive the formula through the Least Absolute Shrinkage and Selection Operator (LASSO). Our formula…
In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both…
Matrix determinants play an important role in data analysis, in particular when Gaussian processes are involved. Due to currently exploding data volumes, linear operations - matrices - acting on the data are often not accessible directly…
In this paper, in continuation of our work, on the determinants of cubic -matrix of order 2 and order 3, we have analyzed the possibilities of developing the concept of determinant of cubic-matrix with three indexes, studying the…
We define quantum determinants in Quantum Matrix Algebras, related to couples of compatible braidings following the scheme from [G]. We establish relations between these determinants and the so-called column-(row-)determinants, often used…
We present a new technique for computing Hilbert series of N=1 supersymmetric QCD in four dimensions with unitary and special unitary gauge groups. We show that the Hilbert series of this theory can be written in terms of determinants of…
A saturated D-optimal design is a {+1,-1} square matrix of given order with maximal determinant. We search for saturated D-optimal designs of orders 19 and 37, and find that known matrices due to Smith, Cohn, Orrick and Solomon are optimal.…
Efficient matrix determinant calculations have been studied since the 19th century. Computers expand the range of determinants that are practically calculable to include matrices with symbolic entries. However, the fastest determinant…
We present a new, practical algorithm for computing the determinant of a non-singular dense, uniform matrix over Z; the aim is to achieve better practical efficiency, which is always at least as good as currently known methods. The…