arXiv subjects

Moritz Hauck

Publications and source records attributed to Moritz Hauck.

At least 19 recordsLinked to original sources

arXiv2026

A Hybridizable Discontinuous Galerkin Method for Wave Propagation in Elastic Beam Networks

This paper studies the numerical solution of elastic wave propagation on networks, modeled by elastodynamic equations posed on each edge, coupled at the nodes through suitable transmission conditions. We propose and analyze a hybridizable discontinuous Galerkin method that exploits the network structure to reduce the global problem at each time step to a linear system whose size depends only on the number of network nodes and not on the polynomial degree of the discretization. Combining it with an energy-conservative implicit time discretization, we derive a priori error estimates of optimal order in space and time. The implicit time discretization avoids the severe CFL restriction caused by the large variation in fiber segment lengths. To efficiently solve the resulting, typically ill-conditioned global system, we introduce a two-level overlapping additive Schwarz preconditioner. Under suitable assumptions on the network, we establish uniform convergence of the resulting preconditioned conjugate gradient method. Numerical experiments confirm the theoretical findings.

math.NA↗

arXiv2026

A post-processed higher-order multiscale method for nondivergence-form elliptic equations

We study the finite element approximation of linear second-order elliptic partial differential equations in nondivergence form with highly heterogeneous diffusion and drift coefficients. A generalized Cordes condition is imposed to guarantee that a suitably renormalized version of the nondivergence-form differential operator is near the Laplacian. Based on a stabilized symmetric formulation for the gradient that enables the use of $H^1$-conforming approximation spaces, we construct a multiscale method following the methodology of the localized orthogonal decomposition with coarse basis functions tailored to the heterogeneous coefficients. We employ a novel post-processing strategy to obtain higher-order convergence rates, overcoming previous limitations imposed by the low regularity of the load functional. Numerical experiments demonstrate the performance of the method.

math.NA↗

arXiv2025

Numerical Simulation of Beam Network Models

Network models are used as efficient representation of materials with complex, interconnected locally one-dimensional structures. They typically accurately capture the mechanical properties of a material, while substantially reducing computational cost by avoiding full three-dimensional resolution. Applications include the simulation of fiber-based materials, porous media, and biological systems such as vascular networks. This article focuses on two representative problems: a stationary formulation describing the elastic deformation of beam networks, and a time-dependent formulation modeling elastic wave propagation in such materials. We propose a two-level additive domain decomposition method to efficiently solve the linear system associated with the stationary problem, as well as the linear systems that arise at each time step of the time-dependent problem through implicit time discretization. We present a rigorous convergence analysis of the domain decomposition method when used as a preconditioner, quantifying the convergence rate with respect to network connectivity and heterogeneity. The efficiency and robustness of the proposed approach are demonstrated through numerical simulations of the mechanical properties of commercial-grade paperboard.

math.NA↗

arXiv2025

A High-Order Localized Orthogonal Decomposition Method for Heterogeneous Stokes Problems

In this paper, we propose a high-order extension of the multiscale method introduced by the authors in [SIAM J. Numer. Anal., 63(4) (2025), pp. 1617--1641] for heterogeneous Stokes problems, while also providing several other improvements, including a better localization strategy and a more precise pressure reconstruction. The proposed method is based on the Localized Orthogonal Decomposition methodology and achieves optimal convergence orders under minimal structural assumptions on the coefficients. A key feature of our approach is the careful design of so-called quantities of interest, defining functionals of the solution whose values the multiscale approximation aims to reproduce exactly. Their selection is particularly delicate in the context of Stokes problems due to potential conflicts arising from the divergence-free constraint. We prove the exponential decay of the problem-adapted basis functions, justifying their localized computation in practical implementations. A rigorous a priori error analysis proves high-order convergence for both velocity and pressure, if the basis supports grow logarithmically with the desired accuracy. Numerical experiments confirm the theoretical findings.

math.NA↗

arXiv2025

A Localized Orthogonal Decomposition Method for Heterogeneous Mixed-Dimensional Problems

We propose a multiscale method for mixed-dimensional elliptic problems with highly heterogeneous coefficients arising, for example, in the modeling of fractured porous media. The method is based on the Localized Orthogonal Decomposition (LOD) framework and constructs locally supported, problem-adapted basis functions on a coarse mesh that does not need to resolve the coefficient oscillations. These basis functions are obtained in parallel by solving localized fine-scale problems. Our a priori error analysis shows that the method achieves optimal convergence with respect to the coarse mesh size, independent of the coefficient regularity, with an exponentially decaying localization error. Numerical experiments validate these theoretical findings and demonstrate the computational viability of the method.

math.NA↗

arXiv2025

Optimal Spectral Approximation in the Overlaps for Generalized Finite Element Methods

