Mats G. Larson

Peter Hansbo, Mats G. Larson, Sara Zahedi

We present a finite element method for the Stokes equations involving two immiscible incompressible fluids with different viscosities and with surface tension. The interface separating the two fluids does not need to align with the mesh. We propose a Nitsche formulation which allows for discontinuities along the interface with optimal a priori error estimates. A stabilization procedure is included which ensures that the method produces a well conditioned stiffness matrix independent of the location of the interface.

Andre Massing, Mats G. Larson, Anders Logg et al.

We develop a Nitsche fictitious domain method for the Stokes problem starting from a stabilized Galerkin finite element method with low order elements for both the velocity and the pressure. By introducing additional penalty terms for the jumps in the normal velocity and pressure gradients in the vicinity of the boundary, we show that the method is inf-sup stable. As a consequence, optimal order a priori error estimates are established. Moreover, the condition number of the resulting stiffness matrix is shown to be bounded independently of the location of the boundary. We discuss a general, flexible and freely available implementation of the method in three spatial dimensions and present numerical examples supporting the theoretical results.

Erik Burman, Daniel Elfverson, Peter Hansbo et al.

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.

Peter Hansbo, Mats G. Larson, Sara Zahedi

In this contribution we present a new computational method for coupled bulk-surface problems on time-dependent domains. The method is based on a space-time formulation using discontinuous piecewise linear elements in time and continuous piecewise linear elements in space on a fixed background mesh. The domain is represented using a piecewise linear level set function on the background mesh and a cut finite element method is used to discretize the bulk and surface problems. In the cut finite element method the bilinear forms associated with the weak formulation of the problem are directly evaluated on the bulk domain and the surface defined by the level set, essentially using the restrictions of the piecewise linear functions to the computational domain. In addition a stabilization term is added to stabilize convection as well as the resulting algebraic system that is solved in each time step. We show in numerical examples that the resulting method is accurate and stable and results in well conditioned algebraic systems independent of the position of the interface relative to the background mesh.

Lars H. Odsæter, Mary F. Wheeler, Trond Kvamsdal et al.

A conservative flux postprocessing algorithm is presented for both steady-state and dynamic flow models. The postprocessed flux is shown to have the same convergence order as the original flux. An arbitrary flux approximation is projected into a conservative subspace by adding a piecewise constant correction that is minimized in a weighted $L^2$ norm. The application of a weighted norm appears to yield better results for heterogeneous media than the standard $L^2$ norm which has been considered in earlier works. We also study the effect of different flux calculations on the domain boundary. In particular we consider the continuous Galerkin finite element method for solving Darcy flow and couple it with a discontinuous Galerkin finite element method for an advective transport problem.

Erik Burman, Peter Hansbo, Mats G. Larson et al.

We develop a theoretical framework for the analysis of stabilized cut finite element methods for the Laplace-Beltrami operator on a manifold embedded in $\mathbb{R}^d$ of arbitrary codimension. The method is based on using continuous piecewise polynomials on a background mesh in the embedding space for approximation together with a stabilizing form that ensures that the resulting problem is stable. The discrete manifold is represented using a triangulation which does not match the background mesh and does not need to be shape-regular, which includes level set descriptions of codimension one manifolds and the non-matching embedding of independently triangulated manifolds as special cases. We identify abstract key assumptions on the stabilizing form which allow us to prove a bound on the condition number of the stiffness matrix and optimal order a priori estimates. The key assumptions are verified for three different realizations of the stabilizing form including a novel stabilization approach based on penalizing the surface normal gradient on the background mesh. Finally, we present numerical results illustrating our results for a curve and a surface embedded in $\mathbb{R}^3$.

Peter Hansbo, Mats G. Larson, Karl Larsson

We develop a finite element method for the vector Laplacian based on the covariant derivative of tangential vector fields on surfaces embedded in $\mathbb{R}^3$. Closely related operators arise in models of flow on surfaces as well as elastic membranes and shells. The method is based on standard continuous parametric Lagrange elements which describe a $\mathbb{R}^3$ vector field on the surface and the tangent condition is weakly enforced using a penalization term. We derive error estimates that take the approximation of both the geometry of the surface and the solution to the partial differential equation into account. In particular we note that to achieve optimal order error estimates, in both energy and $L^2$ norms, the normal approximation used in the penalization term must be of the same order as the approximation of the solution. This can be fulfilled either by using an improved normal in the penalization term, or by increasing the order of the geometry approximation. We also present numerical results using higher-order finite elements that verify our theoretical findings.

