On the asymptotic spectrum of Hermitian block Toeplitz matrices with Toeplitz blocks

We study the asymptotic behaviour of the eigenvalues of Hermitian block Toeplitz matrices , with Toeplitz blocks. Such matrices are generated by the Fourier coefficients of an integrable bivariate function , and we study their eigenvalues for large and , relating their behaviour to some properties of as a function; in particular we show that, for any fixed , the first eigenvalues of tend to , while the last tend to , so extending to the block case a well-known result due to Szegö. In the case the 's are positive-definite, we study the asymptotic spectrum of , where is a block Toeplitz preconditioner for the conjugate gradient method, applied to solve the system , obtaining strict estimates, when and are fixed, and exact limit values, when and tend to infinity, for both the condition number and the conjugate gradient convergence factor of the previous matrices. Extensions to the case of a deeper nesting level of the block structure are also discussed.

     

On the distribution singular values of Toeplitz matrices

We prove a second order formula concerning distribution of singular values of Toeplitz matrices in some cases when conditions of the H. Widom Theorem are not satisfied.

     

Extreme eigenvalues of real symmetric Toeplitz matrices

We exploit the even and odd spectrum of real symmetric Toeplitz matrices for the computation of their extreme eigenvalues, which are obtained as the solutions of spectral, or secular, equations. We also present a concise convergence analysis for a method to solve these spectral equations, along with an efficient stopping rule, an error analysis, and extensive numerical results.

     

On five-diagonal Toeplitz matrices and orthogonal polynomials on the unit circle

This paper deals with modifications of the Lebesgue moment functional by trigonometric polynomials of degree 2 and their associated orthogonal polynomials on the unit circle. We use techniques of five-diagonal matrix factorization and matrix polynomials to study the existence of such orthogonal polynomials.Dedicated to Prof. Luigi Gatteschi on his 70th birthdayThis research was partially supported by Diputación General de Aragón under grant P CB-12/91.     

Preconditioners for ill‐posed Toeplitz matrices with differentiable generating functions

Both theoretical analysis and numerical experiments in the literature have shown that the Tyrtyshnikov circulant superoptimal preconditioner for Toeplitz systems can speed up the convergence of iterative methods without amplifying the noise of the data. Here we study a family of Tyrtyshnikov‐based preconditioners for discrete ill‐posed Toeplitz systems with differentiable generating functions. In particular, we show that the distribution of the eigenvalues of these preconditioners has good regularization features, since the smallest eigenvalues stay well separated from zero. Some numerical results confirm the regularization effectiveness of this family of preconditioners. Copyright © 2009 John Wiley & Sons, Ltd.     

Asymptotic spectra of large matrices coming from the symmetrization of Toeplitz structure functions and applications to preconditioning

