Fredrik Hellman

Fredrik Hellman

Auto-generated profile, based on publicly available information

Fredrik Hellman

Chalmers Univ Technol, Dept Math Sci, S-41296 Gothenburg, Sweden

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 January 2020 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
FHFredrik Hellman
Fredrik Hellman
TKTim Keil
Tim Keil
AMAxel Målqvist
Axel Målqvist
In this paper we study elliptic partial differential equations with rapidly varying diffusion coefficient that can be represented as a perturbation of a reference coefficient. We develop a numerical method for efficiently solving multiple perturbed problems by reusing local computations performed with the reference coefficient. The proposed method is based on the Petrov--Galerkin localized orthogonal decomposition (PG-LOD), which allows for straightforward parallelization with low communication overhead and memory consumption. We focus on two types of perturbations: local defects, which we treat by recomputation of multiscale shape functions, and global mappings of a reference coefficient for which we apply the domain mapping method. We analyze the proposed method for these problem classes and present several numerical examples.

1 January 2016 in Discrete and Continuous Dynamical Systems - S
Verified
Journal Article
Open access
PDF file
FHFredrik Hellman
Fredrik Hellman
PHPatrick Henning
Patrick Henning
AMAxel Målqvist
Axel Målqvist
In this work, we propose a mixed finite element method for solving elliptic multiscale problems based on a localized orthogonal decomposition (LOD) of Raviart--Thomas finite element spaces. It requires to solve local problems in small patches around the elements of a coarse grid. These computations can be perfectly parallelized and are cheap to perform. Using the results of these patch problems, we construct a low dimensional multiscale mixed finite element space with very high approximation properties. This space can be used for solving the original saddle point problem in an efficient way. We prove convergence of our approach, independent of structural assumptions or scale separation. Finally, we demonstrate the applicability of our method by presenting a variety of numerical experiments, including a comparison with an MsFEM approach.

9 November 2023 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Open access
FEFredrik Edelvik
Fredrik Edelvik
MGM. Görtz
M. Görtz
FHF. Hellman
F. Hellman
GKG. Kettil
G. Kettil
AMA. Målqvist
A. Målqvist

1 August 2016 in Advances in Water Resources
Verified
Journal Article
Closed access
FFF. Fagerlund
F. Fagerlund
FHF. Hellman
F. Hellman
AMA. Målqvist
A. Målqvist
ANA. Niemi
A. Niemi

28 August 2014 in arXiv
Verified
Preprint
Open access
PDF file
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 of the solution to the model is below (or above) some critical value. By combining recent results on quantile estimation and the multilevel Monte Carlo method we develop a method which reduces computational cost without loss of accuracy. We show how the computational cost of the method relates to error tolerance of the failure probability. For a wide and common class of problems, the computational cost is asymptotically proportional to solving a single accurate realization of the numerical model, i.e., independent of the number of samples. Significant reductions in computational cost are also observed in numerical experiments.