Peter Hansbo, Mats G. Larson, Karl Larsson

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.

Erik Burman, Peter Hansbo, Mats G. Larson

We design a cut finite element method for the incompressible Stokes equations on curved domains. The cut finite element method allows for the domain boundary to cut through the elements of the computational mesh in a very general fashion. To further facilitate the implementation we propose to use a piecewise affine discrete domain even if the physical domain has curved boundary. Dirichlet boundary conditions are imposed using Nitsche's method on the discrete boundary and the effect of the curved physical boundary is accounted for using the boundary value correction technique introduced for cut finite element methods in Burman, Hansbo, Larson, 'A cut finite element method with boundary value correction', Math. Comp. 87(310):633--657, 2018.

André Massing, Mats G. Larson, Anders Logg et al.

We develop a Nitsche-based formulation for a general class of stabilized finite element methods for the Stokes problem posed on a pair of overlapping, non-matching meshes. By ex- tending the least-squares stabilization to the overlap region, we prove that the method is stable, consistent, and optimally convergent. To avoid an ill-conditioned linear algebra system, the scheme is augmented by a least-squares term measuring the discontinuity of the solution in the overlap region of the two meshes. As a consequence, we may prove an estimate for the condition number of the resulting stiffness matrix that is independent of the location of the interface. Finally, we present numerical examples in three spatial dimensions illustrating and confirming the theoretical results.

Lars H. Odsæter, Trond Kvamsdal, Mats G. Larson

Accurate simulation of fluid flow and transport in fractured porous media is a key challenge in subsurface reservoir engineering. Due to the high ratio between its length and width, fractures can be modeled as lower dimensional interfaces embedded in the porous rock. We apply a recently developed embedded finite element method (EFEM) for the Darcy problem. This method allows for general fracture geometry, and the fractures may cut the finite element mesh arbitrarily. We present here a velocity model for EFEM and couple the Darcy problem to a transport problem for a passive solute. The main novelties of this work is a locally conservative velocity approximation derived from the EFEM solution, and the development of a lowest order upwind finite volume method for the transport problem. This numerical model is compatible with EFEM in the sense that the same computational mesh may be applied, so that we retain the same flexibility with respect to fracture geometry and meshing. Hence, our coupled solution strategy represents a simple approach in terms of formulation, implementation and meshing. We demonstrate our model by some numerical examples on both synthetic and realistic problems, including a benchmark study for single-phase flow. Despite the simplicity of the method, the results are promising.

Erik Burman, Peter Hansbo, Mats G. Larson et al.

We propose and analyze a new stabilized cut finite element method for the Laplace-Beltrami operator on a closed surface. The new stabilization term provides control of the full $\mathbb{R}^3$ gradient on the active mesh consisting of the elements that intersect the surface. Compared to face stabilization, based on controlling the jumps in the normal gradient across faces between elements in the active mesh, the full gradient stabilization is easier to implement and does not significantly increase the number of nonzero elements in the mass and stiffness matrices. The full gradient stabilization term may be combined with a variational formulation of the Laplace-Beltrami operator based on tangential or full gradients and we present a simple and unified analysis that covers both cases. The full gradient stabilization term gives rise to a consistency error which, however, is of optimal order for piecewise linear elements, and we obtain optimal order a priori error estimates in the energy and $L^2$ norms as well as an optimal bound of the condition number. Finally, we present detailed numerical examples where we in particular study the sensitivity of the condition number and error on the stabilization parameter.

Daniel Elfverson, Mats G. Larson, Karl Larsson

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.

August Johansson, Benjamin Kehlet, Mats G. Larson et al.

We present a new framework for expressing finite element methods on multiple intersecting meshes: multimesh finite element methods. The framework enables the use of separate meshes to discretize parts of a computational domain that are naturally separate; such as the components of an engine, the domains of a multiphysics problem, or solid bodies interacting under the influence of forces from surrounding fluids or other physical fields. Such multimesh finite element methods are particularly well suited to problems in which the computational domain undergoes large deformations as a result of the relative motion of the separate components of a multi-body system. In the present paper, we formulate the multimesh finite element method for the Poisson equation. Numerical examples demonstrate the optimal order convergence, the numerical robustness of the formulation and implementation in the face of thin intersections and rounding errors, as well as the applicability of the methodology. In the accompanying paper~\cite{mmfem-2}, we analyze the proposed method and prove optimal order convergence and stability.

