An adaptive Newton-method based on a dynamical systems approach

The traditional Newton method for solving nonlinear operator equations in Banach spaces is discussed within the context of the continuous Newton method. This setting makes it possible to interpret the Newton method as a discrete dynamical system and thereby to cast it in the framework of an adaptive step size control procedure. In so doing, our goal is to reduce the chaotic behavior of the original method without losing its quadratic convergence property close to the roots. The performance of the modified scheme is illustrated with various examples from algebraic and differential equations.

Loop formulation of the supersymmetric nonlinear O(N) sigma model

We derive the fermion loop formulation for the supersymmetric nonlinear O(N) sigma model by performing a hopping expansion using Wilson fermions. In this formulation the fermionic contribution to the partition function becomes a sum over all possible closed non-oriented fermion loop configurations. The interaction between the bosonic and fermionic degrees of freedom is encoded in the constraints arising from the supersymmetry and induces flavour changing fermion loops. For N ≥ 3 this leads to fermion loops which are no longer self-avoiding and hence to a potential sign problem. Since we use Wilson fermions the bare mass needs to be tuned to the chiral point. For N = 2 we determine the critical point and present boson and fermion masses in the critical regime.

Computational Comparison of Continuous and Discontinuous Galerkin Time-Stepping Methods for Nonlinear Initial Value Problems

This article centers on the computational performance of the continuous and discontinuous Galerkin time stepping schemes for general first-order initial value problems in R n , with continuous nonlinearities. We briefly review a recent existence result for discrete solutions from [6], and provide a numerical comparison of the two time discretization methods.