arXiv subjects

Karl Larsson

Publications and source records attributed to Karl Larsson.

29 records · Page 2Linked to original sources

arXiv2018

Hybridized CutFEM for Elliptic Interface Problems

We design and analyze a hybridized cut finite element method for elliptic interface problems. In this method very general meshes can be coupled over internal unfitted interfaces, through a skeletal variable, using a Nitsche type approach. We discuss how optimal error estimates for the method are obtained using the tools of cut finite element methods and prove a condition number estimate for the Schur complement. Finally, we present illustrating numerical examples.

math.NA↗

arXiv2018

Cut Finite Elements for Convection in Fractured Domains

We develop a cut finite element method (CutFEM) for the convection problem in a so called fractured domain which is a union of manifolds of different dimensions such that a $d$ dimensional component always resides on the boundary of a $d+1$ dimensional component. This type of domain can for instance be used to model porous media with embedded fractures that may intersect. The convection problem can be formulated in a compact form suitable for analysis using natural abstract directional derivative and divergence operators. The cut finite element method is based on using a fixed background mesh that covers the domain and the manifolds are allowed to cut through a fixed background mesh in an arbitrary way. We consider a simple method based on continuous piecewise linear elements together with weak enforcement of the coupling conditions and stabilization. We prove a priori error estimates and present illustrating numerical examples.

math.NA↗

arXiv2018

CutIGA with Basis Function Removal

We consider a cut isogeometric method, where the boundary of the domain is allowed to cut through the background mesh in an arbitrary fashion for a second order elliptic model problem. In order to stabilize the method on the cut boundary we remove basis functions which have small intersection with the computational domain. We determine criteria on the intersection which guarantee that the order of convergence in the energy norm is not affected by the removal. The higher order regularity of the B-spline basis functions leads to improved bounds compared to standard Lagrange elements.

math.NA↗

arXiv2017

Cut Finite Element Methods for Elliptic Problems on Multipatch Parametric Surfaces

We develop a finite element method for the Laplace--Beltrami operator on a surface described by a set of patchwise parametrizations. The patches provide a partition of the surface and each patch is the image by a diffeomorphism of a subdomain of the unit square which is bounded by a number of smooth trim curves. A patchwise tensor product mesh is constructed by using a structured mesh in the reference domain. Since the patches are trimmed we obtain cut elements in the vicinity of the interfaces. We discretize the Laplace--Beltrami operator using a cut finite element method that utilizes Nitsche's method to enforce continuity at the interfaces and a consistent stabilization term to handle the cut elements. Several quantities in the method are conveniently computed in the reference domain where the mappings impose a Riemannian metric. We derive a priori estimates in the energy and $L^2$ norm and also present several numerical examples confirming our theoretical results.

math.NA↗

arXiv2017

A Nitsche Method for Elliptic Problems on Composite Surfaces

We develop a finite element method for elliptic partial differential equations on so called composite surfaces that are built up out of a finite number of surfaces with boundaries that fit together nicely in the sense that the intersection between any two surfaces in the composite surface is either empty, a point, or a curve segment, called an interface curve. Note that several surfaces can intersect along the same interface curve. On the composite surface we consider a broken finite element space which consists of a continuous finite element space at each subsurface without continuity requirements across the interface curves. We derive a Nitsche type formulation in this general setting and by assuming only that a certain inverse inequality and an approximation property hold we can derive stability and error estimates in the case when the geometry is exactly represented. We discuss several different realizations, including so called cut meshes, of the method. Finally, we present numerical examples.

math.NA↗

arXiv2017

Cut Finite Element Methods for Linear Elasticity Problems

We formulate a cut finite element method for linear elasticity based on higher order elements on a fixed background mesh. Key to the method is a stabilization term which provides control of the jumps in the derivatives of the finite element functions across faces in the vicinity of the boundary. We then develop the basic theoretical results including error estimates and estimates of the condition number of the mass and stiffness matrices. We apply the method to the standard displacement problem, the frequency response problem, and the eigenvalue problem. We present several numerical examples including studies of thin bending dominated structures relevant for engineering applications. Finally, we develop a cut finite element method for fibre reinforced materials where the fibres are modeled as a superposition of a truss and a Euler-Bernoulli beam. The beam model leads to a fourth order problem which we discretize using the restriction of the bulk finite element space to the fibre together with a continuous/discontinuous finite element formulation. Here the bulk material stabilizes the problem and it is not necessary to add additional stabilization terms.

math.NA↗

arXiv2016

Shape Optimization Using the Cut Finite Element Method

