Related papers: Efficient Computation for Invertibility Sequence o…
This paper addresses the challenge of Toeplitz covariance matrix estimation from partial entries of random quantized samples. To balance trade-offs among the number of samples, the number of entries observed per sample, and the data…
In this paper we consider pentadiagonal $(n+1)\times(n+1)$ matrices with two subdiagonals and two superdiagonals at distances $k$ and $2k$ from the main diagonal where $1\le k<2k\le n$. We give an explicit formula for their determinants and…
Focusing inversion of potential field data for the recovery of sparse subsurface structures from surface measurement data on a uniform grid is discussed. For the uniform grid the model sensitivity matrices exhibit block Toeplitz Toeplitz…
We consider the ILP Feasibility problem: given an integer linear program $\{Ax = b, x\geq 0\}$, where $A$ is an integer matrix with $k$ rows and $\ell$ columns and $b$ is a vector of $k$ integers, we ask whether there exists…
In a recent paper, Melbourne and Terhesiu [Operator renewal theory and mixing rates for dynamical systems with infinite measure, Invent. Math. 189 (2012), 61-110] obtained results on mixing and mixing rates for a large class of…
In this work we generalize to few fractional differential operators the method used to reverse differential operators $\frac{d^{2n}}{dx^{2n}}$ by inverting a Toeplitz matrix. The interest of this work is to show that the method provides by…
Confidence intervals are a standard technique for analyzing data. When applied to time series, confidence intervals are computed for each time point separately. Alternatively, we can compute confidence bands, where we are required to find…
In the $(k,m)$-mappability problem, for a given sequence $T$ of length $n$, the goal is to compute a table whose $i$th entry is the number of indices $j \ne i$ such that the length-$m$ substrings of $T$ starting at positions $i$ and $j$…
In this paper, we survey some recent results on statistical inference (parametric and nonparametric statistical estimation, hypotheses testing) about the spectrum of stationary models with tapered data, as well as, a question concerning…
We study the problem of scheduling $n$ independent moldable tasks on $m$ processors that arises in large-scale parallel computations. When tasks are monotonic, the best known result is a $(\frac{3}{2}+\epsilon)$-approximation algorithm for…
We present two conjectures regarding the running time of computing symmetric factorizations for a Hankel matrix $\mathbf{H}$ and its inverse $\mathbf{H}^{-1}$ as $\mathbf{B}\mathbf{B}^*$ under fixed-point arithmetic. If solved, these would…
The matrix inversion is an interesting topic in algebra mathematics. However, to determine an inverse matrix from a given matrix is required many computation tools and time resource if the size of matrix is huge. In this paper, we have…
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…
An alternative to the matrix inverse procedure is presented. Given a bit register which is arbitrarily large, the matrix inverse to an arbitrarily large matrix can be peformed in ${\cal O}(N^2)$ operations, and to matrix multiplication on a…
Toeplitz matrices form a rich class of possibly non-normal matrices whose asymptotic spectral analysis in high dimension is well-understood. The spectra of these matrices are notoriously highly sensitive to small perturbations. In this…
Many standard conversion matrices between coefficients in classical orthogonal polynomial expansions can be decomposed using diagonally-scaled Hadamard products involving Toeplitz and Hankel matrices. This allows us to derive…
This paper deals with maximum entropy completion of partially specified block-circulant matrices. Since positive definite symmetric circulants happen to be covariance matrices of stationary periodic processes, in particular of stationary…
We recently introduced the graph invariant twin-width, and showed that first-order model checking can be solved in time $f(d,k)n$ for $n$-vertex graphs given with a witness that the twin-width is at most $d$, called $d$-contraction sequence…
In this paper, we study products of asymmetric Toeplitz matrices, we give necessary and sufficient conditions for the product of two asymmetric Toeplitz matrices compatible sizes is asymmetric Toeplitz matrix. We also give some results…
Covariance matrices of noisy multichannel electroencephalogram time series data are hard to estimate due to high dimensionality. In brain-computer interfaces (BCI) based on event-related potentials and a linear discriminant analysis (LDA)…