Karlheinz Gröchenig

Peter Berger, Karlheinz Gröchenig, Gerald Matz

We study reconstruction operators on a Hilbert space that are exact on a given reconstruction subspace. Among those the reconstruction operator obtained by the least squares fit has the smallest operator norm, and therefore is most stable with respect to noisy measurements. We then construct the operator with the smallest possible quasi-optimality constant, which is the most stable with respect to a systematic error appearing before the sampling process (model uncertainty). We describe how to vary continuously between the two reconstruction methods, so that we can trade stability for quasi-optimality. As an application we study the reconstruction of a compactly supported function from nonuniform samples of its Fourier transform.

Tobias Kloos, Joachim Stöckler, Karlheinz Gröchenig

The usefulness of Gabor frames depends on the easy computability of a suitable dual window. This question is addressed under several aspects: several versions of Schulz's iterative algorithm for the approximation of the canonical dual window are analyzed for their numerical stability. For Gabor frames with totally positive windows or with exponential B-splines a direct algorithm yields a family of exact dual windows with compact support. It is shown that these dual windows converge exponentially fast to the canonical dual window.

Karlheinz Gröchenig, Andreas Klotz

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 derivation or a commutative automorphism group on A and yields a family of smooth inverse-closed subalgebras of A that resemble the usual Holder-Zygmund spaces. The second construction starts with a graded sequence of subspaces of A and yields a class of inverse-closed subalgebras that resemble the classical approximation spaces. We prove a theorem of Jackson-Bernstein type to show that in certain cases both constructions are equivalent. These results about abstract Banach algebras are applied to algebras of infinite matrices with off-diagonal decay. In particular, we obtain new and unexpected conditions of off-diagonal decay that are preserved under matrix inversion.

Karlheinz Gröchenig, Ziemowit Rzeszotnik, Thomas Strohmer

The finite section method is a classical scheme to approximate the solution of an infinite system of linear equations. We present quantitative estimates for the rate of the convergence of the finite section method on weighted $\ell ^p$-spaces. Our approach uses recent results from the theory of Banach algebras of matrices with off-diagonal decay. Furthermore, we demonstrate that Banach algebra theory provides a natural framework for deriving a finite section method that is applicable to large classes of non-hermitian matrices. An example from digital communication illustrates the practical usefulness of the proposed theoretical framework.