Peter Hansbo, Mats G. Larson

We consider a stabilized finite element method for the Darcy problem on a surface based on the Masud-Hughes formulation. A special feature of the method is that the tangential condition of the velocity field is weakly enforced through the bilinear form and that standard parametric continuous polynomial spaces on triangulations can be used. We prove optimal order a priori estimates that take the approximation of the geometry and the solution into account.

Mats G. Larson, Sara Zahedi

We develop and analyze a stabilization term for cut finite element approximations of an elliptic second order partial differential equation on a surface embedded in $\mathbb{R}^d$. The new stabilization term combines properly scaled normal derivatives at the surface together with control of the jump in the normal derivatives across faces and provides control of the variation of the finite element solution on the active three dimensional elements that intersect the surface. We show that the condition number of the stiffness matrix is $O(h^{-2})$, where $h$ is the mesh parameter. The stabilization term works for linear as well as for higher-order elements and the derivation of its stabilizing properties is quite straightforward, which we illustrate by discussing the extension of the analysis to general $n$-dimensional smooth manifolds embedded in $\mathbb{R}^d$, with codimension $d-n$. We also formulate properties of a general stabilization term that are sufficient to prove optimal scaling of the condition number and optimal error estimates in energy- and $L^2$-norm. We finally present numerical studies confirming our theoretical results.

Erik Burman, Peter Hansbo, Mats G. Larson et al.

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.

Mirza Cenanovic, Peter Hansbo, Mats G. Larson

We construct a cut finite element method for the membrane elasticity problem on an embedded mesh using tangential differential calculus. Both free membranes and membranes coupled to 3D elasticity are considered. The discretization comes from a Galerkin method using the restriction of 3D basis funtions (linear or trilinear) to the surface representing the membrane. In the case of coupling to 3D elasticity, we view the membrane as giving additional stiffness contributions to the standard stiffness matrix resulting from the discretization of the three-dimensional continuum.

Daniel Elfverson, Mats G. Larson, Karl Larsson

We derive a new stabilized symmetric Nitsche method for enforcement of Dirichlet boundary conditions for elliptic problems of second order in cut isogeometric analysis (CutIGA). We consider $C^1$ splines and stabilize the standard Nitsche method by adding certain elementwise least squares terms in the vicinity of the Dirichlet boundary and an additional term on the boundary which involves the tangential gradient. We show coercivity with respect to the energy norm for functions in $H^2(Ω)$ and optimal order a priori error estimates in the energy and $L^2$ norms. To obtain a well posed linear system of equations we combine our formulation with basis function removal which essentially eliminates basis functions with sufficiently small intersection with $Ω$. The upshot of the formulation is that only elementwise stabilization is added in contrast to standard procedures based on ghost penalty and related techniques and that the stabilization is consistent. In our numerical experiments we see that the method works remarkably well in even extreme cut situations using a Nitsche parameter of moderate size.

Thomas Boiveau, Erik Burman, Susanne Claus et al.

In this paper, we consider a fictitious domain approach based on a Nitsche type method without penalty. To allow for high order approximation using piecewise affine approximation of the geometry we use a boundary value correction technique based on Taylor expansion from the approximate to the physical boundary. To ensure stability of the method a ghost penalty stabilization is considered in the boundary zone. We prove optimal error estimates in the $H^1$-norm and estimates suboptimal by $\mathcal{O}(h^{\frac12})$ in the $L^2$-norm. The suboptimality is due to the lack of adjoint consistency of our formulation. Numerical results are provided to corroborate the theoretical study.

Karl Larsson, Mats G. Larson

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.

Erik Burman, Peter Hansbo, Mats G. Larson et al.

