arXiv subjects

Dirk Praetorius

Publications and source records attributed to Dirk Praetorius.

At least 91 records · Page 5Linked to original sources

arXiv2017

A linear Uzawa-type solver for nonlinear transmission problems

We propose an Uzawa-type iteration for the Johnson-Nédélec formulation of a Laplace-type transmission problem with possible (strongly monotone) nonlinearity in the interior domain. In each step, we sequentially solve one BEM for the weakly-singular integral equation associated with the Laplace-operator and one FEM for the linear Yukawa equation. In particular, the nonlinearity is only evaluated to build the right-hand side of the Yukawa equation. We prove that the proposed method leads to linear convergence with respect to the number of Uzawa iterations. Moreover, while the current analysis of a direct FEM-BEM discretization of the Johnson-Nédélec formulation requires some restrictions on the ellipticity (resp. strong monotonicity constant) in the interior domain, our Uzawa-type solver avoids such assumptions.

math.NA↗

arXiv2016

A self-consistent spin-diffusion model for micromagnetics

We propose a three-dimensional micromagnetic model that dynamically solves the Landau-Lifshitz-Gilbert equation coupled to the full spin-diffusion equation. In contrast to previous methods, we solve for the magnetization dynamics and the electric potential in a self-consistent fashion. This treatment allows for an accurate description of magnetization dependent resistance changes. Moreover, the presented algorithm describes both spin accumulation due to smooth magnetization transitions and due to material interfaces as in multilayer structures. The model and its finite-element implementation are validated by current driven motion of a magnetic vortex structure. In a second experiment, the resistivity of a magnetic multilayer structure in dependence of the tilting angle of the magnetization in the different layers is investigated. Both examples show good agreement with reference simulations and experiments respectively.

physics.comp-ph↗

arXiv2016

Influence of grain size and exchange interaction on the LLB modeling procedure

Reliably predicting bit-error rates in realistic heat-assisted magnetic recording simulations is a challenging task. Integrating the Landau-Lifshitz-Bloch (LLB) equation can reduce the computational effort to determine the magnetization dynamics in the vicinity of the Curie temperature. If one aims that these dynamics coincide with trajectories calculated from the atomistic Landau-Lifshitz-Gilbert equation, one has to carefully model required temperature dependent material functions such as the zero-field equilibrium magnetization as well as the parallel and normal susceptibilities. We present an extensive study on how these functions depend on grain size and exchange interactions. We show that, if the size or the exchange constant of a reference grain is modified, the material functions can be scaled, according to the changed Curie temperature, yielding negligible errors. This is shown to be valid for volume changes of up to $\pm 40$ % and variations of the exchange constant of up to $\pm10$ %. Besides the temperature dependent material curves, computed switching probabilities also agree well with probabilities separately determined for each system. Our study suggest that there is no need to recalculate the required LLB input functions for each particle. Within the presented limits it is sufficient to scale them to the Curie temperature of the altered system.

cond-mat.mtrl-sci↗

arXiv2016

Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems

We prove that for compactly perturbed elliptic problems, where the corresponding bilinear form satisfies a Garding inequality, adaptive mesh-refinement is capable of overcoming the preasymptotic behavior and eventually leads to convergence with optimal algebraic rates. As an important consequence of our analysis, one does not have to deal with the a-priori assumption that the underlying meshes are sufficiently fine. Hence, the overall conclusion of our results is that adaptivity has stabilizing effects and can overcome possibly pessimistic restrictions on the meshes. In particular, our analysis covers adaptive mesh-refinement for the finite element discretization of the Helmholtz equation from where our interest originated.

math.NA↗

arXiv2016

Basic noise mechanisms of heat-assisted-magnetic recording

Heat-assisted magnetic recording (HAMR) is expected to be a key technology to significantly increase the areal storage density of magnetic recording devices. At high temperatures thermally induced noise becomes a major problem, which must be overcome in order to reliably write magnetic bits with narrow transitions. We propose an elementary model based on the effective recording time window (ERTW) to compute the switching probability of bits during HARM of bit-patterned media. With few assumptions this analytical model allows to gain deeper insights into the basic noise mechanisms like AC and DC noise. Finally, we discuss strategies to reduce noise and to increase the areal storage density of both bit-patterned as well as granular media.

cond-mat.mtrl-sci↗

arXiv2016

Adaptive vertex-centered finite volume methods with convergence rates

