Related papers: On the eigenvalues of Toeplitz matrices with two o…
This paper studies two structured approximation problems: (1) Recovering a corrupted low-rank Toeplitz matrix and (2) recovering the range of a Fourier matrix from a single observation. Both problems are computationally challenging because…
In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…
Superregular matrices have the property that all of their submatrices, which can be full rank are so. Lower triangular superregular matrices are useful for e.g., maximum distance separable convolutional codes as well as for (sequential)…
Let $T_{f}$ denote the Toeplitz operator on the Hardy space $H^{2}(\mathbb{T})$ and let $T_{n}(f)$ be the corresponding $n \times n$ Toeplitz matrix. In this paper, we characterize the compactness of the operators…
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 article, we determine the spectrum of real-analytic, non self-adjoint Toeplitz operators on compact K{\"a}hler manifolds and on the complex plane, on neighbourhoods of critical values of the symbol. We consider specifically critical…
Gradient descent optimizations and backpropagation are the most common methods for training neural networks, but they are computationally expensive for real time applications, need high memory resources, and are difficult to converge for…
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…
We study the problem of approximating the eigenspectrum of a symmetric matrix $\mathbf A \in \mathbb{R}^{n \times n}$ with bounded entries (i.e., $\|\mathbf A\|_{\infty} \leq 1$). We present a simple sublinear time algorithm that…
We study the spectra and pseudospectra of finite and infinite tridiagonal random matrices, in the case where each of the diagonals varies over a separate compact set, say $U,V,W\subset\mathbb{C}$. Such matrices are sometimes termed…
Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large…
The computation of eigenvalues of large-scale matrices arising from finite element discretizations has gained significant interest in the last decade. Here we present a new algorithm based on slicing the spectrum that takes advantage of the…
For a given nonnegative integer alpha, a matrix A_{n} of size n is called alpha-Toeplitz if its entries obey the rule A_{n}=[a_{r-alpha*s}]_{r,s=0}^{n-1}. Analogously, a matrix A_{n} again of size n is called alpha-circulant if A_{n}=…
We consider an $N \times N$ random symmetric Toeplitz matrix with an i.i.d. input sequence drawn from a distribution that lies in the domain of attraction of an $\alpha$-stable law for $0 < \alpha < 2$. We show that under an appropriate…
In this work, we consider symmetric random Toeplitz matrices $T_n$ generated by i.i.d. zero mean random variables ${X_k}$ satisfying the moment conditions: $E|X_k|^2=1$ and $\E|X_1|^n \le n^{\sqrt{n}}$ for all $n\ge 3$. We prove that the…
The sensitivity of eigenvalues of structured matrices under general or structured perturbations of the matrix entries has been thoroughly studied in the literature. Error bounds are available and the pseudospectrum can be computed to gain…
For $b>0$ and $n\geqslant 1$, we consider the $n\times n$ tridiagonal matrix $V_n(b)$ with diagonal entries $b+1$, superdiagonal entries $1$, and subdiagonal entries $b$. A diagonal similarity reduces $V_n(b)$ to a symmetric tridiagonal…
The first part of this paper is devoted to the study of the orthogonal polynomial on the circle, with respect of a weight of type $f_\alpha (\theta) = (2\cos \theta- 2\cos \theta_0)^{2\alpha} c_1$ with $\theta_0 \in ]0,\pi[$, -1/2…
Evaluation of the eigenvectors of symmetric tridiagonal matrices is one of the most basic tasks in numerical linear algebra. It is a widely known fact that, in the case of well separated eigenvalues, the eigenvectors can be evaluated with…
In this paper we express the eigenvalues of a sort of real heptadiagonal symmetric matrices as the zeros of explicit rational functions establishing upper and lower bounds for each of them. From these prescribed eigenvalues we compute also…