We develop a stabilized cut finite element method for the convection problem on a surface based on continuous piecewise linear approximation and gradient jump stabilization terms. The discrete piecewise linear surface cuts through a background mesh consisting of tetrahedra in an arbitrary way and the finite element space consists of piecewise linear continuous functions defined on the background mesh. The variational form involves integrals on the surface and the gradient jump stabilization term is defined on the full faces of the tetrahedra. The stabilization term serves two purposes: first the method is stabilized and secondly the resulting linear system of equations is algebraically stable. We establish stability results that are analogous to the standard meshed flat case and prove $h^{3/2}$ order convergence in the natural norm associated with the method and that the full gradient enjoys $h^{3/4}$ order of convergence in $L^2$. We also show that the condition number of the stiffness matrix is bounded by $h^{-2}$. Finally, our results are verified by numerical examples.

Erik Burman, Daniel Elfverson, Peter Hansbo et al.

We develop a density based topology optimization method for linear elasticity based on the cut finite element method. More precisely, the design domain is discretized using cut finite elements which allow complicated geometry to be represented on a structured fixed background mesh. The geometry of the design domain is allowed to cut through the background mesh in an arbitrary way and certain stabilization terms are added in the vicinity of the cut boundary, which guarantee stability of the method. Furthermore, in addition to standard Dirichlet and Neumann conditions we consider interface conditions enabling coupling of the design domain to parts of the structure for which the design is already given. These given parts of the structure, called the nondesign domain regions, typically represents parts of the geometry provided by the designer. The nondesign domain regions may be discretized independently from the design domains using for example parametric meshed finite elements or isogeometric analysis. The interface and Dirichlet conditions are based on Nitsche's method and are stable for the full range of density parameters. In particular we obtain a traction-free Neumann condition in the limit when the density tends to zero.

Erik Burman, Peter Hansbo, Mats G. Larson

We propose a boundary value correction approach for cases when curved boundaries are approximated by straight lines (planes) and Lagrange multipliers are used to enforce Dirichlet boundary conditions. The approach allows for optimal order convergence for polynomial order up to 3. We show the relation to the Taylor series expansion approach used by Bramble, Dupont and Tomée [Math. Comp., 26:869--879, 1972] in the context of Nitsche's method and, in the case of inf-sup stable multiplier methods, prove a priori error estimates with explicit dependence on the meshsize and distance between the exact and approximate boundary.

Erik Burman, Daniel Elfverson, Peter Hansbo et al.

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.

Mirza Cenanovic, Peter Hansbo, Mats G. Larson

In this paper we consider finite element approaches to computing the mean curvature vector and normal at the vertices of piecewise linear triangulated surfaces. In particular, we adopt a stabilization technique which allows for first order $L^2$-convergence of the mean curvature vector and apply this stabilization technique also to the computation of continuous, recovered, normals using $L^2$-projections of the piecewise constant face normals. Finally, we use our projected normals to define an adaptive mesh refinement approach to geometry resolution where we also employ spline techniques to reconstruct the surface before refinement. We compare or results to previously proposed approaches.

André Massing, Mats G. Larson, Anders Logg

In recent years, a number of finite element methods have been formulated for the solution of partial differential equations on complex geometries based on non-matching or overlapping meshes. Examples of such methods include the fictitious domain method, the extended finite element method, and Nitsche's method. In all of these methods, integrals must be computed over cut cells or subsimplices which is challenging to implement, especially in three space dimensions. In this note, we address the main challenges of such an implementation and demonstrate good performance of a fully general code for automatic detection of mesh intersections and integration over cut cells and subsimplices. As a canonical example of an overlapping mesh method, we consider Nitsche's method which we apply to Poisson's equation and a linear elastic problem.

Kristoffer Selim, Anders Logg, Mats G. Larson

We present an adaptive finite element method for the incompressible Navier--Stokes equations based on a standard splitting scheme (the incremental pressure correction scheme). The presented method combines the efficiency and simplicity of a splitting method with the powerful framework offered by the finite element method for error analysis and adaptivity. An a posteriori error estimate is derived which expresses the error in a goal functional of interest as a sum of contributions from spatial discretization, time discretization and a term that measures the deviation of the splitting scheme from a pure Galerkin scheme (the computational error). Numerical examples are presented which demonstrate the performance of the adaptive algorithm and high quality efficiency indices. It is further demonstrated that the computational error of the Navier--Stokes momentum equation is linear in the size of the time step while the computational error of the continuity equation is quadratic in the size of the time step.

