Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
In this paper we consider a finite element discretization of the Oldroyd-B model of viscoelastic flows. The method uses standard continuous polynomial finite element spaces for vel...
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
We propose a new numerical scheme for linear transport equations. It is based on a decomposition of the distribution function into equilibrium and non-equilibrium parts. We also us...
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...