In this paper, we study a generalized finite element method for solving second-order elliptic partial differential equations with rough coefficients. The method uses local approximation spaces computed by solving eigenvalue problems on rings around the boundary of local subdomains. Compared to the corresponding method that solves eigenvalue problems on the whole subdomains, the problem size and the bandwidth of the resulting system matrices are substantially reduced, resulting in faster spectral computations. We prove a nearly exponential a priori decay result for the local approximation errors of the proposed method, which implies the nearly exponential decay of the overall approximation error of the method. The proposed method can also be used as a preconditioner, and only a slight adaptation of our theory is necessary to prove the optimal convergence of the preconditioned iteration. Numerical experiments are presented to support the effectiveness of the proposed method and to investigate its coefficient robustness.

math.NA↗

arXiv2025

A Generalized Framework for Higher-Order Localized Orthogonal Decomposition Methods

We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming constraints in the construction process. In particular, we offer a new perspective on localization strategies. We fully analyze the strategy for linear elliptic problems and discuss extensions to the Helmholtz equation and the Gross--Pitaevskii eigenvalue problem. Numerical examples are presented that particularly provide valuable comparisons between conforming and nonconforming constraints.

math.NA↗

arXiv2025

A Hybrid High-Order Method for the Gross--Pitaevskii Eigenvalue Problem

We introduce a hybrid high-order method for approximating the ground state of the nonlinear Gross--Pitaevskii eigenvalue problem. Optimal convergence rates are proved for the ground state approximation, as well as for the associated eigenvalue and energy approximations. Unlike classical conforming methods, which inherently provide upper bounds on the ground state energy, the proposed approach gives rise to guaranteed and asymptotically exact lower energy bounds. Importantly, and in contrast to previous works, they are obtained directly without the need of post-processing, leading to more accurate guaranteed lower energy bounds in practice.

math.NA↗

arXiv2024

A Localized Orthogonal Decomposition Method for Heterogeneous Stokes Problems

In this paper, we propose a multiscale method for heterogeneous Stokes problems. The method is based on the Localized Orthogonal Decomposition (LOD) methodology and has approximation properties independent of the regularity of the coefficients. We apply the LOD to an appropriate reformulation of the Stokes problem, which allows us to construct exponentially decaying basis functions for the velocity approximation while using a piecewise constant pressure approximation. The exponential decay motivates a localization of the basis computation, which is essential for the practical realization of the method. We perform a rigorous a priori error analysis and prove optimal convergence rates for the velocity approximation and a post-processed pressure approximation, provided that the supports of the basis functions are logarithmically increased with the desired accuracy. Numerical experiments support the theoretical results of this paper.

math.NA↗

arXiv2024

Arbitrary order approximations at constant cost for Timoshenko beam network models

This paper considers the numerical solution of Timoshenko beam network models, comprised of Timoshenko beam equations on each edge of the network, which are coupled at the nodes of the network using rigid joint conditions. Through hybridization, we can equivalently reformulate the problem as a symmetric positive definite system of linear equations posed on the network nodes. This is possible since the nodes, where the beam equations are coupled, are zero-dimensional objects. To discretize the beam network model, we propose a hybridizable discontinuous Galerkin method that can achieve arbitrary orders of convergence under mesh refinement without increasing the size of the global system matrix. As a preconditioner for the typically very poorly conditioned global system matrix, we employ a two-level overlapping additive Schwarz method. We prove uniform convergence of the corresponding preconditioned conjugate gradient method under appropriate connectivity assumptions on the network. Numerical experiments support the theoretical findings of this work.

math.NA↗

arXiv2024

Positivity preserving finite element method for the Gross-Pitaevskii ground state: discrete uniqueness and global convergence

We propose a positivity preserving finite element discretization for the nonlinear Gross-Pitaevskii eigenvalue problem. The method employs mass lumping techniques, which allow to transfer the uniqueness up to sign and positivity properties of the continuous ground state to the discrete setting. We further prove that every non-negative discrete excited state up to sign coincides with the discrete ground state. This allows one to identify the limit of fully discretized gradient flows, which are typically used to compute the discrete ground state, and thereby establish their global convergence. Furthermore, we perform a rigorous a priori error analysis of the proposed non-standard finite element discretization, showing optimal orders of convergence for all unknowns. Numerical experiments illustrate the theoretical results of this paper.

math.NA↗

arXiv2024

A Simple Collocation-Type Approach to Numerical Stochastic Homogenization

This paper proposes a novel collocation-type numerical stochastic homogenization method for prototypical stochastic homogenization problems with random coefficient fields of small correlation lengths. The presented method is based on a recently introduced localization technique that enforces a super-exponential decay of the basis functions relative to the underlying coarse mesh, resulting in considerable computational savings during the sampling phase. More generally, the collocation-type structure offers a particularly simple and computationally efficient construction in the stochastic setting with minimized communication between the patches where the basis functions of the method are computed. An error analysis that bridges numerical homogenization and the quantitative theory of stochastic homogenization is performed. In a series of numerical experiments, we study the effect of the correlation length and the discretization parameters on the approximation quality of the method.