We consider the vertex-centered finite volume method with first-order conforming ansatz functions. The adaptive mesh-refinement is driven by the local contributions of the weighted-residual error estimator. We prove that the adaptive algorithm leads to linear convergence with generically optimal algebraic rates for the error estimator and the sum of energy error plus data oscillations. While similar results have been derived for finite element methods and boundary element methods, the present work appears to be the first for adaptive finite volume methods, where the lack of the classical Galerkin orthogonality leads to new challenges.

math.NA↗

arXiv2015

Areal density optimizations for heat-assisted-magnetic recording of high density bit-patterned media

Heat-assisted-magnetic recording (HAMR) is hoped to be the future recording technique for high density storage devices. Nevertheless, there exist several realizations strategies. With a coarse-grained Landau-Lifshitz-Bloch (LLB) model we investigate in detail benefits and disadvantages of continuous and pulsed laser spot recording of shingled and conventional bit-patterned media. Additionally we compare single phase grains and bits having a bilayer structure with graded Curie temperature, consisting of a hard magnetic layer with high $T_{\mathrm{C}}$ and a soft magnetic one with low $T_{\mathrm{C}}$, respectively. To describe the whole write process as realistic as possible a distribution of the grain sizes and Curie temperatures, a displacement jitter of the head and the bit positions are considered. For all these cases we calculate bit error rates of various grain patterns, temperatures and write head positions to optimize the achievable areal storage density. Within our analysis shingled HAMR with a continuous laser pulse moving over the medium reaches the best results, and thus having the highest potential to become the next generation storage device.

cond-mat.mtrl-sci↗

arXiv2015

Optimal convergence for adaptive IGA boundary element methods for weakly-singular integral equations

In a recent work, we analyzed a weighted-residual error estimator for isogeometric boundary element methods in 2D and proposed an adaptive algorithm which steers the local mesh-refinement of the underlying partition as well as the multiplicity of the knots. In the present work, we give a mathematical proof that this algorithm leads to convergence even with optimal algebraic rates. Technical contributions include a novel mesh-size function which also monitors the knot multiplicity as well as inverse estimates for NURBS in fractional-order Sobolev norms.

math.NA↗

arXiv2015

Heat assisted magnetic recording of bit patterned media beyond 10 Tb/in$^2$

The limits of the areal storage density as can be achieved with heat assisted magnetic recording (HAMR) are still an open issue. We want to address this central question and present the design of a possible bit patterned medium with an areal storage density above 10 Tb/in$^2$. The model uses hard magnetic recording grains with 5 nm diameter and 10 nm height. It assumes a realistic distribution of the Curie temperature of the underlying material as well as a realistic distribution of the grain size and the grain position. In order to compute the areal density we analyze the detailed switching behavior of a recording bit under different external conditions, which allows to compute the bit error rate of a recording process (shingled and conventional) for different grain spacings and write head positions. Hence, we are able to optimize the areal density of the presented medium.

cond-mat.mtrl-sci↗

arXiv2015

Optimal additive Schwarz methods for the $hp$-BEM: the hypersingular integral operator in 3D on locally refined meshes

We propose and analyze an overlapping Schwarz preconditioner for the $p$ and $hp$ boundary element method for the hypersingular integral equation in 3D. We consider surface triangulations consisting of triangles. The condition number is bounded uniformly in the mesh size $h$ and the polynomial order $p$. The preconditioner handles adaptively refined meshes and is based on a local multilevel preconditioner for the lowest order space. Numerical experiments on different geometries illustrate its robustness.

math.NA↗

arXiv2015

A three-dimensional spin-diffusion model for micromagnetics

We implement a finite-element scheme that solves the Landau-Lifshitz-Gilbert equation coupled to a diffusion equation accounting for spin-polarized currents. The latter solves for the spin accumulation not only in magnetic materials but also in nonmagnetic conductors. The presented method incorporates the model by Slonczewski for the description of spin torque in magnetic multilayers as well as the model of Zhang and Li for the description of current driven domain-wall motion. Furthermore it is able to do both resolve the time evolution of the spin accumulation or treat it in an adiabatic fashion by the choice of sufficiently large time steps.

physics.comp-ph↗

arXiv2015

An abstract analysis of optimal goal-oriented adaptivity

We provide an abstract framework for optimal goal-oriented adaptivity for finite element methods and boundary element methods in the spirit of [Carstensen et al., Comput. Math. Appl. 67 (2014)]. We prove that this framework covers standard discretizations of general second-order linear elliptic PDEs and hence generalizes available results [Mommer & Stevenson, SIAM J. Numer. Anal. 47 (2009); Becker et al., SIAM J. Numer. Anal. 49 (2011)] beyond the Poisson equation.

