Related papers: A short note on Multilevel Toeplitz Matrices
This paper presents two universal algorithms for generalized Bellman equations with symmetric Toeplitz matrix. The algorithms are semiring extensions of two well-known methods solving Toeplitz systems in the ordinary linear algebra.
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
In this paper we describe some properties of companion matrices and demonstrate some special patterns that arise when a Toeplitz or a Hankel matrix is multiplied by a related companion matrix. We present a new condition, generalizing known…
We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…
We show that every n-by-n matrix is generically a product of [n/2] + 1 Toeplitz matrices and always a product of at most 2n+5 Toeplitz matrices. The same result holds true if the word "Toeplitz" is replaced by "Hankel", and the generic…
We develop a self-contained framework for real tridiagonal Toeplitz matrices $A_n(a,b,c)$ (diagonal $b$, subdiagonal $a$, superdiagonal $c$) in the symmetrisable regime $ac>0$. A diagonal similarity transforms $A_n(a,b,c)$ into a symmetric…
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…
A matrix $T \in \M_n(\C)$ is \emph{UECSM} if it is unitarily equivalent to a complex symmetric (i.e., self-transpose) matrix. We develop several techniques for studying this property in dimensions three and four. Among other things, we…
In recent years, motivated by computational purposes, the singular value and spectral features of the symmetrization of Toeplitz matrices generated by a Lebesgue integrable function have been studied. Indeed, under the assumptions that $f$…
The condition numbers $CN(T)==||T|| .||T^{-1}|| $ of Toeplitz and analytic $n\times n$ matrices $T$ are studied. It is shown that the supremum of $CN(T)$ over all such matrices with $||T|| \leq1$ and the given minimum of eigenvalues…
In this paper, we find the coefficient bounds using symmetric Toeplitz determinants for the functions belonging to the subclass $R(q)$.
The set of infinite upper-triangular totally positive Toeplitz matrices has a classical parametrisation proved by Edrei et al and originally conjectured by Schoenberg, that involves pairs of sequences of positive real parameters. These…
This paper provides a systematic study of fundamental combinatorial properties of one-dimensional, two-sided infinite simple Toeplitz subshifts. Explicit formulas for the complexity function, the palindrome complexity function and the…
The nearest circulant approximation of a real Toeplitz matrix in the Frobenius norm is derived. This matrix is symmetric. It is proven that symmetric circulant matrices are the only real circulant matrices with all real eigenvalues. The…
Solving the Toeplitz systems, which is to find the vector $x$ such that $T_nx = b$ given an $n\times n$ Toeplitz matrix $T_n$ and a vector $b$, has a variety of applications in mathematics and engineering. In this paper, we present a…
In this article we derive, using standard methods of Toeplitz theory, an asymptotic formula for certain large minors of Toeplitz matrices. D. Bump and P. Diaconis obtained the same asymptotics using representation theory, with an answer…
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured $n\times n$ matrix it can be computed in $\mathcal{O}(n^3)$ operations. An interesting problem arises if the input…
We provide in this work an algorithm for approximating a very broad class of symmetric Toeplitz matrices to machine precision in $\mathcal{O}(n \log n)$ time with applications to fitting time series models. In particular, for a symmetric…
We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…
We present necessary and sufficient conditions for an n\times n complex matrix B to be unitarily similar to a fixed unicellular (i.e., indecomposable by similarity) n\times n complex matrix A