SearcharxivSearch

arXiv subjects

Andrea Scaglioni

Publications and source records attributed to Andrea Scaglioni.

3 recordsLinked to original sources

A Reduced Basis Method for the Stochastic Landau-Lifshitz-Gilbert Equation

In this work, we consider the construction of efficient surrogates for the stochastic version of the Landau-Lifshitz-Gilbert (LLG) equation using model order reduction techniques, in particular, the Reduced Basis (RB) method. The Stochastic LLG (SLLG) equation is a widely used phenomenological model for the time evolution of the magnetization field confined to a ferromagnetic body while taking into account the effect of random heat perturbations. This phenomenon is mathematically formulated as a nonlinear parabolic problem, where the stochastic component is represented as a parameter-dependent datum depending on a non-compact and high-dimensional parameter. In an $\textit{offline}$ phase, we use Proper Orthogonal Decomposition (POD) on high-fidelity samples of the unbounded parameter space. To that end, we use the so-called $\textit{tangent plane scheme}$. For the $\textit{online}$ phase of the RB method, we again employ the tangent plane scheme in the RB space. This is possible due to our particular construction that reduces both spaces of the magnetization and of its time derivative. Due to the saddle-point nature of this scheme, a stabilization that appropriately enriches the RB space is required. Numerical experiments show a clear advantage over earlier approaches using sparse grid interpolation. In a complementary approach, we test a sparse grid approximation of the reduced coefficients in a purely data-driven method, exhibiting the weaknesses of earlier sparse grid approaches, but benefiting from increased stability.

math.NA

Convergence of adaptive stochastic collocation with finite elements

We consider an elliptic partial differential equation with a random diffusion parameter discretized by a stochastic collocation method in the parameter domain and a finite element method in the spatial domain. We prove convergence of an adaptive algorithm which adaptively enriches the parameter space as well as refines the finite element meshes.

math.NA

Sparse grid approximation of nonlinear SPDEs: The Landau--Lifshitz--Gilbert equation

We show convergence rates for a sparse grid approximation of the distribution of solutions of the stochastic Landau-Lifshitz-Gilbert equation. Beyond being a frequently studied equation in engineering and physics, the stochastic Landau-Lifshitz-Gilbert equation poses many interesting challenges that do not appear simultaneously in previous works on uncertainty quantification: The equation is strongly non-linear, time-dependent, and has a non-convex side constraint. Moreover, the parametrization of the stochastic noise features countably many unbounded parameters and low regularity compared to other elliptic and parabolic problems studied in uncertainty quantification. We use a novel technique to establish uniform holomorphic regularity of the parameter-to-solution map based on a Gronwall-type estimate and the implicit function theorem. This method is very general and based on a set of abstract assumptions. Thus, it can be applied beyond the Landau-Lifshitz-Gilbert equation as well. We demonstrate numerically the feasibility of approximating with sparse grid and show a clear advantage of a multilevel sparse grid scheme.

math.NA