Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Eike Hermann Müller

dblp:142/2793 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0003-3006-3347ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering › numerical analysis
adaptive mesh refinement
0.912025
G-Adaptivity: optimised graph-based mesh relocation for finite element methods · ICML 2025
Computational science and engineering
finite element analysis
0.912025
G-Adaptivity: optimised graph-based mesh relocation for finite element methods · ICML 2025

Methods — techniques the papers use, named apart from their topics

r-adaptivity · 0.9graph neural network · 0.9
YearPublicationVenuePosition
2025 G-Adaptivity: optimised graph-based mesh relocation for finite element methods
abstract
We present a novel, and effective, approach to achieve optimal mesh relocation in finite element methods (FEMs). The cost and accuracy of FEMs is critically dependent on the choice of mesh points. Mesh relocation (r-adaptivity) seeks to optimise the mesh geometry to obtain the best solution accuracy at given computational budget. Classical r-adaptivity relies on the solution of a separate nonlinear “meshing” PDE to determine mesh point locations. This incurs significant cost at remeshing, and relies on estimates that relate interpolation- and FEM-error. Recent machine learning approaches have focused on the construction of fast surrogates for such classical methods. Instead, our new approach trains a graph neural network (GNN) to determine mesh point locations by directly minimising the FE solution error from the PDE system Firedrake to achieve higher solution accuracy. Our GNN architecture closely aligns the mesh solution space to that of classical meshing methodologies, thus replacing classical estimates for optimality with a learnable strategy. This allows for rapid and robust training and results in an extremely efficient and effective GNN approach to online r-adaptivity. Our method outperforms both classical, and prior ML, approaches to r-adaptive meshing. In particular, it achieves lower FE solution error, whilst retaining the significant speed-up over classical methods observed in prior ML work.
James Rowbottom, Georg Maierhofer, Teo Deveney, Eike Hermann Müller, Alberto Paganini, Katharina Schratz, Pietro Liò, Carola-Bibiane Schönlieb, Chris J. Budd
ICML4
2019 LFRic: Meeting the challenges of scalability and performance portability in Weather and Climate models
Samantha V. Adams, Rupert W. Ford, M. Hambley, J. M. Hobson, I. Kavcic, Christopher M. Maynard, Thomas Melvin, Eike Hermann Müller, S. Mullerworth, Andrew R. Porter, Mike Rezny, Ben Shipway, R. Wong
J. Parallel Distributed Comput.8
2015 Petascale solvers for anisotropic PDEs in atmospheric modelling on GPU clusters
Eike Hermann Müller, Robert Scheichl, Eero Vainikko
Parallel Comput.1