Searcharxiv⌕ Search

arXiv subjects

Michael Karkulik

Publications and source records attributed to Michael Karkulik.

34 records · Page 2Linked to original sources

Variational formulation of time-fractional parabolic equations

We consider initial/boundary value problems for time-fractional parabolic PDE of order $0<α<1$ with Caputo fractional derivative (also called fractional diffusion equations in the literature). We prove well-posedness of corresponding variational formulations based entirely on fractional Sobolev-Bochner spaces, and clarify the question of possible choices of the initial value.

math.NA↗

Local high-order regularization and applications to hp-methods

We develop a regularization operator based on smoothing on a locally defined length scale. This operator is defined on $L_1$ and has approximation properties that are given by the local regularity of the function it is applied to and the local length scale. Additionally, the regularized function satisfies inverse estimates commensurate with the approximation orders. By combining this operator with a classical hp-interpolation operator, we obtain an hp-Clément type quasi-interpolation operator, i.e., an operator that requires minimal smoothness of the function to be approximated but has the expected approximation properties in terms of the local mesh size and polynomial degree. As a second application, we consider residual error estimates in hp-boundary element methods that are explicit in the local mesh size and the local approximation order.

math.NA↗

On the coupling of DPG and BEM

We develop and analyze strategies to couple the discontinuous Petrov-Galerkin method with optimal test functions to (i) least-squares boundary elements and (ii) various variants of standard Galerkin boundary elements. Essential feature of our methods is that, despite the use of boundary integral equations, optimal test functions have to be computed only locally. We apply our findings to a standard transmission problem in full space and present numerical experiments to validate our theory.

math.NA↗

DPG method with optimal test functions for a fractional advection diffusion equation

We develop an ultra-weak variational formulation of a fractional advection diffusion problem in one space dimension and prove its well-posedness. Based on this formulation, we define a DPG approximation with optimal test functions and show its quasi-optimal convergence. Numerical experiments confirm expected convergence properties, for uniform and adaptively refined meshes.

math.NA↗

Local inverse estimates for non-local boundary integral operators

We prove local inverse-type estimates for the four non-local boundary integral operators associated with the Laplace operator on a bounded d-dimensional Lipschitz domain Omega for d >= 2 with piecewise smooth boundary. For piecewise polynomial ansatz spaces and d = 2 or 3, the inverse estimates are explicit in both the local mesh width and the approximation order. An application to efficiency estimates in a posteriori error estimation in boundary element methods is given.

math.NA↗

L2-orthogonal projections onto finite elements on locally refined meshes are H1-stable

We merge and extend recent results which prove the H1-stability of the L2-orthogonal projection onto standard finite element spaces, provided that the underlying simplicial triangulation is appropriately graded. For lowest-order Courant finite elements S1(T) in Rd with d>=2, we prove that such a grading is always ensured for adaptive meshes generated by newest vertex bisection. For higher-order finite elements Sp(T) with p>=1, we extend existing bounds on the polynomial degree with a computer-assisted proof. We also consider L2-orthogonal projections onto certain subspaces of Sp(T) which incorporate zero Dirichlet boundary conditions resp. an integral mean zero property.

math.NA↗

DPG method with optimal test functions for a transmission problem

We propose and analyze a numerical method to solve an elliptic transmission problem in full space. The method consists of a variational formulation involving standard boundary integral operators on the coupling interface and an ultra-weak formulation in the interior. To guarantee the discrete inf-sup condition, the system is discretized by the DPG method with optimal test functions. We prove that principal unknowns are approximated quasi-optimally. Numerical experiments for problems with smooth and singular solutions confirm optimal convergence orders.

math.NA↗

Discontinuous Petrov-Galerkin boundary elements

Generalizing the framework of an ultra-weak formulation for a hypersingular integral equation on closed polygons in [N. Heuer, F. Pinochet, arXiv 1309.1697 (to appear in SIAM J. Numer. Anal.)], we study the case of a hypersingular integral equation on open and closed polyhedral surfaces. We develop a general ultra-weak setting in fractional-order Sobolev spaces and prove its well-posedness and equivalence with the traditional formulation. Based on the ultra-weak formulation, we establish a discontinuous Petrov-Galerkin method with optimal test functions and prove its quasi-optimal convergence in related Sobolev norms. For closed surfaces, this general result implies quasi-optimal convergence in the L^2-norm. Some numerical experiments confirm expected convergence rates.

