arXiv subjects

Daniel Peterseim

Publications and source records attributed to Daniel Peterseim.

72 records · Page 4Linked to original sources

arXiv2016

Adaptive Mesh Refinement Strategies in Isogeometric Analysis - A Computational Comparison

We explain four variants of an adaptive finite element method with cubic splines and compare their performance in simple elliptic model problems. The methods in comparison are Truncated Hierarchical B-splines with two different refinement strategies, T-splines with the refinement strategy introduced by Scott et al. in 2012, and T-splines with an alternative refinement strategy introduced by some of the authors. In four examples, including singular and non-singular problems of linear elasticity and the Poisson problem, the H1-errors of the discrete solutions, the number of degrees of freedom as well as sparsity patterns and condition numbers of the discretized problem are compared.

math.NA↗

arXiv2016

Robust Numerical Upscaling of Elliptic Multiscale Problems at High Contrast

We present a new approach to the numerical upscaling for elliptic problems with rough diffusion coefficient at high contrast. It is based on the localizable orthogonal decomposition of $H^1$ into the image and the kernel of some novel stable quasi-interpolation operators with local $L^2$-approximation properties, independent of the contrast. We identify a set of sufficient assumptions on these quasi-interpolation operators that guarantee in principle optimal convergence without pre-asymptotic effects for high-contrast coefficients. We then give an example of a suitable operator and establish the assumptions for a particular class of high-contrast coefficients. So far this is not possible without any pre-asymptotic effects, but the optimal convergence is independent of the contrast and the asymptotic range is largely improved over other discretisation schemes. The new framework is sufficiently flexible to allow also for other choices of quasi-interpolation operators and the potential for fully robust numerical upscaling at high contrast.

math.NA↗

arXiv2015

Multiscale Petrov-Galerkin Method for High-Frequency Heterogeneous Helmholtz Equations

This paper presents a multiscale Petrov-Galerkin finite element method for time-harmonic acoustic scattering problems with heterogeneous coefficients in the high-frequency regime. We show that the method is pollution- free also in the case of heterogeneous media provided that the stability bound of the continuous problem grows at most polynomially with the wave number k. By generalizing classical estimates of [Melenk, Ph.D. Thesis 1995] and [Hetmaniuk, Commun. Math. Sci. 5 (2007)] for homogeneous medium, we show that this assumption of polynomially wave number growth holds true for a particular class of smooth heterogeneous material coefficients. Further, we present numerical examples to verify our stability estimates and implement an example in the wider class of discontinuous coefficients to show computational applicability beyond our limited class of coefficients.

math.NA↗

arXiv2015

Variational Multiscale Stabilization and the Exponential Decay of Fine-scale Correctors

This paper addresses the variational multiscale stabilization of standard finite element methods for linear partial differential equations that exhibit multiscale features. The stabilization is of Petrov-Galerkin type with a standard finite element trial space and a problem-dependent test space based on pre-computed fine-scale correctors. The exponential decay of these correctors and their localisation to local cell problems is rigorously justified. The stabilization eliminates scale-dependent pre-asymptotic effects as they appear for standard finite element discretizations of highly oscillatory problems, e.g., the poor $L^2$ approximation in homogenization problems or the pollution effect in high-frequency acoustic scattering.

math.NA↗

arXiv2015

Generalized finite element methods for quadratic eigenvalue problems

We consider a large-scale quadratic eigenvalue problem (QEP), formulated using P1 finite elements on a fine scale reference mesh. This model describes damped vibrations in a structural mechanical system. In particular we focus on problems with rapid material data variation, e.g., composite materials. We construct a low dimensional generalized finite element (GFE) space based on the localized orthogonal decomposition (LOD) technique. The construction involves the (parallel) solution of independent localized linear Poisson-type problems. The GFE space is then used to compress the large-scale algebraic QEP to a much smaller one with a similar modeling accuracy. The small scale QEP can then be solved by standard techniques at a significantly reduced computational cost. We prove convergence with rate for the proposed method and numerical experiments confirm our theoretical findings.

math.NA↗

arXiv2015

Eliminating the pollution effect in Helmholtz problems by local subscale correction

