1. Call to Order President Laura Landweber called the council meeting to order at 8:30 AM, Sunday, July 2, 2017. In attendance were President Laura Landweber, Past-President George Zhang, President-Elect Bill Martin, Councilors Emma Teeling, Kateryna Makova, Maud Tenaillon, Adam Eyre-Walker, Joanna Masel, Jay Storz, Secretary David Pollock, Treasurer Juliette de Meaux, and MBE Editor-in-Chief S...

In this paper we investigate the regularization properties of semiiterative regularization methods in Hilbert scales for linear ill-posed problems and perturbed data. It is well known that Landweber iteration can be remarkably accelerated by polynomial acceleration methods leading to the notion of optimal speed of convergence, which can be obtained by several efficient two-step methods, e.g., t...

In this paper we provide a convergence rates result for a modified version of Landweber iteration with a priori regularization parameter choice in a Banach space setting.

An algebraic deformation theory of algebras over the Landweber-Novikov algebra is obtained.

We consider a class of inverse problems defined by a nonlinear mapping from parameter or model functions to the data, where the inverse mapping is Hölder continuous with respect to appropriate Banach spaces. We analyze a nonlinear Landweber iteration and prove local convergence and convergence rates with respect to an appropriate distance measure. Opposed to the standard analysis of the nonline...

Church’s Problem (1962) asks for the construction of a procedure which, given a logical specification φ on sequence pairs, realizes for any input sequence X an output sequence Y such that (X,Y ) satisfies φ. Büchi and Landweber (1969) gave a solution for MSO specifications in terms of finite-state automata. We address the problem in a more general logical setting where not only the specificatio...

In this paper we discuss general regularization estimators. This class includes Tikhonov type and spectral cut-off estimators as well as iterative methods, such as ν-methods and the Landweber iteration. The latter estimators achieve the same (optimal) convergence rates as spectral cut-off, but do not require explicit spectral information on the operator and are often much faster to compute than...

We calculate completely the Real cobordism groups, introduced by Landweber and Fujii, in terms of homotopy groups of known spectra.