Related papers: Generalized Reflection Coefficients and Inverse Fa…
This work provides two results obtained as a consequence of an inversion formula for Toeplitz matrices with real symbol. First we obtain an asymptotic expression for the minimal eigenvalues of a Toeplitz matrix with a symbolwhich is…
The Eberlein method is a Jacobi-type process for solving the eigenvalue problem of an arbitrary matrix. In each iteration two transformations are applied on the underlying matrix, a plane rotation and a non-unitary elementary…
We propose a hyperpower iteration for numerical computation of the outer generalized inverse of a matrix which achieves the 18th order of convergence by using only seven matrix multiplication per iteration loop. This is the record high…
It is well-known that a complex circulant matrix can be diagonalized by a discrete Fourier matrix with imaginary unit $\mathtt{i}$. The main aim of this paper is to demonstrate that a quaternion circulant matrix cannot be diagonalized by a…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…
A cross matrix $X$ can have nonzero elements located only on the main diagonal and the anti-diagonal, so that the sparsity pattern has the shape of a cross. It is shown that $X$ can be factorized into products of matrices that are at most…
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,…
A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…
We consider block-structured matrices $A_n$, where the blocks are of (block) unilevel Toeplitz type with $s\times t$ matrix-valued generating functions. Under mild assumptions on the size of the (rectangular) blocks, the asymptotic…
In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…
Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of…
When only few data samples are accessible, utilizing structural prior knowledge is essential for estimating covariance matrices and their inverses. One prominent example is knowing the covariance matrix to be Toeplitz structured, which…
We consider products of $n$ random Hermitian matrices which generalize the one-matrix model and show its relation to Hurwitz numbers which count ramified coverings of certain type. Namely, these Hurwitz numbers count $2k$-fold ramified…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
We present new additive results for the group invertibility in a ring. Then we apply our results to block operator matrices over Banach spaces and derive the existence of group inverses of $2\times 2$ block operator matrices. These…
This paper studies the effects on Zernike coefficients of aperture scaling, translation and rotation, when a given aberrated wavefront is described on the Zernike polynomial basis. It proposes a new analytical method for computing the…
An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…
We consider the question of approximating the inverse $\mathbf W = \mathbf V^{-1}$ of the Galerkin stiffness matrix $\mathbf V$ obtained by discretizing the simple-layer operator $V$ with piecewise constant functions. The block partitioning…
We generalize some earlier results on a Berezin-Toeplitz type of quantization on Hilbert spaces built over certain matrix domains. In the present, wider setting, the theory could be applied to systems possessing several kinematic and…