Peter Hansbo, Mats G. Larson

We employ surface differential calculus to derive models for Kirchhoff plates including in-plane membrane deformations. We also extend our formulation to structures of plates. For solving the resulting set of partial differential equations, we employ a finite element method based on elements that are continuous for the displacements and discontinuous for the rotations, using $C^0$-elements for the discretisation of the plate as well as for the membrane deformations. Key to the formulation of the method is a convenient definition of jumps and averages of forms that are $d$-linear in terms of the element edge normals.

Erik Burman, Peter Hansbo, Mats G. Larson

In this paper, we propose a stabilised finite element method for the numerical solution of contact between a small deformation elastic membrane and a rigid obstacle. We limit ourselves to friction--free contact, but the formulation is readily extendable to more complex situations.

Peter Hansbo, Mats G. Larson, Andre Massing

We develop a cut finite element method for the Darcy problem on surfaces. The cut finite element method is based on embedding the surface in a three dimensional finite element mesh and using finite element spaces defined on the three dimensional mesh as trial and test functions. Since we consider a partial differential equation on a surface, the resulting discrete weak problem might be severely ill conditioned. We propose a full gradient and a normal gradient based stabilization computed on the background mesh to render the proposed formulation stable and well conditioned irrespective of the surface positioning within the mesh. Our formulation extends and simplifies the Masud-Hughes stabilized primal mixed formulation of the Darcy surface problem proposed in [28] on fitted triangulated surfaces. The tangential condition on the velocity and the pressure gradient is enforced only weakly, avoiding the need for any tangential projection. The presented numerical analysis accounts for different polynomial orders for the velocity, pressure, and geometry approximation which are corroborated by numerical experiments. In particular, we demonstrate both theoretically and through numerical results that the normal gradient stabilized variant results in a high order scheme.

Daniel Elfverson, Mats G. Larson, Axel Målqvist

We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We construct corrected coarse test and trail spaces which takes the fine scale features of the computational domain into account. The corrections only need to be computed in regions surrounding fine scale geometric features. We achieve linear convergence rate in energy norm for the multiscale solution. Moreover, the conditioning of the resulting matrices is not affected by the way the domain boundary cuts the coarse elements in the background mesh. The analytical findings are verified in a series of numerical experiments.

Esubalewe Lakie Yedeg, Eddie Wadbro, Peter Hansbo et al.

We propose a new finite element method for Helmholtz equation in the situation where an acoustically permeable interface is embedded in the computational domain. A variant of Nitsche's method, different from the standard one, weakly enforces the impedance conditions for transmission through the interface. As opposed to a standard finite-element discretization of the problem, our method seamlessly handles a complex-valued impedance function $Z$ that is allowed to vanish. In the case of a vanishing impedance, the proposed method reduces to the classic Nitsche method to weakly enforce continuity over the interface. We show stability of the method, in terms of a discrete Gårding inequality, for a quite general class of surface impedance functions, provided that possible surface waves are sufficiently resolved by the mesh. Moreover, we prove an a priori error estimate under the assumption that the absolute value of the impedance is bounded away from zero almost everywhere. Numerical experiments illustrate the performance of the method for a number of test cases in 2D and 3D with different interface conditions.

Erik Burman, Peter Hansbo, Mats G. Larson et al.

We propose an unfitted finite element method for flow in fractured porous media. The coupling across the fracture uses a Nitsche type mortaring, allowing for an accurate representation of the jump in the normal component of the gradient of the discrete solution across the fracture. The flow field in the fracture is modelled simultaneously, using the average of traces of the bulk variables on the fractured. In particular the Laplace-Beltrami operator for the transport in the fracture is included using the average of the projection on the tangential plane of the fracture of the trace of the bulk gradient. Optimal order error estimates are proven under suitable regularity assumptions on the domain geometry. The extension to the case of bifurcating fractures is discussed. Finally the theory is illustrated by a series of numerical examples.

August Johansson, Mats G. Larson, Anders Logg

