Related papers: Efficient Computation for Invertibility Sequence o…
A quasi-Toeplitz $M$-matrix $A$ is an infinite $M$-matrix that can be written as the sum of a semi-infinite Toeplitz matrix and a correction matrix. This paper is concerned with computing the square root of invertible quasi-Toeplitz…
It is well known that square matrices with independent and identically distributed (iid) random entries are typically well conditioned. A natural question is whether this favorable behavior persists for random matrices whose entries obey…
Truncated Toeplitz operators and their asymmetric versions are studied in the context of the Hardy space $H^p$ of the half-plane for $1<p<\infty$. It is shown that they are equivalent after extension to $2 \times 2$ matricial Toeplitz…
Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorithms (static and dynamic). Twin-width is a natural complexity…
We give an easy proof to show that every complex normal Toeplitz matrix is classified as either of type I or of type II. Instead of difference equations on elements in the matrix used in past studies, polynomial equations with coefficients…
We introduce a new sparse estimator of the covariance matrix for high-dimensional models in which the variables have a known ordering. Our estimator, which is the solution to a convex optimization problem, is equivalently expressed as an…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
In this note, we solve an inverse spectral problem for a class of finite band symmetric matrices. We provide necessary and sufficient conditions for a matrix valued function to be a spectral function of the operator corresponding to a…
We present a new superfast algorithm for solving Toeplitz systems. This algorithm is based on a relation between the solution of such problems and syzygies of polynomials or moving lines. We show an explicit connection between the…
We introduce the $k$-banded Cholesky prior for estimating a high-dimensional bandable precision matrix via the modified Cholesky decomposition. The bandable assumption is imposed on the Cholesky factor of the decomposition. We obtained the…
We study the direct and inverse spectral theory for a class of finite Hermitian banded matrices. Using the theory of matrix orthogonal polynomials, we provide an explicit procedure for reconstructing a banded matrix from a matrix-valued…
Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…
Subsequence clustering of multivariate time series is a useful tool for discovering repeated patterns in temporal data. Once these patterns have been discovered, seemingly complicated datasets can be interpreted as a temporal sequence of…
For each non-negative integer $n$ let $\mathcal{A}_n$ be an $n+1$ by $n+1$ Toeplitz matrix over a finite field, $F$, and suppose for each $n$ that $\mathcal{A}_n$ is embedded in the upper left corner of $\mathcal{A}_{n+1}$. We study the…
We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…
A generalized inversion of block T+H matrix is obtained for the first time. In a particular case when T+H matrix is invertible, the method allows to obtain its inverse matrix without an additional condition of invertibility of the…
We investigate the joint convergence of independent random Toeplitz matrices with complex input entries that have a pair-correlation structure, along with deterministic Toeplitz matrices and the backward identity permutation matrix.…
We improve the current best running time value to invert sparse matrices over finite fields, lowering it to an expected $O\big(n^{2.2131}\big)$ time for the current values of fast rectangular matrix multiplication. We achieve the same…
In [2] a new factorization for infinite Hessenberg banded matrices was introduced. In this note we prove that this kind of factorization can also be used for finite matrices. In addition, a new method for solving banded linear systems is…
In this paper, we introduce the notion of (strictly) semimonotone matrices of exact order $k$, where $0\leq k\leq n$, and explore their properties. We fully characterize the $3 \times 3$ (strictly) semimonotone matrices of exact order $2$,…