math.NA↗

arXiv2015

Adaptive 2D IGA boundary element methods

We derive and discuss a posteriori error estimators for Galerkin and collocation IGA boundary element methods for weakly-singular integral equations of the first-kind in 2D. While recent own work considered the Faermann residual error estimator for Galerkin IGA boundary element methods, the present work focuses more on collocation and weighted- residual error estimators, which provide reliable upper bounds for the energy error. Our analysis allows piecewise smooth parametrizations of the boundary, local mesh-refinement, and related standard piecewise polynomials as well as NURBS. We formulate an adaptive algorithm which steers the local mesh-refinement and the multiplicity of the knots. Numerical experiments show that the proposed adaptive strategy leads to optimal convergence, and related IGA boundary element methods are superior to standard boundary element methods with piecewise polynomials.

math.NA↗

arXiv2015

Local inverse estimates for non-local boundary integral operators

We prove local inverse-type estimates for the four non-local boundary integral operators associated with the Laplace operator on a bounded d-dimensional Lipschitz domain Omega for d >= 2 with piecewise smooth boundary. For piecewise polynomial ansatz spaces and d = 2 or 3, the inverse estimates are explicit in both the local mesh width and the approximation order. An application to efficiency estimates in a posteriori error estimation in boundary element methods is given.

math.NA↗

arXiv2015

L2-orthogonal projections onto finite elements on locally refined meshes are H1-stable

We merge and extend recent results which prove the H1-stability of the L2-orthogonal projection onto standard finite element spaces, provided that the underlying simplicial triangulation is appropriately graded. For lowest-order Courant finite elements S1(T) in Rd with d>=2, we prove that such a grading is always ensured for adaptive meshes generated by newest vertex bisection. For higher-order finite elements Sp(T) with p>=1, we extend existing bounds on the polynomial degree with a computer-assisted proof. We also consider L2-orthogonal projections onto certain subspaces of Sp(T) which incorporate zero Dirichlet boundary conditions resp. an integral mean zero property.

math.NA↗

arXiv2015

Existence of $\mathcal{H}$-matrix approximants to the inverse of BEM matrices: the hyper-singular integral operator

We consider discretizations of the hyper-singular integral operator on closed surfaces and show that the inverses of the corresponding system matrices can be approximated by blockwise low-rank matrices at an exponential rate in the block rank. We cover in particular the data-sparse format of $\mathcal{H}$-matrices. We show the approximability result for two types of discretizations. The first one is a saddle point formulation, which incorporates the constraint of vanishing mean of the solution. The second discretization is based on a stabilized hyper-singular operator, which leads to symmetric positive definite matrices. In this latter setting, we also show that the hierarchical Cholesky factorization can be approximated at an exponential rate in the block rank.

math.NA↗

arXiv2015

Simultaneous quasi-optimal convergence in FEM-BEM coupling

We consider the symmetric FEM-BEM coupling that connects two linear elliptic second order partial differential equations posed in a bounded domain $Ω$ and its complement, where the exterior problem is restated by an integral equation on the coupling boundary $Γ=\partialΩ$. We assume that the corresponding transmission problem admits a shift theorem for data in $H^{-1+s}$, $s \in [-1,-1+s_0]$, $s_0 > 1/2$. We analyze the discretization by piecewise polynomials of degree $k$ for the domain variable and piecewise polynomials of degree $k-1$ for the flux variable on the coupling boundary. Given sufficient regularity we show that (up to logarithmic factors) the optimal convergence $O(h^{k+1/2})$ in the $H^{-1/2}(Γ)$-norm is obtained for the flux variable, while classical arguments by Céa-type quasi-optimality and standard approximation results provide only $O(h^k)$ for the overall error in the natural product norm on $H^1(Ω)\times H^{-1/2}(Γ)$.

math.NA↗

arXiv2014

Existence of $\mathcal{H}$-matrix approximants to the inverses of BEM matrices: the simple-layer operator

We consider the question of approximating the inverse $\mathbf W = \mathbf V^{-1}$ of the Galerkin stiffness matrix $\mathbf V$ obtained by discretizing the simple-layer operator $V$ with piecewise constant functions. The block partitioning of $\mathbf W$ is assumed to satisfy any of the standard admissibility criteria that are employed in connection with clustering algorithms to approximate the discrete BEM operator $\mathbf V$. We show that $\mathbf W$ can be approximated by blockwise low-rank matrices such that the error decays exponentially in the block rank employed. Similar exponential approximability results are shown for the Cholesky factorization of $\mathbf V$.

math.NA↗