相关论文: Four short stories about Toeplitz matrix calculati…
We investigate two systematic constructions of inverse-closed subalgebras of a given Banach algebra or operator algebra A, both of which are inspired by classical principles of approximation theory. The first construction requires a closed…
Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…
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…
In 1989 we proposed to employ Vandermonde and Hankel multipliers to transform into each other the matrix structures of Toeplitz, Hankel, Vandermonde and Cauchy types as a means of extending any successful algorithm for the inversion of…
We summarize some of the recent developments which link certain problems in combinatorial theory related to random growth to random matrix theory.
We propose a high precision algorithm for solving the Gelfand-Levitan-Marchenko equation. The algorithm is based on the block version of the Toeplitz Inner-Bordering algorithm of Levinson's type. To approximate integrals, we use the…
We consider an inverse problem of determining coefficient matrices in an $N$-system of second-order elliptic equations in a bounded two dimensional domain by a set of Cauchy data on arbitrary subboundary. The main result of the article is…
In this paper, we present four constructions of {general} self-orthogonal matrix-product codes associated with Toeplitz matrices. The first one relies on the {dual} of a known {general} dual-containing matrix-product code; the second one is…
We consider linear systems arising from the use of the finite element method for solving scalar linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by…
The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix exponential of a subgenerator having a block-triangular, block-Toeplitz structure. To this end, we propose some algorithms which exploit the…
In this paper the authors show how to use Riemann-Hilbert techniques to prove various results, some old, some new, in the theory of Toeplitz operators and orthogonal polynomials on the unit circle (OPUC's). There are four main results: the…
Bilipschitz invariant theory concerns low-distortion embeddings of orbit spaces into Euclidean space. To date, embeddings with the smallest-possible distortion are known for only a few cases, to include: (a) planar rotations, (b) real phase…
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…
Motivated by [9] we study the existence of the inverse of infinite Hermitian moment matrices associated with measures with support on the complex plane. We relate this problem to the asymptotic behaviour of the smallest eigenvalues of…
We present a sublinear query algorithm for outputting a near-optimal low-rank approximation to any positive semidefinite Toeplitz matrix $T \in \mathbb{R}^{d \times d}$. In particular, for any integer rank $k \leq d$ and $\epsilon,\delta >…
The purpose of this work is to bound sofic topological entropy of Toeplitz systems over residually finite groups and to prove the Krieger Theorem about attaining arbitrary entropy by the Toeplitz systems. To achieve these results, we…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Toeplitz Block Toeplitz matrices using minimized matrix-vector products, with a complexity…
We consider the asymptotic behavior of the eigenvalues of Toeplitz matrices with rational symbol as the size of the matrix goes to infinity. Our main result is that the weak limit of the normalized eigenvalue counting measure is a…
Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…
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…