Related papers: Calculating Determinants of Block Matrices
We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…
In this paper we provide an analytical procedure which leads to a system of $(n-2)^2$ polynomial equations whose solutions give the parameterisation of the complex $n\times n$ Hadamard matrices. It is shown that in general the Hadamard…
In this paper, a new kind of resultant, called the determinantal resultant, is introduced. This operator computes the projection of a determinantal variety under suitable hypothesis. As a direct generalization of the resultant of a very…
Two methods to decompose block matrices analogous to Singular Matrix Decomposition are proposed, one yielding the so called economy decomposition, and other yielding the full decomposition. This method is devised to avoid handling matrices…
The existing calculations of the nuclear matrix elements of the neutrinoless double beta-decay differ by about a factor three. This uncertainty prevents quantative interpretation of the results of experiments searching for this process. We…
We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…
We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…
The nucleon-nucleon t-matrix is calculated directly as function of two vector momenta for different realistic NN potentials. The angular and momentum dependence of the full amplitude is studied and NN observables are calculated.
Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bm{\alpha}=(\alpha_1,...,\alpha_p)$ of nonnegative integers such that $\alpha_1+...+\alpha_p=n$, and $\mathbf{x}=(x_1,...,x_p)$ a vector of…
In this paper we give a new formula for the $n$-th power of a $2\times2$ matrix. More precisely, we prove the following: Let $A= \left ( \begin{matrix} a & b \\ c & d \end{matrix} \right )$ be an arbitrary $2\times2$ matrix, $T=a+d$ its…
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…
The exponential of block triangular matrices arises in a wide range of scientific computing applications, including exponential integrators for solving systems of ordinary differential equations, Hamiltonian systems in control theory,…
The purpose of this paper is to compute asymptotically Hankel determinants for weights that are supported in a semi-infinite interval.The main idea is to reduce the problem to determinants of other operators whose determinant asymptotics…
We consider the moment space $\mathcal{M}^{p}_{2n+1}$ of moments up to the order $2n + 1$ of $p_n\times p_n$ real matrix measures defined on the interval $[0,1]$. The asymptotic properties of the Hankel determinant $\{\log\det…
An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…
Block encoding is a successful technique used in several powerful quantum algorithms. In this work we provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure. The proposed methodology is…
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…
We present an efficient algorithm for computing the permanent for matrices of size N that can written as a product of L block diagonal matrices with blocks of size at most 2. For fixed L, the time and space resources scale linearly in N,…
After analyzing the 4x4 determinant of a matrix, a shortcut was obtained to find such a determinant. Similarly to the Sarrus method for 2x2 or 3x3 determinants, the method consists of laying 19 columns of size 4 each and adding and…