math.NA↗

Note on discontinuous trace approximation in the practical DPG method

We analyze a non-conforming DPG method with discontinuous trace approximation for the Poisson problem in two and three space dimensions. We show its well-posedness and quasi-optimal convergence in the principal unknown. Numerical experiments confirming the theory have been presented previously.

math.NA↗

Adaptive Boundary Element Methods

This paper reviews the state of the art and discusses very recent mathematical developments in the field of adaptive boundary element methods. This includes an overview of available a posteriori error estimates as well as a state-of-the-art formulation of convergence and quasi-optimality of adaptive mesh-refining algorithms.

math.NA↗

Adaptive Crouzeix-Raviart Boundary Element Method

For the non-conforming Crouzeix-Raviart boundary elements from [Heuer, Sayas: Crouzeix-Raviart boundary elements, Numer. Math. 112, 2009], we develop and analyze a posteriori error estimators based on the $h-h/2$ methodology. We discuss the optimal rate of convergence for uniform mesh refinement, and present a numerical experiment with singular data where our adaptive algorithm recovers the optimal rate while uniform mesh refinement is sub-optimal. We also discuss the case of reduced regularity by standard geometric singularities to conjecture that, in this situation, non-uniformly refined meshes are not superior to quasi-uniform meshes for Crouzeix-Raviart boundary elements.

math.NA↗

ZZ-type aposteriori error estimators for adaptive boundary element methods on a curve

In the context of the adaptive finite element method (FEM), ZZ-error estimators named after Zienkiewicz and Zhu are mathematically well-established and widely used in practice. In this work, we propose and analyze ZZ-type error estimators for the adaptive boundary element method (BEM). We consider weakly-singular and hyper-singular integral equations and prove, in particular, convergence of the related adaptive mesh-refining algorithms.

math.NA↗

Stability of symmetric and nonsymmetric FEM-BEM couplings for nonlinear elasticity problems

We consider symmetric as well as non-symmetric coupling formulations of FEM and BEM in the frame of nonlinear elasticity problems. In particular, the Johnson-Nédélec coupling is analyzed. We prove that these coupling formulations are well-posed and allow for unique Galerkin solutions if standard discretizations by piecewise polynomials are employed. Unlike prior works, our analysis does neither rely on an interior Dirichlet boundary to tackle the rigid body motions nor on any assumption on the mesh-size of the discretization used.

math.NA↗

Classical FEM-BEM coupling methods: nonlinearities, well-posedness, and adaptivity

We consider a (possibly) nonlinear interface problem in 2D and 3D, which is solved by use of various adaptive FEM-BEM coupling strategies, namely the Johnson-Nédélec coupling, the Bielak-MacCamy coupling, and Costabel's symmetric coupling. We provide a framework to prove that the continuous as well as the discrete Galerkin solutions of these coupling methods additionally solve an appropriate operator equation with a Lipschitz continuous and strongly monotone operator. Therefore, the coupling formulations are well-defined, and the Galerkin solutions are quasi-optimal in the sense of a Céa-type lemma. For the respective Galerkin discretizations with lowest-order polynomials, we provide reliable residual-based error estimators. Together with an estimator reduction property, we prove convergence of the adaptive FEM-BEM coupling methods. A key point for the proof of the estimator reduction are novel inverse-type estimates for the involved boundary integral operators which are advertized. Numerical experiments conclude the work and compare performance and effectivity of the three adaptive coupling procedures in the presence of generic singularities.

math.NA↗

On 2D Newest Vertex Bisection: Optimality of Mesh-Closure and H1-Stability of L2-Projection

Newest vertex bisection (NVB) is a popular local mesh-refinement strategy for regular triangulations which consist of simplices. For the 2D case, we prove that the mesh-closure step of NVB, which preserves regularity of the triangulation, is quasi-optimal and that the corresponding L2-projection onto lowest-order Courant finite elements (P1-FEM) is always H1-stable. Throughout, no additional assumptions on the initial triangulation are imposed. Our analysis thus improves results of Binev, Dahmen & DeVore (Numer. Math. 97, 2004), Carstensen (Constr. Approx. 20, 2004), and Stevenson (Math. Comp. 77, 2008) in the sense that all assumptions of their theorems are removed. Consequently, our results relax the requirements under which adaptive finite element schemes can be mathematically guaranteed to convergence with quasi-optimal rates.

math.NA↗