We introduce a new Petrov-Galerkin multiscale method for the numerical approximation of the Helmholtz equation with large wave number $κ$ in bounded domains in $\mathbb{R}^d$. The discrete trial and test spaces are generated from standard mesh-based finite elements by local subscale corrections in the spirit of numerical homogenization. The precomputation of the corrections involves the solution of coercive cell problems on localized subdomains of size $\ell H$; $H$ being the mesh size and $\ell$ being the oversampling parameter. If the mesh size and the oversampling parameter are such that $Hκ$ and $\log(κ)/\ell$ fall below some generic constants and if the cell problems are solved sufficiently accurate on some finer scale of discretization, then the method is stable and its error is proportional to $H$; pollution effects are eliminated in this regime.

math.NA↗

arXiv2015

Complexity of hierarchical refinement for a class of admissible mesh configurations

An adaptive isogeometric method based on $d$-variate hierarchical spline constructions can be derived by considering a refine module that preserves a certain class of admissibility between two consecutive steps of the adaptive loop [6]. In this paper we provide a complexity estimate, i.e., an estimate on how the number of mesh elements grows with respect to the number of elements that are marked for refinement by the adaptive strategy. Our estimate is in the line of the similar ones proved in the finite element context, [3,24].

math.NA↗

arXiv2015

Stable Multiscale Petrov-Galerkin Finite Element Method for High Frequency Acoustic Scattering

We present and analyze a pollution-free Petrov-Galerkin multiscale finite element method for the Helmholtz problem with large wave number $κ$ as a variant of [Peterseim, ArXiv:1411.1944, 2014]. We use standard continuous $Q_1$ finite elements at a coarse discretization scale $H$ as trial functions, whereas the test functions are computed as the solutions of local problems at a finer scale $h$. The diameter of the support of the test functions behaves like $mH$ for some oversampling parameter $m$. Provided $m$ is of the order of $\log(κ)$ and $h$ is sufficiently small, the resulting method is stable and quasi-optimal in the regime where $H$ is proportional to $κ^{-1}$. In homogeneous (or more general periodic) media, the fine scale test functions depend only on local mesh-configurations. Therefore, the seemingly high cost for the computation of the test functions can be drastically reduced on structured meshes. We present numerical experiments in two and three space dimensions.

math.NA↗

arXiv2014

Analysis-suitable adaptive T-mesh refinement with linear complexity

We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, this is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spaces, and linear computational complexity of the refinement procedure in terms of the number of marked and generated mesh elements.

math.NA↗

arXiv2014

A Multiscale Method for Porous Microstructures

In this paper we develop a multiscale method to solve problems in complicated porous microstructures with Neumann boundary conditions. By using a coarse-grid quasi-interpolation operator to define a fine detail space and local orthogonal decomposition, we construct multiscale corrections to coarse-grid basis functions with microstructure. By truncating the corrector functions we are able to make a computationally efficient scheme. Error results and analysis are presented. A key component of this analysis is the investigation of the Poincaré constants in perforated domains as they may contain micro-structural information. Using a constructive method originally developed for weighted Poincaré inequalities, we are able to obtain estimates on Poincaré constants with respect to scale and separation length of the pores. Finally, two numerical examples are presented to verify our estimates.

math.NA↗

arXiv2014

Multiscale Partition of Unity

We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite element mesh. The method modifies a given partition of unity such that optimal convergence is achieved independent of oscillation or discontinuities of the diffusion coefficient. The modification is based on an orthogonal decomposition of the solution space while preserving the partition of unity property. This precomputation involves the solution of independent problems on local subdomains of selectable size. We deduce quantitative error estimates for the method that account for the chosen amount of localization. Numerical experiments illustrate the high approximation properties even for 'cheap' parameter choices.

math.NA↗

arXiv2014

Computation of eigenvalues by numerical upscaling

We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we consider benchmark multi-scale eigenvalue problems in reservoir modeling and material science. We compute a low-dimensional generalized (possibly mesh free) finite element space that preserves the lowermost eigenvalues in a superconvergent way. The approximate eigenpairs are then obtained by solving the corresponding low-dimensional algebraic eigenvalue problem. The rigorous error bounds are based on two-scale decompositions of $H^1_0(Ω)$ by means of a certain Clément-type quasi-interpolation operator.

math.NA↗

arXiv2014

Two-Level discretization techniques for ground state computations of Bose-Einstein condensates