math.NA↗

arXiv2024

Mixed finite elements for the Gross-Pitaevskii eigenvalue problem: a priori error analysis and guaranteed lower energy bound

We establish an a priori error analysis for the lowest-order Raviart-Thomas finite element discretisation of the nonlinear Gross-Pitaevskii eigenvalue problem. Optimal convergence rates are obtained for the primal and dual variables as well as for the eigenvalue and energy approximations. In contrast to conformal approaches, which naturally imply upper energy bounds, the proposed mixed discretisation provides a guaranteed and asymptotically exact lower bound for the ground state energy. The theoretical results are illustrated by a series of numerical experiments.

math.NA↗

arXiv2023

An algebraic multiscale method for spatial network models

In this work, we present a multiscale approach for the reliable coarse-scale approximation of spatial network models represented by a linear system of equations with respect to the nodes of a graph. The method is based on the ideas of the Localized Orthogonal Decomposition (LOD) strategy and is constructed in a fully algebraic way. This allows to apply the method to geometrically challenging objects such as corrugated cardboard. In particular, the method can also be applied to finite difference or finite element discretizations of elliptic partial differential equations, yielding an approximation with similar properties as the LOD in the continuous setting. We present a rigorous error analysis of the proposed method under suitable assumptions on the network. Moreover, numerical examples are presented that underline our theoretical results.

math.NA↗

arXiv2022

A reduced basis super-localized orthogonal decomposition for reaction-convection-diffusion problems

This paper presents a method for the numerical treatment of reaction-convection-diffusion problems with parameter-dependent coefficients that are arbitrary rough and possibly varying at a very fine scale. The presented technique combines the reduced basis (RB) framework with the recently proposed super-localized orthogonal decomposition (SLOD). More specifically, the RB is used for accelerating the typically costly SLOD basis computation, while the SLOD is employed for an efficient compression of the problem's solution operator requiring coarse solves only. The combined advantages of both methods allow one to tackle the challenges arising from parametric heterogeneous coefficients. Given a value of the parameter vector, the method outputs a corresponding compressed solution operator which can be used to efficiently treat multiple, possibly non-affine, right-hand sides at the same time, requiring only one coarse solve per right-hand side.

math.NA↗

arXiv2022

Multi-resolution Localized Orthogonal Decomposition for Helmholtz problems

We introduce a novel multi-resolution Localized Orthogonal Decomposition (LOD) for time-harmonic acoustic scattering problems that can be modeled by the Helmholtz equation. The method merges the concepts of LOD and operator-adapted wavelets (gamblets) and proves its applicability for a class of complex-valued, non-hermitian and indefinite problems. It computes hierarchical bases that block-diagonalize the Helmholtz operator and thereby decouples the discretization scales. Sparsity is preserved by a novel localization strategy that improves stability properties even in the elliptic case. We present a rigorous stability and a-priori error analysis of the proposed method for homogeneous media. In addition, we investigate the fast solvability of the blocks by a standard iterative method. A sequence of numerical experiments illustrates the sharpness of the theoretical findings and demonstrates the applicability to scattering problems in heterogeneous media.

math.NA↗

arXiv2022

Super-localization of elliptic multiscale problems

Numerical homogenization aims to efficiently and accurately approximate the solution space of an elliptic partial differential operator with arbitrarily rough coefficients in a $d$-dimensional domain. The application of the inverse operator to some standard finite element space defines an approximation space with uniform algebraic approximation rates with respect to the mesh size parameter $H$. This holds even for under-resolved rough coefficients. However, the true challenge of numerical homogenization is the localized computation of a localized basis for such an operator-dependent approximate solution space. This paper presents a novel localization technique that enforces the super-exponential decay of the basis relative to $H$. This shows that basis functions with supports of width $\mathcal O(H|\log H|^{(d-1)/d})$ are sufficient to preserve the optimal algebraic rates of convergence in $H$ without pre-asymptotic effects. A sequence of numerical experiments illustrates the significance of the new localization technique when compared to the so far best localization to supports of width $\mathcal O(H|\log H|)$.

math.NA↗

arXiv2022

A Super-Localized Generalized Finite Element Method

This paper presents a novel multi-scale method for elliptic partial differential equations with arbitrarily rough coefficients. In the spirit of numerical homogenization, the method constructs problem-adapted ansatz spaces with uniform algebraic approximation rates. Localized basis functions with the same super-exponential localization properties as the recently proposed Super-Localized Orthogonal Decomposition enable an efficient implementation. The method's basis stability is enforced using a partition of unity approach. A natural extension to higher order is presented, resulting in higher approximation rates and enhanced localization properties. We perform a rigorous a priori and a posteriori error analysis and confirm our theoretical findings in a series of numerical experiments. In particular, we demonstrate the method's applicability for challenging high-contrast channeled coefficients.

math.NA↗