Related papers: A new formula for the determinant of $4 \times 4$ …
In this paper, we suggest a new method for a given tensor to find CP decompositions using a less number of rank $1$ tensors. The main ingredient is the Least Absolute Shrinkage and Selection Operator (LASSO) by considering the decomposition…
In this paper, we present a new formula of the determinant tensor $det_n$ for $n \times n$ matrices. In \cite{kim2023newdet4}, Kim, Ju, and Kim found a new formula of $4 \times 4$ determinant tensor $det_4$ which is available when the base…
We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show that the tensor rank of the $n \times n$ determinant tensor…
We present an algorithm computing the determinant of an integer matrix A. The algorithm is introspective in the sense that it uses several distinct algorithms that run in a concurrent manner. During the course of the algorithm partial…
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…
We propose a rescaled LASSO, by premultipying the LASSO with a matrix term, namely linear unified LASSO (LLASSO) for multicollinear situations. Our numerical study has shown that the LLASSO is comparable with other sparse modeling…
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…
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 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…
Algorithms for Gaussian process, marginal likelihood methods or restricted maximum likelihood methods often require derivatives of log determinant terms. These log determinants are usually parametric with variance parameters of the…
This article presents a new method to compute matrices from numerical simulations based on the ideas of sparse sampling and compressed sensing. The method is useful for problems where the determination of the entries of a matrix constitutes…
It has by now become a standard approach to use the theory of sparse (or toric) elimination, based on the Newton polytope of a polynomial, in order to reveal and exploit the structure of algebraic systems. This talk surveys compact…
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 consider the problem of estimating log-determinants of large, sparse, positive definite matrices. A key focus of our algorithm is to reduce computational cost, and it is based on sparse approximate inverses. The algorithm can be…
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…
The sparse difference resultant introduced in \citep{gao-2015} is a basic concept in difference elimination theory. In this paper, we show that the sparse difference resultant of a generic Laurent transformally essential system can be…
We give the first exact determinantal formula for the resultant of an unmixed sparse system of four Laurent polynomials in three variables with arbitrary support. This follows earlier work by the author on exact formulas for bivariate…
A sparse modeling is a major topic in machine learning and statistics. LASSO (Least Absolute Shrinkage and Selection Operator) is a popular sparse modeling method while it has been known to yield unexpected large bias especially at a sparse…
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…
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…