Every Matrix is a Product of Toeplitz Matrices
Ke Ye,Lek-Heng Lim +1 more
Reads0
Chats0
TLDR
In this article, it was shown that toeplitz and Hankel matrices do not have a subspace of size at most 2n+5, and that such subspaces do not exist even if the factors are symmetric Toplitz or persymmetric Hankel.Abstract:
We show that every $$n\,\times \,n$$n×n matrix is generically a product of $$\lfloor n/2 \rfloor + 1$$?n/2?+1 Toeplitz matrices and always a product of at most $$2n+5$$2n+5 Toeplitz matrices. The same result holds true if the word `Toeplitz' is replaced by `Hankel,' and the generic bound $$\lfloor n/2 \rfloor + 1$$?n/2?+1 is sharp. We will see that these decompositions into Toeplitz or Hankel factors are unusual: We may not, in general, replace the subspace of Toeplitz or Hankel matrices by an arbitrary $$(2n-1)$$(2n-1)-dimensional subspace of $${n\,\times \,n}$$n×n matrices. Furthermore, such decompositions do not exist if we require the factors to be symmetric Toeplitz or persymmetric Hankel, even if we allow an infinite number of factors.read more
Citations
More filters
Journal ArticleDOI
Asymptotic Quantum Algorithm for the Toeplitz Systems
TL;DR: It is shown that the algorithm's complexity is nearly $O(\kappa\textrm{log}^2 n)$, where $\kappa$ and $n$ are the condition number and the dimension of $T_n$ respectively, which implies the algorithm is exponentially faster than the best classical algorithm for the same problem.
Journal ArticleDOI
Toeplitz determinants whose elements are the coefficients of analytic and univalent functions
TL;DR: In this article, the class of analytic and univalent functions in which the Toeplitz determinants are the Taylor coefficients of functions in and certain of its subclasses is studied. But the analysis is restricted to functions of the form.
Posted Content
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations
TL;DR: This work introduces a parameterization of divide-and-conquer methods that can automatically learn an efficient algorithm for many important transforms, and can be incorporated as a lightweight replacement of generic matrices in machine learning pipelines to learn efficient and compressible transformations.
Journal ArticleDOI
Improved Singular Value Decomposition (TopSVD) for Source Number Estimation of Low SNR in Blind Source Separation
TL;DR: An improved singular value decomposition based on Toeplitz (TopSVD) is proposed to solve the problem of inaccurately estimating source numbers under the condition of a low signal-to-noise (SNR) ratio for blind source separation and can significantly improve the accuracy of source number estimation with the simple algorithm.
Journal ArticleDOI
Semi-widely linear estimation of C η -proper quaternion random signal vectors under Gaussian and stationary conditions
TL;DR: Algorithms for estimating C ?
References
More filters
Journal ArticleDOI
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Journal ArticleDOI
A fast algorithm for particle simulations
TL;DR: An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles whose interactions are Coulombic or gravitational in nature, making it considerably more practical for large-scale problems encountered in plasma physics, fluid dynamics, molecular dynamics, and celestial mechanics.
Book
Linear algebraic groups
TL;DR: Conventions and notation background material from algebraic geometry general notions associated with algebraic groups homogeneous spaces solvable groups Borel subgroups reductive groups rationality questions are discussed in this paper.
Journal ArticleDOI
Toeplitz Forms and Their Applications.
TL;DR: In this article, Toeplitz forms are used for the trigonometric moment problem and other problems in probability theory, analysis, and statistics, including analytic functions and integral equations.
Book
Lie groups beyond an introduction
TL;DR: In this paper, closed linear groups Lie Algebras and Lie groups are used to represent finite-dimensional representations of Lie groups, and the structure theory of Semisimple Group Advanced Structure Theory Integration Induced Representations and Branching Theorems are discussed.