SearcharxivSearch

arXiv subjects

Dirk Praetorius

Publications and source records attributed to Dirk Praetorius.

At least 55 records · Page 3Linked to original sources

Magnetostatics and micromagnetics with physics informed neural networks

Partial differential equations and variational problems can be solved with physics informed neural networks (PINNs). The unknown field is approximated with neural networks. Minimizing the residuals of the static Maxwell equation at collocation points or the magnetostatic energy, the weights of the neural network are adjusted so that the neural network solution approximates the magnetic vector potential. This way, the magnetic flux density for a given magnetization distribution can be estimated. With the magnetization as an additional unknown, inverse magnetostatic problems can be solved. Augmenting the magnetostatic energy with additional energy terms, micromagnetic problems can be solved. We demonstrate the use of physics informed neural networks for solving magnetostatic problems, computing the magnetization for inverse problems, and calculating the demagnetization curves for two-dimensional geometries.

cond-mat.mtrl-sci

Two-level a posteriori error estimation for adaptive multilevel stochastic Galerkin FEM

The paper considers a class of parametric elliptic partial differential equations (PDEs), where the coefficients and the right-hand side function depend on infinitely many (uncertain) parameters. We introduce a two-level a posteriori estimator to control the energy error in multilevel stochastic Galerkin approximations for this class of PDE problems. We prove that the two-level estimator always provides a lower bound for the unknown approximation error, while the upper bound is equivalent to a saturation assumption. We propose and empirically compare three adaptive algorithms, where the structure of the estimator is exploited to perform spatial refinement as well as parametric enrichment. The paper also discusses implementation aspects of computing multilevel stochastic Galerkin approximations.

math.NA

Energy contraction and optimal convergence of adaptive iterative linearized finite element methods

We revisit a unified methodology for the iterative solution of nonlinear equations in Hilbert spaces. Our key observation is that the general approach from [Heid & Wihler, Math. Comp. 89 (2020), Calcolo 57 (2020)] satisfies an energy contraction property in the context of (abstract) strongly monotone problems. This property, in turn, is the crucial ingredient in the recent convergence analysis in [Gantner et al., arXiv:2003.10785]. In particular, we deduce that adaptive iterative linearized finite element methods (AILFEMs) lead to full linear convergence with optimal algebraic rates with respect to the degrees of freedom as well as the total computational time.

math.NA

Micromagnetics of thin films in the presence of Dzyaloshinskii-Moriya interaction

In this paper, we study the thin-film limit of the micromagnetic energy functional in the presence of bulk Dzyaloshinskii-Moriya interaction (DMI). Our analysis includes both a stationary $Γ$-convergence result for the micromagnetic energy, as well as the identification of the asymptotic behavior of the associated Landau-Lifshitz-Gilbert equation. In particular, we prove that, in the limiting model, part of the DMI term behaves like the projection of the magnetic moment onto the normal to the film, contributing this way to an increase in the shape anisotropy arising from the magnetostatic self-energy. Finally, we discuss a convergent finite element approach for the approximation of the time-dependent case and use it to numerically compare the original three-dimensional model with the two-dimensional thin-film limit.

math.AP

Functional a posteriori error estimates for boundary element methods

Functional error estimates are well-established tools for a posteriori error estimation and related adaptive mesh-refinement for the finite element method (FEM). The present work proposes a first functional error estimate for the boundary element method (BEM). One key feature is that the derived error estimates are independent of the BEM discretization and provide guaranteed lower and upper bounds for the unknown error. In particular, our analysis covers Galerkin BEM and the collocation method, what makes the approach of particular interest for scientific computations and engineering applications. Numerical experiments for the Laplace problem confirm the theoretical results.

math.NA

Optimal convergence rates for goal-oriented FEM with quadratic goal functional

We consider a linear elliptic PDE and a quadratic goal functional. The goal-oriented adaptive FEM algorithm (GOAFEM) solves the primal as well as a dual problem, where the goal functional is always linearized around the discrete primal solution at hand. We show that the marking strategy proposed in [Feischl et al, SIAM J. Numer. Anal., 54 (2016)] for a linear goal functional is also optimal for quadratic goal functionals, i.e., GOAFEM leads to linear convergence with optimal convergence rates.

math.NA

Spin-diffusion model for micromagnetics in the limit of long times