The singular value distribution of the matrix‐sequence {Y_nT_n[f]}_n , with T_n[f] generated by $f\in L^1([?\pi ,\pi ])$, was shown in [J. Pestana and A.J. Wathen, SIAM J Matrix Anal Appl. 2015;36(1):273‐288]. The results on the spectral distribution of {Y_nT_n[f]}_n were obtained independently in [M. Mazza and J. Pestana, BIT, 59(2):463‐482, 2019] and [P. Ferrari, I. Furci, S. Hon, M.A. Mursaleen, and S. Serra‐Capizzano, SIAM J. Matrix Anal. Appl., 40(3):1066‐1086, 2019]. In the latter reference, the authors prove that {Y_nT_n[f]}_n is distributed in the eigenvalue sense as $${?}_{|f|}(\theta )=\left\{\begin{array}{ll}|f(\theta )|,& \theta \in [0,2\pi ],\\ ?|f(?\theta )|,& \theta \in [?2\pi ,0),\end{array}\right.$$ under the assumptions that f belongs to $L^1([?\pi ,\pi ])$ and has real Fourier coefficients. The purpose of this paper is to extend the latter result to matrix‐sequences of the form {h(T_n[f])}_n , where h is an analytic function. In particular, we provide the singular value distribution of the sequence {h(T_n[f])}_n , the eigenvalue distribution of the sequence {Y_nh(T_n[f])}_n , and the conditions on f and h for these distributions to hold. Finally, the implications of our findings are discussed, in terms of preconditioning and of fast solution methods for the related linear systems.     

Flat portions on the boundary of the numerical ranges of certain Toeplitz matrices

We give criterions for a flat portion to exist on the boundary of the numerical range of a matrix. A special type of Teoplitz matrices with flat portions on the boundary of its numerical range are constructed. We show that there exist 2 × 2 nilpotent matrices A₁,A₂, an n  × n nilpotent Toeplitz matrix N_n, and an n  × n cyclic permutation matrix S_n(s) such that the numbers of flat portions on the boundaries of W(A₁⊕N_n) and W(A₂⊕S_n(s)) are, respectively, 2(n - 2) and 2n.     

Distribution of Eigenvalues of Real Symmetric Palindromic Toeplitz Matrices and Circulant Matrices

Consider the ensemble of real symmetric Toeplitz matrices, each independent entry an i.i.d. random variable chosen from a fixed probability distribution p of mean 0, variance 1, and finite higher moments. Previous investigations showed that the limiting spectral measure (the density of normalized eigenvalues) converges weakly and almost surely, independent of p, to a distribution which is almost the standard Gaussian. The deviations from Gaussian behavior can be interpreted as arising from obstructions to solutions of Diophantine equations. We show that these obstructions vanish if instead one considers real symmetric palindromic Toeplitz matrices, matrices where the first row is a palindrome. A similar result was previously proved for a related circulant ensemble through an analysis of the explicit formulas for eigenvalues. By Cauchy’s interlacing property and the rank inequality, this ensemble has the same limiting spectral distribution as the palindromic Toeplitz matrices; a consequence of combining the two approaches is a version of the almost sure Central Limit Theorem. Thus our analysis of these Diophantine equations provides an alternate technique for proving limiting spectral measures for certain ensembles of circulant matrices. A. Massey’s current address: Department of Mathematics, UCLA, Los Angeles, CA 90095, USA. e-mail: amassey3102@math.ucla.edu.     

On the matrices in B-spline collocation methods for Riesz fractional equations and their spectral properties

In this work, we focus on a fractional differential equation in Riesz form discretized by a polynomial B-spline collocation method. For an arbitrary polynomial degree $p$, we show that the resulting coefficient matrices possess a Toeplitz-like structure. We investigate their spectral properties via their symbol and we prove that, like for second order differential problems, the given matrices are ill-conditioned both in the low and high frequencies for large $p$. More precisely, in the fractional scenario the symbol vanishes at 0 with order $\alpha$, the fractional derivative order that ranges from 1 to 2, and it decays exponentially to zero at $\pi$ for increasing $p$ at a rate that becomes faster as $\alpha$ approaches 1. This translates into a mitigated conditioning in the low frequencies and into a deterioration in the high frequencies when compared to second order problems. Furthermore, the derivation of the symbol reveals another similarity of our problem with a classical diffusion problem. Since the entries of the coefficient matrices are defined as evaluations of fractional derivatives of the B-spline basis at the collocation points, we are able to express the central entries of the coefficient matrix as inner products of two fractional derivatives of cardinal B-splines. Finally, we perform a numerical study of the approximation behavior of polynomial B-spline collocation. This study suggests that, in line with nonfractional diffusion problems, the approximation order for smooth solutions in the fractional case is $p+2-\alpha$ for even $p$, and $p+1-\alpha$ for odd $p$.     

Asymptotic properties of the QR factorization of banded Hessenberg–Toeplitz matrices

We consider Givens QR factorization of banded Hessenberg–Toeplitz matrices of large order and relatively small bandwidth. We investigate the asymptotic behaviour of the R factor and Givens rotation when the order of the matrix goes to infinity, and present some interesting convergence properties. These properties can lead to savings in the computation of the exact QR factorization and give insight into the approximate QR factorizations of interest in preconditioning. The properties also reveal the relation between the limit of the main diagonal elements of R and the largest absolute root of a polynomial. Copyright © 2005 John Wiley & Sons, Ltd.     

Irregular sampling, Toeplitz matrices, and the approximation of entire functions of exponential type

In many applications one seeks to recover an entire function of exponential type from its non-uniformly spaced samples. Whereas the mathematical theory usually addresses the question of when such a function in can be recovered, numerical methods operate with a finite-dimensional model. The numerical reconstruction or approximation of the original function amounts to the solution of a large linear system. We show that the solutions of a particularly efficient discrete model in which the data are fit by trigonometric polynomials converge to the solution of the original infinite-dimensional reconstruction problem. This legitimatizes the numerical computations and explains why the algorithms employed produce reasonable results. The main mathematical result is a new type of approximation theorem for entire functions of exponential type from a finite number of values. From another point of view our approach provides a new method for proving sampling theorems.

     

On a class of matrices generated by certain generalized permutation matrices and applications

ABSTRACT

In this paper, we study a particular class of matrices generated by generalized permutation matrices corresponding to a subgroup of some permutation group. As applications, we first present a technique from which we can get closed formulas for the roots of many families of polynomial equations with degree between 5 and 10, inclusive. Then, we describe a tool that shows how to find solutions to Fermat's last theorem and Beal's conjecture over the square integer matrices of any dimension. Finally, simple generalizations of some of the concepts in number theory to integer square matrices are presented.     

On the fine spectra of triangular Toeplitz operators

The fine spectra of triangular double-band and triple-band matrices were examined by several authors. Here we determine the fine spectra of Toeplitz operators, which are represented by upper and lower triangular n-band infinite matrices, over the sequence spaces c₀ and c. Also some spectral results over ?_∞ are given.     

Solution of systems with Toeplitz matrices generated by rational functions

We consider Toeplitz matrices T_n = (t_i−j)ⁿ_i,j=0, where Σ^∞_−∞t_jz^j is a formal Laurent series of a rational function R(z). A criterion is given for T_n to be invertible, in terms of the nonvanishing of a determinant D_n involving the zeros of R(z), and of order and form independent of n; i.e., n enters into D_n as a parameter, and not so as to complicate D_n as n increases. Explicit formulas involving similar determinants are given for the solution of the system T_nX = Y in the case where T_n is invertible. Formulas are also given for T⁻¹_n in the case where T_n−1 and T_n are both convertible Suggestions concerning possible computational procedures based on the results are included.     

Coupled Vandermonde matrices and the superfast computation of Toeplitz determinants

Let n be a positive integer, let be complex numbers and let be a nonsingular n × n complex Toeplitz matrix. We present a superfast algorithm for computing the determinant of T. Superfast means that the arithmetic complexity of our algorithm is , where N denotes the smallest power of 2 that is larger than or equal to n. We show that det T can be computed from the determinant of a certain coupled Vandermonde matrix. The latter matrix is related to a linearized rational interpolation problem at roots of unity and we show how its determinant can be calculated by multiplying the pivots that appear in the superfast interpolation algorithm that we presented in a previous publication. This revised version was published online in June 2006 with corrections to the Cover Date.