Johannes Kraus

NA
9papers
226citations
Novelty35%
AI Score21

9 Papers

NAApr 18, 2012
Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs

James Brannick, Yao Chen, Johannes Kraus et al.

This paper presents estimates of the convergence rate and complexity of an algebraic multilevel preconditioner based on piecewise constant coarse vector spaces applied to the graph Laplacian. A bound is derived on the energy norm of the projection operator onto any piecewise constant vector space, which results in an estimate of the two-level convergence rate where the coarse level graph is obtained by matching. The two-level convergence of the method is then used to establish the convergence of an Algebraic Multilevel Iteration that uses the two-level scheme recursively. On structured grids, the method is proven to have convergence rate $\approx (1-1/\log n)$ and $O(n\log n)$ complexity for each cycle, where $n$ denotes the number of unknowns in the given problem. Numerical results of the algorithm applied to various graph Laplacians are reported. It is also shown that all the theoretical estimates derived for matching can be generalized to the case of aggregates containing more than two vertices.

NAAug 30, 2018
Iterative solution and preconditioning for the tangent plane scheme in computational micromagnetics

Johannes Kraus, Carl-Martin Pfeiler, Dirk Praetorius et al.

The tangent plane scheme is a time-marching scheme for the numerical solution of the nonlinear parabolic Landau-Lifshitz-Gilbert equation (LLG), which describes the time evolution of ferromagnetic configurations. Exploiting the geometric structure of LLG, the tangent plane scheme requires only the solution of one linear variational form per time-step, which is posed in the discrete tangent space determined by the nodal values of the current magnetization. We develop an effective solution strategy for the arising constrained linear systems, which is based on appropriate Householder reflections. We derive possible preconditioners, which are (essentially) independent of the time-step, and prove that the preconditioned GMRES algorithm leads to linear convergence. Numerical experiments underpin the theoretical findings.

NAJun 9, 2018
Conservative discretizations and parameter-robust preconditioners for Biot and multiple-network flux-based poroelastic models

Qinggou Hong, Johannes Kraus, Maria Lymbery et al.

The parameters in the governing system of partial differential equations of multicompartmental poroelastic models typically vary over several orders of magnitude making its stable discretization and efficient solution a challenging task. In this paper, inspired by the approach recently presented by Hong and Kraus~[Parameter-robust stability of classical three-field formulation of Biot's consolidation model, ETNA (to appear)] for the Biot model, we prove the uniform stability, and design stable disretizations and parameter-robust preconditioners for flux-based formulations of multiple-network poroelastic systems. Novel parameter-matrix-dependent norms that provide the key for establishing uniform inf-sup stability of the continuous problem are introduced. As a result, the stability estimates presented here are uniform not only with respect to the Lamé parameter $λ$, but also with respect to all the other model parameters such as permeability coefficients $K_i$, storage coefficients $c_{p_i}$, network transfer coefficients $β_{ij}, i,j=1,\cdots,n$, the scale of the networks $n$ and the time step size $τ$. Moreover, strongly mass conservative discretizations that meet the required conditions for parameter-robust stability are suggested and corresponding optimal error estimates proved. The transfer of the canonical (norm-equivalent) operator preconditioners from the continuous to the discrete level lays the foundation for optimal and fully robust iterative solution methods. The theoretical results are confirmed in numerical experiments that are motivated by practical applications.

NAOct 30, 2011
A subspace correction method for discontinuous Galerkin discretizations of linear elasticity equations

Blanca Ayuso de Dios, Ivan Georgiev, Johannes Kraus et al.

We study preconditioning techniques for discontinuous Galerkin discretizations of isotropic linear elasticity problems in primal (displacement) formulation. We propose subspace correction methods based on a splitting of the vector valued piecewise linear discontinuous finite element space, that are optimal with respect to the mesh size and the Lame parameters. The pure displacement, the mixed and the traction free problems are discussed in detail. We present a convergence analysis of the proposed preconditioners and include numerical examples that validate the theory and assess the performance of the preconditioners.

NAJan 13, 2016
Preconditioning of weighted H(div)-norm and applications to numerical simulation of highly heterogeneous media

Johannes Kraus, Raytcho Lazarov, Maria Lymbery et al.

In this paper we propose and analyze a preconditioner for a system arising from a finite element approximation of second order elliptic problems describing processes in highly het- erogeneous media. Our approach uses the technique of multilevel methods and the recently proposed preconditioner based on additive Schur complement approximation by J. Kraus (see [8]). The main results are the design and a theoretical and numerical justification of an iterative method for such problems that is robust with respect to the contrast of the media, defined as the ratio between the maximum and minimum values of the coefficient (related to the permeability/conductivity).

NAMar 15, 2018
Reliable numerical solution of a class of nonlinear elliptic problems generated by the Poisson-Boltzmann equation

Johannes Kraus, Svetoslav Nakov, Sergey Repin

We consider a class of nonlinear elliptic problems associated with models in biophysics, which are described by the Poisson-Boltzmann equation (PBE). We prove mathematical correctness of the problem, study a suitable class of approximations, and deduce guaranteed and fully computable bounds of approximation errors. The latter goal is achieved by means of the approach suggested in [S. Repin, A posteriori error estimation for variational problems with uniformly convex functionals. Math. Comp., 69:481-500, 2000] for convex variational problems. Moreover, we establish the error identity, which defines the error measure natural for the considered class of problems and show that it yields computable majorants and minorants of the global error as well as indicators of local errors that provide efficient adaptation of meshes. Theoretical results are confirmed by a collection of numerical tests that includes problems on $2D$ and $3D$ Lipschitz domains.

NAMar 29, 2019
Parameter-robust convergence analysis of fixed-stress split iterative method for multiple-permeability poroelasticity systems

Qingguo Hong, Johannes Kraus, Maria Lymbery et al.

We consider flux-based multiple-porosity/multiple-permeability poroelasticity systems describing multiple-network flow and deformation in a poro-elastic medium, sometimes also referred to as MPET models. The focus of the paper is on the convergence analysis of the fixed-stress split iteration, a commonly used coupling technique for the flow and mechanics equations in poromechanics. We formulate the fixed-stress split method in the present context and prove its linear convergence. The contraction rate of this fixed-point iteration does not depend on any of the physical parameters appearing in the model. The theory is confirmed by numerical results which further demonstrate the advantage of the fixed-stress split scheme over a fully implicit method relying on norm-equivalent preconditioning.

NAJun 13, 2017
Parameter-robust stability of classical three-field formulation of Biot's consolidation model

Qingguo Hong, Johannes Kraus

This paper is devoted to the stability analysis of a classical three-field formulation of Biot's consolidation model where the unknown variables are the displacements, fluid flux (Darcy velocity), and pore pressure. Specific parameter-dependent norms provide the key in establishing the full parameter-robust inf-sup stability of the continuous problem. Therefore, stability results presented here are uniform not only with respect to the Lamé parameter $λ$, but also with respect to all the other model parameters. This allows for the construction of a uniform block diagonal preconditioner within the framework of operator preconditioning. Stable discretizations that meet the required conditions for full robustness and guarantee mass conservation, both locally and globally, are discussed and corresponding optimal error estimates proven.