Marko Lindner

Timo Betcke, Simon N. Chandler-Wilde, Ivan G. Graham et al.

We consider the classical coupled, combined-field integral equation formulations for time-harmonic acoustic scattering by a sound soft bounded obstacle. In recent work, we have proved lower and upper bounds on the $L^2$ condition numbers for these formulations, and also on the norms of the classical acoustic single- and double-layer potential operators. These bounds to some extent make explicit the dependence of condition numbers on the wave number $k$, the geometry of the scatterer, and the coupling parameter. For example, with the usual choice of coupling parameter they show that, while the condition number grows like $k^{1/3}$ as $k\to\infty$, when the scatterer is a circle or sphere, it can grow as fast as $k^{7/5}$ for a class of `trapping' obstacles. In this paper we prove further bounds, sharpening and extending our previous results. In particular we show that there exist trapping obstacles for which the condition numbers grow as fast as $\exp(γk)$, for some $γ>0$, as $k\to\infty$ through some sequence. This result depends on exponential localisation bounds on Laplace eigenfunctions in an ellipse that we prove in the appendix. We also clarify the correct choice of coupling parameter in 2D for low $k$. In the second part of the paper we focus on the boundary element discretisation of these operators. We discuss the extent to which the bounds on the continuous operators are also satisfied by their discrete counterparts and, via numerical experiments, we provide supporting evidence for some of the theoretical results, both quantitative and asymptotic, indicating further which of the upper and lower bounds may be sharper.

Simon N. Chandler-Wilde, Ratchanikorn Chonchaiya, Marko Lindner

In this paper we develop and apply methods for the spectral analysis of non-self-adjoint tridiagonal infinite and finite random matrices, and for the spectral analysis of analogous deterministic matrices which are pseudo-ergodic in the sense of E.B.Davies (Commun. Math. Phys. 216 (2001), 687-704). As a major application to illustrate our methods we focus on the "hopping sign model" introduced by J.Feinberg and A.Zee (Phys. Rev. E 59 (1999), 6433-6443), in which the main objects of study are random tridiagonal matrices which have zeros on the main diagonal and random $\pm 1$'s as the other entries. We explore the relationship between spectral sets in the finite and infinite matrix cases, and between the semi-infinite and bi-infinite matrix cases, for example showing that the numerical range and $p$-norm $\eps$-pseudospectra ($\eps>0$, $p\in [1,\infty]$) of the random finite matrices converge almost surely to their infinite matrix counterparts, and that the finite matrix spectra are contained in the infinite matrix spectrum $Σ$. We also propose a sequence of inclusion sets for $Σ$ which we show is convergent to $Σ$, with the $n$th element of the sequence computable by calculating smallest singular values of (large numbers of) $n\times n$ matrices. We propose similar convergent approximations for the 2-norm $\eps$-pseudospectra of the infinite random matrices, these approximations sandwiching the infinite matrix pseudospectra from above and below.

Marko Lindner, Gilbert Strang

By counting 1's in the "right half" of $2w$ consecutive rows, we locate the main diagonal of any doubly infinite permutation matrix with bandwidth $w$. Then the matrix can be correctly centered and factored into block-diagonal permutation matrices. Part II of the paper discusses the same questions for the much larger class of band-dominated matrices. The main diagonal is determined by the Fredholm index of a singly infinite submatrix. Thus the main diagonal is determined "at infinity" in general, but from only $2w$ rows for banded permutations.

Marko Lindner, Steffen Roch

This article is about a problem in the numerical analysis of random operators. We study a version of the finite section method for the approximate solution of equations $Ax=b$ in infinitely many variables, where $A$ is a random Jacobi operator. In other words, we approximately solve infinite second order difference equations with stochastic coefficients by reducing the infinite volume case to the (large) finite volume case via a particular truncation technique. For most of the paper we consider non-selfadjoint operators $A$ but we also comment on the self-adjoint case when simplifications occur.

Marko Lindner, Steffen Roch

In this article we compare the set of integer points in the homothetic copy $nΠ$ of a lattice polytope $Π\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in Π\cap\Z^d$ and $n\in\N$. We give conditions on the polytope $Π$ under which these two sets coincide and we discuss two notions of boundary for subsets of $\Z^d$ or, more generally, subsets of a finitely generated discrete group.

Marko Lindner, Torge Schmidt

We study spectra and pseudospectra of certain bounded linear operators on $\ell^2({\mathbb Z})$. The operators are generally non-normal, and their matrix representation has a characteristic off-diagonal decay. Based on a result of Chandler-Wilde, Chonchaiya and Lindner for tridiagonal infinite matrices, we demonstrate an efficient algorithm for the computation of upper and lower bounds on the pseudospectrum of operators that are merely norm limits of band matrices -- the so-called band-dominated operators. After approximation by a band matrix and fixing a parameter $n\in{\mathbb N}$, one looks at $n$ consecutive columns $\{k+1,...,k+n\}$, $k\in{\mathbb Z}$, of the corresponding matrix and computes the smallest singular value of that section via QR factorization. We here propose a QR factorization by a sequence of Givens rotations in such a way that a large part of the computation can be reused for the factorization of the next submatrix -- when $k$ is replaced by $k+1$. The computational cost for the next factorization(s) is ${\mathcal O}(nd)$ as opposed to a naive implementation with ${\mathcal O}(nd^2)$, where $d$ is the bandwidth. So our algorithm pays off for large bands, which is attractive when approximating band-dominated operators with a full (i.e. not banded) matrix.

Marko Lindner, Hagen Söding

We study finite but growing principal square submatrices $A_n$ of the one- or two-sided infinite Fibonacci Hamiltonian $A$. Our results show that such a sequence $(A_n)$, no matter how the points of truncation are chosen, is always stable -- implying that $A_n$ is invertible for sufficiently large $n$ and $A_n^{-1}\to A^{-1}$ pointwise.

Marko Lindner

In this article we demonstrate and compare two modified versions of the classical finite section method for band-dominated operators in case the latter is not stable. For both methods we give explicit criteria for their applicability.

Simon N. Chandler-Wilde, Marko Lindner

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 stochastic Toeplitz matrices $A_+$ in the semi-infinite case and stochastic Laurent matrices $A$ in the bi-infinite case. Their spectra, $Σ=$ spec $A$ and $Σ_+=$ spec $A_+$, are independent of $A$ and $A_+$ as long as $A$ and $A_+$ are pseudoergodic (in the sense of E.B. Davies, Commun. Math. Phys., 2001), which holds almost surely in the random case. This was shown in Davies (2001) for $A$; that the same holds for $A_+$ is one main result of this paper. We give upper and lower bounds on $Σ$ and $Σ_+$, and we explicitly compute a set $G$ that fills the gap between the two in the sense that $Σ\cup G=Σ_+$. We show that invertibility of one operator $A_+$ implies invertibility - and uniform boundedness of the inverses - of all finite square matrices with three diagonals in $U, V$ and $W$. This implies that the so-called finite section method for the approximate solution of a system $A_+x=b$ is applicable as soon as $A_+$ is invertible, and that the same method for estimating the spectrum of $A_+$ does not suffer from spectral pollution. Both results illustrate that tridiagonal stochastic Toeplitz operators share important properties of (classical) Toeplitz operators. One of our main tools is a new version of the Coburn lemma for classical Toeplitz operators, saying that a stochastic tridiagonal Toeplitz operator, if Fredholm, is always injective or surjective. In the final part we bound and compare the norms, and the norms of inverses, of bi-infinite, semi-infinite and finite tridiagonal matrices over $U$, $V$ and $W$. This allows the study of the resolvent norms, and hence the pseudospectra, of these operators and matrices.