The multimesh finite element method enables the solution of partial differential equations on a computational mesh composed by multiple arbitrarily overlapping meshes. The discretization is based on a continuous--discontinuous function space with interface conditions enforced by means of Nitsche's method. In this contribution, we consider the Stokes problem as a first step towards flow applications. The multimesh formulation leads to so called cut elements in the underlying meshes close to overlaps. These demand stabilization to ensure coercivity and stability of the stiffness matrix. We employ a consistent least-squares term on the overlap to ensure that the inf-sup condition holds. We here present the method for the Stokes problem, discuss the implementation, and verify that we have optimal convergence.

Jonatan Vallin, Karl Larsson, Mats G. Larson

We formalize and interpret the geometric structure of $d$-dimensional fully connected ReLU layers in neural networks. The parameters of a ReLU layer induce a natural partition of the input domain, such that the ReLU layer can be significantly simplified in each sector of the partition. This leads to a geometric interpretation of a ReLU layer as a projection onto a polyhedral cone followed by an affine transformation, in line with the description in [doi:10.48550/arXiv.1905.08922] for convolutional networks with ReLU activations. Further, this structure facilitates simplified expressions for preimages of the intersection between partition sectors and hyperplanes, which is useful when describing decision boundaries in a classification setting. We investigate this in detail for a feed-forward network with one hidden ReLU-layer, where we provide results on the geometric complexity of the decision boundary generated by such networks, as well as proving that modulo an affine transformation, such a network can only generate $d$ different decision boundaries. Finally, the effect of adding more layers to the network is discussed.

Peter Hansbo, Mats G. Larson

A Galerkin finite element method for the membrane elasticity problem on a meshed surface is constructed by using two-dimensional elements extended into three dimensions. The membrane finite element model is established using the intrinsic approach suggested by [Delfour and Zolésio, A boundary differential equation for thin shells. J. Differential Equations, 119(2):426--449, 1995].

Jonatan Vallin, Karl Larsson, Mats G. Larson

We develop a geometric approximation theory for deep feed-forward neural networks with ReLU activations. Given a $d$-dimensional hypersurface in $\mathbb{R}^{d+1}$ represented as the graph of a $C^2$-function $φ$, we show that a deep fully-connected ReLU network of width $d+1$ can implicitly construct an approximation as its zero contour with a precision bound depending on the number of layers. This result is directly applicable to the binary classification setting where the sign of the network is trained as a classifier, with the network's zero contour as a decision boundary. Our proof is constructive and relies on the geometrical structure of ReLU layers provided in [doi:10.48550/arXiv.2310.03482]. Inspired by this geometrical description, we define a new equivalent network architecture that is easier to interpret geometrically, where the action of each hidden layer is a projection onto a polyhedral cone derived from the layer's parameters. By repeatedly adding such layers, with parameters chosen such that we project small parts of the graph of $φ$ from the outside in, we, in a controlled way, construct a network that implicitly approximates the graph over a ball of radius $R$. The accuracy of this construction is controlled by a discretization parameter $δ$ and we show that the tolerance in the resulting error bound scales as $(d-1)R^{3/2}δ^{1/2}$ and the required number of layers is of order $d\big(\frac{32R}δ\big)^{\frac{d+1}{2}}$.

Håkan Jakobsson, Mats G. Larson

We consider the frequency response problem and derive a posteriori error estimates for the discrete error in a reduced finite element model obtained using the component mode synthesis (CMS) method. We provide estimates in a linear quantity of interest and the energy norm. The estimates reflect to what degree each CMS subspace influence the overall error in the reduced solution. This enables automatic error control through adaptive algorithms that determine suitable dimensions of each subspace. We illustrate the theoretical results by including several numerical examples.

Erik Burman, Mats G. Larson, Karl Larsson et al.

We develop an interpolation-based reduced-order modeling framework for parameter-dependent partial differential equations arising in control, inverse problems, and uncertainty quantification. The solution is discretized in the physical domain using finite element methods, while the dependence on a finite-dimensional parameter is approximated separately. We establish existence, uniqueness, and regularity of the parametric solution and derive rigorous error estimates that explicitly quantify the interplay between spatial discretization and parameter approximation. In low-dimensional parameter spaces, classical interpolation schemes yield algebraic convergence rates based on Sobolev regularity in the parameter variable. In higher-dimensional parameter spaces, we replace classical interpolation by extreme learning machine (ELM) surrogates and obtain error bounds under explicit approximation and stability assumptions. The proposed framework is applied to inverse problems in quantitative photoacoustic tomography, where we derive potential and parameter reconstruction error estimates and demonstrate substantial computational savings compared to standard approaches, without sacrificing accuracy.

