Daniel Elfverson

Dr. Daniel Elfverson

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2016 in SIAM/ASA Journal on Uncertainty Quantification
Verified
Journal Article
Closed access
DEDaniel Elfverson
Daniel Elfverson
FHFredrik Hellman
Fredrik Hellman
AMAxel Målqvist
Axel Målqvist
We propose and analyze a method for computing failure probabilities of systems modeled as numerical deterministic models (e.g., PDEs) with uncertain input data. A failure occurs when a functional o...

1 January 2013 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
DEDaniel Elfverson
Daniel Elfverson
EGEmmanuil H. Georgoulis
Emmanuil H. Georgoulis
AMAxel Målqvist
Axel Målqvist
DPDaniel Peterseim
Daniel Peterseim
We present a discontinuous Galerkin multiscale method for second order elliptic problems and prove convergence. We consider a heterogeneous and highly varying diffusion coefficient in $L^\infty(\Omega,\mathbb{R}^{d\times d}_{sym})$ with uniform spectral bounds without any assumption on scale separation or periodicity. The multiscale method uses a corrected basis that is computed on patches/subdomains. The error, due to truncation of the corrected basis, decreases exponentially with the size of the patches. Hence, to achieve an algebraic convergence rate of the multiscale solution on a uniform mesh with mesh size $H$ to a reference solution, it is sufficient to choose the patch sizes $\mathcal{O}(H|\log H|)$. We also discuss a way to further localize the corrected basis to elementwise support. Improved convergence rate can be achieved depending on the piecewise regularity of the forcing function. Linear convergence in energy norm and quadratic convergence in the $L^2$-norm is obtained independently of the forcing function. A series of numerical experiments confirms the theoretical rates of convergence.

11 January 2015 in Numerische Mathematik
Verified
Journal Article
Closed access
PDF file
DEDaniel Elfverson
Daniel Elfverson
VGVictor Ginting
Victor Ginting
PHPatrick Henning
Patrick Henning

1 April 2017 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Open access
EBErik Burman
Erik Burman
DEDaniel Elfverson
Daniel Elfverson
PHPeter Hansbo
Peter Hansbo
MLMats G. Larson
Mats G. Larson
KLKarl Larsson
Karl Larsson
We develop a cut finite element method for the Bernoulli free boundary problem. The free boundary, represented by an approximate signed distance function on a fixed background mesh, is allowed to intersect elements in an arbitrary fashion. This leads to so called cut elements in the vicinity of the boundary. To obtain a stable method, stabilization terms is added in the vicinity of the cut elements penalizing the gradient jumps across element sides. The stabilization also ensures good conditioning of the resulting discrete system. We develop a method for shape optimization based on moving the distance function along a velocity field which is computed as the $H^1$ Riesz representation of the shape derivative. We show that the velocity field is the solution to an interface problem and we prove an a priori error estimate of optimal order, given the limited regularity of the velocity field across the interface, for the the velocity field in the $H^1$ norm. Finally, we present illustrating numerical results

1 January 2013 in Multiscale Modeling & Simulation
Verified
Journal Article
Closed access
DEDaniel Elfverson
Daniel Elfverson
EGEmmanuil H. Georgoulis
Emmanuil H. Georgoulis
AMAxel Målqvist
Axel Målqvist
An adaptive discontinuous Galerkin multiscale method driven by an energy norm a posteriori error bound is proposed. The method is based on splitting the problem into a coarse and fine scale. Localized fine scale constituent problems are solved on patches of the domain and are used to obtain a modified coarse scale equation. The coarse scale equation has considerably less degrees of freedom than the original problem. The a posteriori error bound is used within an adaptive algorithm to tune the critical parameters, i.e., the refinement level and the size of the different patches on which the fine scale constituent problems are solved. The fine scale computations are completely parallelizable, since no communication between different processors is required for solving the constituent fine scale problems. The convergence of the method, the performance of the adaptive strategy, and the computational effort involved are investigated through a series of numerical experiments.

1 June 2019 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Closed access
EBErik Burman
Erik Burman
DEDaniel Elfverson
Daniel Elfverson
PHPeter Hansbo
Peter Hansbo
MLMats G. Larson
Mats G. Larson
KLKarl Larsson
Karl Larsson