This work presents a new methodology for computing ground states of Bose-Einstein condensates based on finite element discretizations on two different scales of numerical resolution. In a pre-processing step, a low-dimensional (coarse) generalized finite element space is constructed. It is based on a local orthogonal decomposition and exhibits high approximation properties. The non-linear eigenvalue problem that characterizes the ground state is solved by some suitable iterative solver exclusively in this low-dimensional space, without loss of accuracy when compared with the solution of the full fine scale problem. The pre-processing step is independent of the types and numbers of bosons. A post-processing step further improves the accuracy of the method. We present rigorous a priori error estimates that predict convergence rates H^3 for the ground state eigenfunction and H^4 for the corresponding eigenvalue without pre-asymptotic effects; H being the coarse scale discretization parameter. Numerical experiments indicate that these high rates may still be pessimistic.

math.NA↗

arXiv2014

Comparison results for the Stokes equations

This paper enfolds a medius analysis for the Stokes equations and compares different finite element methods (FEMs). A first result is a best approximation result for a P1 non-conforming FEM. The main comparison result is that the error of the P2-P0-FEM is a lower bound to the error of the Bernardi-Raugel (or reduced P2-P0) FEM, which is a lower bound to the error of the P1 non-conforming FEM, and this is a lower bound to the error of the MINI-FEM. The paper discusses the converse direction, as well as other methods such as the discontinuous Galerkin and pseudostress FEMs. Furthermore this paper provides counterexamples for equivalent convergence when different pressure approximations are considered. The mathematical arguments are various conforming companions as well as the discrete inf-sup condition.

math.NA↗

arXiv2013

Localization of Elliptic Multiscale Problems

This note constructs a local generalized finite element basis for elliptic problems with heterogeneous and highly varying coefficients. The basis functions are solutions of local problems on vertex patches. The error of the corresponding generalized finite element method decays exponentially with respect to the number of element layers in the patches. Hence, on a uniform mesh of size H, patches of diameter H\log(1/H) are sufficient to preserve a linear rate of convergence in H without any pre-asymptotic or resonance effects. The analysis does not rely on regularity of the solution or scale separation in the coefficient. This result motivates new and justifies old classes of variational multiscale methods.

math.NA↗

arXiv2013

A localized orthogonal decomposition method for semi-linear elliptic problems

In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coefficient functions. For this purpose we construct a generalized finite element basis that spans a low dimensional multiscale space. The basis is assembled by performing localized linear fine-scale computations in small patches that have a diameter of order H |log H| where H is the coarse mesh size. Without any assumptions on the type of the oscillations in the coefficients, we give a rigorous proof for a linear convergence of the H1-error with respect to the coarse mesh size. To solve the arising equations, we propose an algorithm that is based on a damped Newton scheme in the multiscale space.

math.NA↗

arXiv2013

Oversampling for the Multiscale Finite Element Method

This paper reviews standard oversampling strategies as performed in the Multiscale Finite Element Method (MsFEM). Common to those approaches is that the oversampling is performed in the full space restricted to a patch but including coarse finite element functions. We suggest, by contrast, to perform local computations with the additional constraint that trial and test functions are linear independent from coarse finite element functions. This approach re-interprets the Variational Multiscale Method in the context of computational homogenization. This connection gives rise to a general fully discrete error analysis for the proposed multiscale method with constrained oversampling without any resonance effects. In particular, we are able to give the first rigorous proof of convergence for a MsFEM with oversampling.

math.NA↗

arXiv2012

Convergence of a discontinuous Galerkin multiscale method

A convergence result for a discontinuous Galerkin multiscale method for a second order elliptic problem is presented. We consider a heterogeneous and highly varying diffusion coefficient in $L^\infty(Ω,\mathbb{R}^{d\times d}_{sym})$ with uniform spectral bounds and 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 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 as $\mathcal{O}(H|\log(H^{-1})|)$. We also discuss a way to further localize the corrected basis to element-wise support leading to a slight increase of the dimension of the space. Improved convergence rate can be achieved depending on the piecewise regularity of the forcing function. Linear convergence in energy norm and quadratic convergence in $L^2$-norm is obtained independently of the forcing function. A series of numerical experiments confirms the theoretical rates of convergence.

math.NA↗