Erik Burman, Peter Hansbo, Mats G. Larson et al.

We develop a cut finite element method (CutFEM) for convection-diffusion problems posed on mixed-dimensional domains, i.e., unions of manifolds of different dimensions arranged in a hierarchical structure where lower-dimensional components form parts of the boundaries of higher-dimensional ones. Such domains arise, for instance, in the modeling of fractured porous media with intersecting fractures. The model problem is formulated in a compact abstract form using mixed-dimensional directional derivative and divergence operators, which allows the problem to be expressed in a way that closely resembles the classical convection-diffusion equation. The proposed CutFEM is based on a fixed background mesh that does not conform to the geometry, with each manifold component represented through its associated active mesh. The method employs continuous piecewise linear elements together with weak enforcement of coupling conditions and suitable stabilization. We prove a priori error estimates in energy and $L^2$ norms and establish convergence, also for solutions with reduced regularity $u \in H^s$, $1 < s \le 2$. Numerical experiments confirm the theoretical convergence rates and illustrate the performance of the method.

Mats G. Larson, Karl Larsson, Shantiram Mahata

We derive a priori error estimates for Nitsche's method applied to elliptic problems on approximate domains. Such approximations arise, for example, in unfitted finite element methods, data-driven simulations, and evolving domain problems, where the computational domain does not coincide exactly with the physical one. We quantify geometric errors in terms of boundary location and normal perturbations and carry out the analysis in an abstract CutFEM framework under standard stability assumptions. In the energy norm, we obtain an estimate exhibiting an $h^{-1/2}$ amplification of the boundary location error. We then prove a refined $H^1$-seminorm estimate that removes this amplification, yielding a sharper bound with additive contributions from boundary location and normal errors. Finally, we establish an optimal order $L^2$-error estimate based on a refined duality argument, where the geometry contribution appears as a separate additive term, decoupled from the mesh size $h$. The results reveal a fundamental distinction between the norms: the energy norm amplifies boundary location errors while remaining insensitive to normal perturbations, the $H^1$-seminorm separates location and normal errors, and the $L^2$-norm is insensitive to normal perturbations. This provides a clear characterization of how geometric approximation affects convergence in Nitsche-based finite element methods, with particular relevance for unfitted discretizations.

Philip Charles, Deep Ray, Yue Yu et al.

The optimal Petrov-Galerkin formulation to solve partial differential equations (PDEs) recovers the best approximation in a specified finite-dimensional (trial) space with respect to a suitable norm. However, the recovery of this optimal solution is contingent on being able to construct the optimal weighting functions associated with the trial basis. While explicit constructions are available for simple one- and two-dimensional problems, such constructions for a general multidimensional problem remain elusive. In the present work, we revisit the optimal Petrov-Galerkin formulation through the lens of deep learning. We propose an operator network framework called Petrov-Galerkin Variationally Mimetic Operator Network (PG-VarMiON), which emulates the optimal Petrov-Galerkin weak form of the underlying PDE. The PG-VarMiON is trained in a supervised manner using a labeled dataset comprising the PDE data and the corresponding PDE solution, with the training loss depending on the choice of the optimal norm. The special architecture of the PG-VarMiON allows it to implicitly learn the optimal weighting functions, thus endowing the proposed operator network with the ability to generalize well beyond the training set. We derive approximation error estimates for PG-VarMiON, highlighting the contributions of various error sources, particularly the error in learning the true weighting functions. Several numerical results are presented for the advection-diffusion equation to demonstrate the efficacy of the proposed method. By embedding the Petrov-Galerkin structure into the network architecture, PG-VarMiON exhibits greater robustness and improved generalization compared to other popular deep operator frameworks, particularly when the training data is limited.

Mats G. Larson, Carl Lundholm, Anna Persson

