Related papers: Cross product-free matrix pencils for computing ge…
An algebraic condition for the singularity of certain T\"oplitz matrix pencils is derived which involves only the principal minors of the constant parts of the pencils. This leads to an algebraic conjecture which is equivalent to the…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
We introduce a general reduction strategy that enables one to search for solutions of parameterized linear difference equations in difference rings. Here we assume that the ring itself can be decomposed by a direct sum of integral domains…
One of the main features of eigenvalue matrix models is that the averages of characters are again characters, what can be considered as a far-going generalization of the Fourier transform property of Gaussian exponential. This is true for…
In some matrix formations, factorizations and transformations, we need special matrices with some properties and we wish that such matrices should be easily and simply generated and of integers. In this paper, we propose a zero-sum rule for…
Let $R$ be a ring with identity and $J(R)$ be its Jacobson radical. Assume that $a\in R$ is $(b,c)$-invertible and $j_a,j_b,j_c\in J(R)$. This paper provides necessary and sufficient conditions for $a+j_a$ to be $(b+j_b,c+j_c)$-invertible.…
The paper deals with distribution of singular values of product of random matrices arising in the analysis of deep neural networks. The matrices resemble the product analogs of the sample covariance matrices, however, an important…
Recent work in machine learning community proposed multiple methods for performing lossy compression (quantization) of large matrices. This quantization is important for accelerating matrix multiplication (main component of large language…
Let $k$ be a field and $n,a,b$ natural numbers. A matrix pencil $P$ is given by $n$ matrices of the same size with coefficients in $k$, say by $(b\times a)$-matrices, or, equivalently, by $n$ linear transformations $\alpha_i\:k^a \to k^b$…
The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…
Rowland found a matrix product formula for generating functions counting binomial coefficients by their $p$-adic valuations. A natural generalization of binomial coefficients was introduced by Knuth and Wilf defined by a sequence $C$. We…
We introduce an eigenvalue-preserving transformation algorithm from the generalized eigenvalue problem by matrix pencil of the upper and the lower bidiagonal matrices into a standard eigenvalue problem while preserving sparsity, using the…
We present a method for randomizing formulas for bilinear computation of matrix products. We consider the implications of such randomization when there are two sources of error: One due to the formula itself only being approximately…
It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…
We show that the global minimum solution of $\lVert A - BXC \rVert$ can be found in closed-form with singular value decompositions and generalized singular value decompositions for a variety of constraints on $X$ involving rank, norm,…
A careful study of the classical/quantum connection with the aid of coherent states offers new insights into various technical problems. This analysis includes both canonical as well as closely related affine quantization procedures. The…
We discuss several techniques for the evaluation of the generalised Lyapunov exponents which characterise the growth of products of random matrices in the large-deviation regime. A Monte Carlo algorithm that performs importance sampling…
To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unitary matrix similarity and general matrix similarity. There…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
In this article, we have proposed a generalized Lucas matrix (recursive matrix of higher order) having relation with generalized Fibonacci sequences and established many special properties in addition to that usual matrix algebra. Further,…