We present a cut finite element method for shape optimization in the case of linear elasticity. The elastic domain is defined by a level-set function, and the evolution of the domain is obtained by moving the level-set along a velocity field using a transport equation. The velocity field is the largest decreasing direction of the shape derivative that satisfies a certain regularity requirement and the computation of the shape derivative is based on a volume formulation. Using the cut finite element method no re--meshing is required when updating the domain and we may also use higher order finite element approximations. To obtain a stable method, stabilization terms are added in the vicinity of the cut elements at the boundary, which provides control of the variation of the solution in the vicinity of the boundary. We implement and illustrate the performance of the method in the two--dimensional case, considering both triangular and quadrilateral meshes as well as finite element spaces of different order.

math.NA↗

arXiv2016

A Cut Finite Element Method for the Bernoulli Free Boundary Value Problem

We develop a cut finite element method for the Bernoulli free boundary problem. The free boundary, represented by an approximate signed distance function on a fixed background mesh, is allowed to intersect elements in an arbitrary fashion. This leads to so called cut elements in the vicinity of the boundary. To obtain a stable method, stabilization terms is added in the vicinity of the cut elements penalizing the gradient jumps across element sides. The stabilization also ensures good conditioning of the resulting discrete system. We develop a method for shape optimization based on moving the distance function along a velocity field which is computed as the $H^1$ Riesz representation of the shape derivative. We show that the velocity field is the solution to an interface problem and we prove an a priori error estimate of optimal order, given the limited regularity of the velocity field across the interface, for the the velocity field in the $H^1$ norm. Finally, we present illustrating numerical results.

math.NA↗

arXiv2016

A continuous/discontinuous Galerkin method and a priori error estimates for the biharmonic problem on surfaces

We present a continuous/discontinuous Galerkin method for approximating solutions to a fourth order elliptic PDE on a surface embedded in $\mathbb{R}^3$. A priori error estimates, taking both the approximation of the surface and the approximation of surface differential operators into account, are proven in a discrete energy norm and in $L^2$-norm. This can be seen as an extension of the formalism and method originally used by Dziuk [14] for approximating solutions to the Laplace-Beltrami problem, and within this setting this is the first analysis of a surface finite element method formulated using higher order surface differential operators. Using a polygonal approximation $Γ_h$ of an implicitly defined surface $Γ$ we employ continuous piecewise quadratic finite elements to approximate solutions to the biharmonic equation on $Γ$. Numerical examples on the sphere and on the torus confirm the convergence rate implied by our estimates.

math.NA↗

arXiv2015

Continuous Piecewise Linear Finite Elements for the Kirchhoff-Love Plate Equation

A family of continuous piecewise linear finite elements for thin plate problems is presented. We use standard linear interpolation of the deflection field to reconstruct a discontinuous piecewise quadratic deflection field. This allows us to use discontinuous Galerkin methods for the Kirchhoff-Love plate equation. Three example reconstructions of quadratic functions from linear interpolation triangles are presented: a reconstruction using Morley basis functions, a fully quadratic reconstruction, and a more general least squares approach to a fully quadratic reconstruction. The Morley reconstruction is shown to be equivalent to the Basic Plate Triangle. Given a condition on the reconstruction operator, a priori error estimates are proved in energy norm and $L^2$ norm. Numerical results indicate that the Morley reconstruction/Basic Plate Triangle does not converge on unstructured meshes while the fully quadratic reconstruction show optimal convergence.

math.NA↗

arXiv2013

Variational Formulation of Curved Beams in Global Coordinates

In this paper we derive a variational formulation for a linear curved beam which is natively expressed in global Cartesian coordinates. During derivation the beam midline is assumed to be implicitly described by a vector distance function which eliminates the need for local coordinates. The only geometrical information appearing in the final expressions for the governing equations is the tangential direction, and thus there is no need to introduce normal directions along the curve. As a consequence zero or discontinuous curvature, for example at inflection points, pose no difficulty in this formulation. Kinematic assumptions encompassing both Timoshenko and Euler--Bernoulli beam theories are considered. With the exception of truly three dimensional formulations, models for curved beams found in literature are typically derived in the Frenet frame defined by the geometry of the beam midline. While it is intuitive to formulate curved beam models in these local coordinates, the Frenet frame suffers from ambiguity and sudden changes of orientation in straight sections of the beam. Based on the variational formulation we implement finite element models using global Cartesian degrees of freedom and discuss curvature coupling effects and locking. Numerical comparisons with classical solutions for both straight and curved cantilever beams under a tip load are given, as well as numerical examples illustrating curvature coupling effects.

math.NA↗