We develop and evaluate a method for learning solution operators to nonlinear problems governed by partial differential equations (PDEs). The approach is based on a finite element discretization and aims at representing the solution operator by a multilayer perceptron (MLP) that takes problem data variables as input and gives a prediction of the finite element solution as output. The variables will typically correspond to parameters in a parametrization of input data such as boundary conditions, coefficients, and right-hand sides. The output will be an approximation of the corresponding finite element solution, thus enabling support and enhancement by the standard finite element method (FEM) both theoretically and practically. The loss function is most often an energy functional and we formulate efficient parallelizable training algorithms based on assembling the energy locally on each element. For large problems, the learning process can be made more efficient by using only a small fraction of randomly chosen elements in the mesh in each iteration. The approach is evaluated on several relevant test cases, where learning the finite element solution operator turns out to be beneficial, both in its own right but also by combination with standard FEM theory and software.

Erik Burman, Mats G. Larson, Karl Larsson et al.

We consider an inverse problem involving the reconstruction of the solution to a nonlinear partial differential equation (PDE) with unknown boundary conditions. Instead of direct boundary data, we are provided with a large dataset of boundary observations for typical solutions (collective data) and a bulk measurement of a specific realization. To leverage this collective data, we first compress the boundary data using proper orthogonal decomposition (POD) in a linear expansion. Next, we identify a possible nonlinear low-dimensional structure in the expansion coefficients using an autoencoder, which provides a parametrization of the dataset in a lower-dimensional latent space. We then train an operator network to map the expansion coefficients representing the boundary data to the finite element (FE) solution of the PDE. Finally, we connect the autoencoder's decoder to the operator network which enables us to solve the inverse problem by optimizing a data-fitting term over the latent space. We analyze the underlying stabilized finite element method (FEM) in the linear setting and establish an optimal error estimate in the $H^1$-norm. The nonlinear problem is then studied numerically, demonstrating the effectiveness of our approach.

Tobias Jonsson, Mats G. Larson, Karl Larsson

We develop a parametric cut finite element method for elliptic boundary value problems with corner singularities where we have weighted control of higher order derivatives of the solution to a neighborhood of a point at the boundary. Our approach is based on identification of a suitable mapping that grades the mesh towards the singularity. In particular, this mapping may be chosen without identifying the opening angle at the corner. We employ cut finite elements together with Nitsche boundary conditions and stabilization in the vicinity of the boundary. We prove that the method is stable and convergent of optimal order in the energy norm and $L^2$ norm. This is achieved by mapping to the reference domain where we employ a structured mesh.

Erik Burman, Peter Hansbo, Mats G. Larson et al.

We consider solving the surface Helmholtz equation on a smooth two dimensional surface embedded into a three dimensional space meshed with tetrahedra. The mesh does not respect the surface and thus the surface cuts through the elements. We consider a Galerkin method based on using the restrictions of continuous piecewise linears defined on the tetrahedra to the surface as trial and test functions.Using a stabilized method combining Galerkin least squares stabilization and a penalty on the gradient jumps we obtain stability of the discrete formulation under the condition $h k < C$, where $h$ denotes the mesh size, $k$ the wave number and $C$ a constant depending mainly on the surface curvature $κ$, but not on the surface/mesh intersection. Optimal error estimates in the $H^1$ and $L^2$-norms follow.

Erik Burman, Peter Hansbo, Mats G. Larson

In this paper we develop a simple finite element method for simulation of embedded layers of high permeability in a matrix of lower permeability using a basic model of Darcy flow in embedded cracks. The cracks are allowed to cut through the mesh in arbitrary fashion and we take the flow in the crack into account by superposition. The fact that we use continuous elements leads to suboptimal convergence due to the loss of regularity across the crack. We therefore refine the mesh in the vicinity of the crack in order to recover optimal order convergence in terms of the global mesh parameter. The proper degree of refinement is determined based on an a priori error estimate and can thus be performed before the actual finite element computation is started. Numerical examples showing this effect and confirming the theoretical results are provided. The approach is easy to implement and beneficial for rapid assessment of the effect of crack orientation and may for example be used in an optimization loop.

Tobias Jonsson, Mats G. Larson, Karl Larsson

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.

Erik Burman, Peter Hansbo, Mats G. Larson

We present a new approach for adding Bernoulli beam reinforcements to Kirchhoff plates. The plate is discretised using a continuous/discontinuous finite element method based on standard continuous piecewise polynomial finite element spaces. The beams are discretised by the CutFEM technique of letting the basis functions of the plate represent also the beams which are allowed to pass through the plate elements. This allows for a fast and easy way of assessing where the plate should be supported, for instance, in an optimization loop.