Roland Maier

NA
h-index9
6papers
87citations
Novelty43%
AI Score43

6 Papers

5.9NADec 22, 2018
Computational multiscale methods for linear heterogeneous poroelasticity

Robert Altmann, Eric Chung, Roland Maier et al.

We consider a strongly heterogeneous medium saturated by an incompressible viscous fluid as it appears in geomechanical modeling. This poroelasticity problem suffers from rapidly oscillating material parameters, which calls for a thorough numerical treatment. In this paper, we propose a method based on the local orthogonal decomposition technique and motivated by a similar approach used for linear thermoelasticity. Therein, local corrector problems are constructed in line with the static equations, whereas we propose to consider the full system. This allows to benefit from the given saddle point structure and results in two decoupled corrector problems for the displacement and the pressure. We prove the optimal first-order convergence of this method and verify the result by numerical experiments.

5.7NAMay 14
Optimal higher-order convergence rates for parabolic multiscale problems

Balaje Kalyanaraman, Felix Krumbiegel, Roland Maier et al.

In this paper, we introduce a higher-order multiscale method for time-dependent problems with highly oscillatory coefficients. Building on the localized orthogonal decomposition (LOD) framework, we construct enriched correction operators to enrich the multiscale spaces, ensuring higher-order convergence without requiring assumptions on the coefficient beyond boundedness. This approach addresses the challenge of a reduction of convergence rates when applying higher-order LOD methods to time-dependent problems. Addressing a parabolic equation as a model problem, we prove the exponential decay of these enriched corrections and establish rigorous a priori error estimates. Numerical experiments confirm our theoretical results.

3.6CVDec 24, 2025Code
PUFM++: Point Cloud Upsampling via Enhanced Flow Matching

Zhi-Song Liu, Chenhang He, Roland Maier et al.

Recent advances in generative modeling have demonstrated strong promise for high-quality point cloud upsampling. In this work, we present PUFM++, an enhanced flow-matching framework for reconstructing dense and accurate point clouds from sparse, noisy, and partial observations. PUFM++ improves flow matching along three key axes: (i) geometric fidelity, (ii) robustness to imperfect input, and (iii) consistency with downstream surface-based tasks. We introduce a two-stage flow-matching strategy that first learns a direct, straight-path flow from sparse inputs to dense targets, and then refines it using noise-perturbed samples to approximate the terminal marginal distribution better. To accelerate and stabilize inference, we propose a data-driven adaptive time scheduler that improves sampling efficiency based on interpolation behavior. We further impose on-manifold constraints during sampling to ensure that generated points remain aligned with the underlying surface. Finally, we incorporate a recurrent interface network~(RIN) to strengthen hierarchical feature interactions and boost reconstruction quality. Extensive experiments on synthetic benchmarks and real-world scans show that PUFM++ sets a new state of the art in point cloud upsampling, delivering superior visual fidelity and quantitative accuracy across a wide range of tasks. Code and pretrained models are publicly available at https://github.com/Holmes-Alan/Enhanced_PUFM.

1.2NANov 12, 2024
Numerical Homogenization by Continuous Super-Resolution

Zhi-Song Liu, Roland Maier, Andreas Rupp

Finite element methods typically require a high resolution to satisfactorily approximate micro and even macro patterns of an underlying physical model. This issue can be circumvented by appropriate numerical homogenization or multiscale strategies that are able to obtain reasonable approximations on under-resolved scales. In this paper, we study the implicit neural representation and propose a continuous super-resolution network as a numerical homogenization strategy. It can take coarse finite element data to learn both in-distribution and out-of-distribution high-resolution finite element predictions. Our highlight is the design of a local implicit transformer, which is able to learn multiscale features. We also propose Gabor wavelet-based coordinate encodings which can overcome the bias of neural networks learning low-frequency features. Finally, perception is often preferred over distortion so scientists can recognize the visual pattern for further investigation. However, implicit neural representation is known for its lack of local pattern supervision. We propose to use stochastic cosine similarities to compare the local feature differences between prediction and ground truth. It shows better performance on structural alignments. Our experiments show that our proposed strategy achieves superior performance as an in-distribution and out-of-distribution super-resolution strategy.

4.2LGFeb 13, 2020
XCS Classifier System with Experience Replay

Anthony Stein, Roland Maier, Lukas Rosenbauer et al.

XCS constitutes the most deeply investigated classifier system today. It bears strong potentials and comes with inherent capabilities for mastering a variety of different learning tasks. Besides outstanding successes in various classification and regression tasks, XCS also proved very effective in certain multi-step environments from the domain of reinforcement learning. Especially in the latter domain, recent advances have been mainly driven by algorithms which model their policies based on deep neural networks -- among which the Deep-Q-Network (DQN) is a prominent representative. Experience Replay (ER) constitutes one of the crucial factors for the DQN's successes, since it facilitates stabilized training of the neural network-based Q-function approximators. Surprisingly, XCS barely takes advantage of similar mechanisms that leverage stored raw experiences encountered so far. To bridge this gap, this paper investigates the benefits of extending XCS with ER. On the one hand, we demonstrate that for single-step tasks ER bears massive potential for improvements in terms of sample efficiency. On the shady side, however, we reveal that the use of ER might further aggravate well-studied issues not yet solved for XCS when applied to sequential decision problems demanding for long-action-chains.

4.3NAOct 15, 2018
Explicit Computational Wave Propagation in Micro-Heterogeneous Media

Roland Maier, Daniel Peterseim

Explicit time stepping schemes are popular for linear acoustic and elastic wave propagation due to their simple nature which does not require sophisticated solvers for the inversion of the stiffness matrices. However, explicit schemes are only stable if the time step size is bounded by the mesh size in space subject to the so-called CFL condition. In micro-heterogeneous media, this condition is typically prohibitively restrictive because spatial oscillations of the medium need to be resolved by the discretization in space. This paper presents a way to reduce the spatial complexity in such a setting and, hence, to enable a relaxation of the CFL condition. This is done using the Localized Orthogonal Decomposition method as a tool for numerical homogenization. A complete convergence analysis is presented with appropriate, weak regularity assumptions on the initial data.