In this paper, we consider spin-diffusion Landau-Lifshitz-Gilbert equations (SDLLG), which consist of the time-dependent Landau-Lifshitz-Gilbert (LLG) equation coupled with a time-dependent diffusion equation for the electron spin accumulation. The model takes into account the diffusion process of the spin accumulation in the magnetization dynamics of ferromagnetic multilayers. We prove that in the limit of long times, the system reduces to simpler equations in which the LLG equation is coupled to a nonlinear and nonlocal steady-state equation, referred to as SLLG. As a by-product, the existence of global weak solutions to the SLLG equation is obtained. Moreover, we prove weak-strong uniqueness of solutions of SLLG, i.e., all weak solutions coincide with the (unique) strong solution as long as the latter exists in time. The results provide a solid mathematical ground to the qualitative behavior originally predicted by Zhang, Levy, and Fert in [Physical Review Letters 88 (2002)] in ferromagnetic multilayers.

math.AP

Plain convergence of adaptive algorithms without exploiting reliability and efficiency

We consider h-adaptive algorithms in the context of the finite element method (FEM) and the boundary element method (BEM). Under quite general assumptions on the building blocks SOLVE, ESTIMATE, MARK, and REFINE of such algorithms, we prove plain convergence in the sense that the adaptive algorithm drives the underlying a posteriori error estimator to zero. Unlike available results in the literature, our analysis avoids the use of any reliability and efficiency estimate, but only relies on structural properties of the estimator, namely stability on non-refined elements and reduction on refined elements. In particular, the new framework thus covers also problems involving non-local operators like the fractional Laplacian or boundary integral equations, where (discrete) efficiency is (currently) not available.

math.NA

A short note on plain convergence of adaptive least-squares finite element methods

We show that adaptive least-squares finite element methods driven by the canonical least-squares functional converge under weak conditions on PDE operator, mesh-refinement, and marking strategy. Contrary to prior works, our plain convergence does neither rely on sufficiently fine initial meshes nor on severe restrictions on marking parameters. Finally, we prove that convergence is still valid if a contractive iterative solver is used to obtain the approximate solutions (e.g., the preconditioned conjugate gradient method with optimal preconditioner). The results apply within a fairly abstract framework which covers a variety of model problems.

math.NA

Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver

We consider a second-order elliptic boundary value problem with strongly monotone and Lipschitz-continuous nonlinearity. We design and study its adaptive numerical approximation interconnecting a finite element discretization, the Banach-Picard linearization, and a contractive linear algebraic solver. We in particular identify stopping criteria for the algebraic solver that on the one hand do not request an overly tight tolerance but on the other hand are sufficient for the inexact (perturbed) Banach-Picard linearization to remain contractive. Similarly, we identify suitable stopping criteria for the Banach-Picard iteration that leave an amount of linearization error that is not harmful for the residual a-posteriori error estimate to steer reliably the adaptive mesh-refinement. For the resulting algorithm, we prove a contraction of the (doubly) inexact iterates after some amount of steps of mesh-refinement / linerization / algebraic solver, leading to its linear convergence. Moreover, for usual mesh-refinement rules, we also prove that the overall error decays at the optimal rate with respect to the number of elements (degrees of freedom) added with respect to the initial mesh. Finally, we prove that our fully adaptive algorithm drives the overall error down with the same optimal rate also with respect to the overall algorithmic cost expressed as the cumulated sum of the number of mesh elements over all mesh-refinement, linearization, and algebraic solver steps. Numerical experiments support these theoretical findings and illustrate the optimal overall algorithmic cost of the fully adaptive algorithm on several test cases.

math.NA

Adaptive BEM for elliptic PDE systems, Part I: Abstract framework for weakly-singular integral equations

In the present work, we consider weakly-singular integral equations arising from linear second-order strongly-elliptic PDE systems with constant coefficients, including, e.g., linear elasticity. We introduce a general framework for optimal convergence of adaptive Galerkin BEM. We identify certain abstract properties for the underlying meshes, the corresponding mesh-refinement strategy, and the ansatz spaces that guarantee convergence at optimal algebraic rate of an adaptive algorithm driven by the weighted-residual error. These properties are satisfied, e.g., for discontinuous piecewise polynomials on simplicial meshes as well as certain ansatz spaces used for isogeometric analysis. Technical contributions include local inverse estimates for the (non-local) boundary integral operators associated to the PDE system.

math.NA

Rate optimality of adaptive finite element methods with respect to the overall computational costs

