Related papers: Sarrus' Quilt: A Novel Way to Compute Determinants
We associate with a matrix over an arbitrary field an infinite family of matrices whose sizes vary from one to infinity; their entries are traces of powers of the original matrix. We explicitly evaluate the determinants of matrices in our…
Calculating the log-determinant of a matrix is useful for statistical computations used in machine learning, such as generative learning which uses the log-determinant of the covariance matrix to calculate the log-likelihood of model…
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…
An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
This paper presents new approaches for finding the determinant and inverse of a matrix. The choice of pivot selection is kept arbitrary and can be made according to the users need. So the ill conditioned matrices can be handled easily. The…
This article evaluates the determinants of two classes of special matrices, which are both from a number theory problem. Applications of the evaluated determinants can be found in [arXiv:math.NT/0509523]. Note that the two determinants are…
We develop a new algorithm to compute determinants of all possible Hankel matrices made up from a given finite length sequence over a finite field. Our algorithm fits within the dynamic programming paradigm by exploiting new recursive…
The Darboux transformation is used to obtain multisoliton solutions of the chiral model in two dimensions. The matrix solutions of the principal chiral model and its Lax pair are expressed in terms of quasideterminants. The iteration of the…
The hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into several irreducible factors with multiplicities. Using geometric techniques these factors are identified along with their degrees and their…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
A method is presented for fast diagonalization of a 2x2 or 3x3 real symmetric matrix, that is determination of its eigenvalues and eigenvectors. The Euler angles of the eigenvectors are computed. A small computer algebra program is used to…
The purpose of this article is threefold. First, it provides the reader with a few useful and efficient tools which should enable her/him to evaluate nontrivial determinants for the case such a determinant should appear in her/his research.…
This paper is concerned with the problem of approximating the determinant of A for a large sparse symmetric positive definite matrix A. It is shown that an efficient solution of this problem is obtained by using a sparse approximate inverse…
With a high probability the Sarlos randomized algorithm of 2006 outputs a nearly optimal least squares solution of a highly overdeterminedlinear system of equations. We propose its simple deterministic variation which computes such a…
Parametrization of complex 4 x 4 - matrices G in terms of Dirac tensor parameters (A,B,A_{l},B_{l},F_{kl}) or equivalent four complex 4-vectors (k,m,n,l) is investigated. In the given parametrization, the problem of inverting any 4 x 4…
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
In 1866, Charles Ludwidge Dodgson published a paper concerning a method for evaluating determinants called the condensation method. His paper documented a new method to calculate determinants that was based on Jacobi's Theorem. The…
In this note explicit algorithms for calculating the exponentials of important structured 4 x 4 matrices are provided. These lead to closed form formulae for these exponentials. The techniques rely on one particular Clifford Algebra…