Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm

In contrast to linear schemes, nonlinear approximation techniques allow for dimension independent rates of convergence. Unfortunately, typical algorithms (such as, e.g., backpropagation) are not only computationally demanding, but also unstable in the presence of data noise. While we can show stability for a weak relaxed greedy algorithm, the resulting method has the drawback that it requires in practise unavailable smoothness information about the data.In this work we propose an adaptive greedy algorithm which does not need this information but rather recovers it iteratively from the available data. We show that the generated approximations are always at least as smooth as the original function and that the algorithm also remains stable, when it is applied to noisy data. Finally, the applicability of this algorithm is demonstrated by numerical experiments.     

The Method of Fundamental Solutions for Stokes flows with a free surface

We investigate the use of the Method of Fundamental Solutions (MFS) for solving Stokes flow problems with a free surface. We apply the method to the creeping planar Newtonian extrudate-swell problem and study the effect of the surface tension on the free surface. The results are in good agreement with existing finite element and boundary element solutions. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 667–678, 1998     

Phase transition thresholds for some Friedman-style independence results

We classify the phase transition thresholds from provability to unprovability for certain Friedman-style miniaturizations of Kruskal's Theorem and Higman's Lemma. In addition we prove a new and unexpected phase transition result for ε₀. Motivated by renormalization and universality issues from statistical physics we finally state a universality hypothesis. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)