We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the adaptive mesh-refinement as well as the inexact solution of the arising discrete systems. We prove that the proposed strategy leads to linear convergence with optimal algebraic rates. Unlike prior works, however, we focus on convergence rates with respect to the overall computational costs. In explicit terms, the proposed adaptive strategy thus guarantees quasi-optimal computational time. In particular, our analysis covers linear problems, where the linear systems are solved by an optimally preconditioned CG method as well as nonlinear problems with strongly monotone nonlinearity which are linearized by the so-called Zarantonello iteration.

math.NA

Adaptive IGAFEM with optimal convergence rates: T-splines

We consider an adaptive algorithm for finite element methods for the isogeometric analysis (IGAFEM) of elliptic (possibly non-symmetric) second-order partial differential equations. We employ analysis-suitable T-splines of arbitrary odd degree on T-meshes generated by the refinement strategy of [Morgenstern, Peterseim, Comput. Aided Geom. Design 34 (2015)] in 2D and [Morgenstern, SIAM J. Numer. Anal. 54 (2016)] in 3D. Adaptivity is driven by some weighted residual a posteriori error estimator. We prove linear convergence of the error estimator (which is equivalent to the sum of energy error plus data oscillations) with optimal algebraic rates with respect to the number of elements of the underlying mesh.

math.NA

Weak-strong uniqueness for the Landau-Lifshitz-Gilbert equation in micromagnetics

We consider the time-dependent Landau-Lifshitz-Gilbert equation. We prove that each weak solution coincides with the (unique) strong solution, as long as the latter exists in time. Unlike available results in the literature, our analysis also includes the physically relevant lower-order terms like Zeeman contribution, anisotropy, stray field, and the Dzyaloshinskii-Moriya interaction (which accounts for the emergence of magnetic Skyrmions). Moreover, our proof gives a template on how to approach weak-strong uniqueness for even more complicated problems, where LLG is (nonlinearly) coupled to other (nonlinear) PDE systems.

math.AP

Dörfler marking with minimal cardinality is a linear complexity problem

Most adaptive finite element strategies employ the Dörfler marking strategy to single out certain elements $\mathcal{M} \subseteq \mathcal{T}$ of a triangulation $\mathcal{T}$ for refinement. In the literature, different algorithms have been proposed to construct $\mathcal{M}$, where usually two goals compete: On the one hand, $\mathcal{M}$ should contain a minimal number of elements. On the other hand, one aims for linear costs with respect to the cardinality of $\mathcal{T}$. Unlike expected in the literature, we formulate and analyze an algorithm, which constructs a minimal set $\mathcal{M}$ at linear costs. Throughout, pseudocodes are given.

math.NA

Instance-optimal goal-oriented adaptivity

We consider an adaptive finite element method with arbitrary but fixed polynomial degree $p \ge 1$, where adaptivity is driven by an edge-based residual error estimator. Based on the modified maximum criterion from [Diening et al, Found. Comput. Math. 16, 2016], we propose a goal-oriented adaptive algorithm and prove that it is instance optimal. More precisely, the goal-error is bounded by the product of the total errors (being the sum of energy error plus data oscillations) of the primal and the dual problem, and the proposed algorithm is instance optimal with respect to this upper bound. Numerical experiments underline our theoretical findings.

math.NA

The saturation assumption yields optimal convergence of two-level adaptive BEM

We consider the convergence of adaptive BEM for weakly-singular and hypersingular integral equations associated with the Laplacian and the Helmholtz operator in 2D and 3D. The local mesh-refinement is driven by some two-level error estimator. We show that the adaptive algorithm drives the underlying error estimates to zero. Moreover, we prove that the saturation assumption already implies linear convergence of the error with optimal algebraic rates.

math.NA

Adaptive boundary element methods for the computation of the electrostatic capacity on complex polyhedra

The accurate computation of the electrostatic capacity of three dimensional objects is a fascinating benchmark problem with a long and rich history. In particular, the capacity of the unit cube has widely been studied, and recent advances allow to compute its capacity to more than ten digits of accuracy. However, the accurate computation of the capacity for general three dimensional polyhedra is still an open problem. In this paper, we propose a new algorithm based on a combination of ZZ-type a posteriori error estimation and effective operator preconditioned boundary integral formulations to easily compute the capacity of complex three dimensional polyhedra to 5 digits and more. While this paper focuses on the capacity as a benchmark problem, it also discusses implementational issues of adaptive boundary element solvers, and we provide codes based on the boundary element package Bempp to make the underlying techniques accessible to a wide range of practical problems.

math.NA