Related papers: Inexact Shift-and-Invert Arnoldi for Toeplitz Matr…
Asymptotic expansion of the eigenvalues of a Toeplitz matrix with real symbol. This work provides two results obtained as a consequence of an inversion formula for Toeplitz matrices with real symbol. First we obtain an symptotic expression…
New algorithms are presented for computing annihilating polynomials of Toeplitz, Hankel, and more generally Toeplitz+ Hankel-like matrices over a field. Our approach follows works on Coppersmith's block Wiedemann method with structured…
In recent years, a number of fast algorithms for computing the determinant of a Toeplitz matrix were developed. The fastest algorithm we know so far is of order $k^2\log{n}+k^3$, where $n$ is the number of rows of the Toeplitz matrix and…
We study the weighted compactness and boundedness of Toeplitz operators on the Fock spaces. Fix $\alpha>0$. Let $T_{\varphi}$ be the Toeplitz operator on the Fock space $F^2_{\alpha}$ over $\mathbb{C}^n$ with symbol $\varphi\in L^{\infty}$.…
We survey the numerical stability of some fast algorithms for solving systems of linear equations and linear least squares problems with a low displacement-rank structure. For example, the matrices involved may be Toeplitz or Hankel. We…
Consider random symmetric Toeplitz matrices $T_{n}=(a_{i-j})_{i,j=1}^{n}$ with matrix entries $a_{j}, j=0,1,2,...,$ being independent real random variables such that \be \mathbb{E}[a_{j}]=0, \ \ \mathbb{E}[|a_{j}|^{2}]=1 \ \ \textrm{for}\,\…
Toeplitz matrices for the study of the fractional Laplacian on a bounded interval. In this work we get a deep link between (--$\Delta$) $\alpha$ ]0,1[ the fractional Laplacian on the interval ]0, 1[ and T N ($\Phi$ $\alpha$) the Toeplitz…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…
This work was originally published by the author in 1999 in a book [1] and later became part of the author's doctoral thesis in 1999 [2]. Since the original language of these works is not English, the author provides a translation of the…
In this paper, we propose an improved iterative method for solving the monotone inclusion problem in the form of $0 \in Ax + Dx + N_{C}(x)$ in real Hilbert space, where $A$ is a maximally monotone operator, $D$ and $B$ are monotone and…
A powerful tool for analyzing and approximating the singular values and eigenvalues of structured matrices is the theory of GLT sequences. By the GLT theory one can derive a function, which describes the singular value or the eigenvalue…
Under appropriate technical assumptions, the simple-loop theory allows to deduce various types of asymptotic expansions for the eigenvalues of Toeplitz matrices generated by a function $f$. Independently and under the milder hypothesis that…
The monotone variational inequality is a central problem in mathematical programming that unifies and generalizes many important settings such as smooth convex optimization, two-player zero-sum games, convex-concave saddle point problems,…
We develop Stein's method for $\alpha$-stable approximation with $\alpha\in(0,1]$, continuing the recent line of research by Xu \cite{lihu} and Chen, Nourdin and Xu \cite{C-N-X} in the case $\alpha\in(1,2).$ The main results include an…
We consider the computation of stable approximations to the exact solution $x^\dag$ of nonlinear ill-posed inverse problems $F(x)=y$ with nonlinear operators $F:X\to Y$ between two Hilbert spaces $X$ and $Y$ by the Newton type methods $$…
We consider Toeplitz operators defined on a concave corner-shaped subset of the square lattice. We obtain a necessary and sufficient condition for these operators to be Fredholm. We further construct a Fredholm concave corner Toeplitz…
A new approach to problems of the Uncertainty Principle in Harmonic Analysis, based on the use of Toeplitz operators, has brought progress to some of the classical problems in the area. The goal of this paper is to develop and systematize…
The partial Schur factorization can be used to represent several eigenpairs of a matrix in a numerically robust way. Different adaptions of the Arnoldi method are often used to compute partial Schur factorizations. We propose here a…
At present there exist numerous different approaches to results on Toeplitz determinants of the type of Szeg\"o's strong limit theorem. The intention of this paper is to show that Jacobi's theorem on the minors of the inverse matrix remains…
When approximating elliptic problems by using specialized approximation techniques, we obtain large structured matrices whose analysis provides information on the stability of the method. Here we provide spectral and norm estimates for…