Related papers: Robust approximation error estimates for analysis-…
This work is concerned with quasi-optimal a-priori finite element error estimates for the obstacle problem in the $L^2$-norm. The discrete approximations are introduced as solutions to a finite element discretization of an accordingly…
The Laplace eigenvalue problem on circular sectors has eigenfunctions with corner singularities. Standard methods may produce suboptimal approximation results. To address this issue, a novel numerical algorithm that enhances standard…
The matrix formation associated to high-order discretizations is known to be numerically demanding. Based on the existing procedure of interpolation and lookup, we design a multiscale assembly procedure to reduce the exorbitant assembly…
Isogeometric Analysis is a variant of the finite element method, where spline functions are used for the representation of both the geometry and the solution. Splines, particularly those with higher degree, achieve their full approximation…
We show that isogeometric Galerkin discretizations of eigenvalue problems related to the Laplace operator subject to any standard type of homogeneous boundary conditions have no outliers in certain optimal spline subspaces. Roughly…
In this paper, a reliable a posteriori error estimator for a model problem of elastoplasticity with linear kinematic hardening is derived, which satisfies some (local) efficiency estimates. It is applicable to any discretization that is…
In this paper we get error bounds for fully discrete approximations of infinite horizon problems via the dynamic programming approach. It is well known that considering a time discretization with a positive step size $h$ an error bound of…
The objective of this study is to address the difficulty of simplifying the geometric model in which a differential problem is formulated, also called defeaturing, while simultaneously ensuring that the accuracy of the solution is…
This paper studies elasto-plastic large deformation behavior of thin shell structures using the isogeometric computational approach with the main focus on the efficiency in modelling the multi-patches and arbitrary material formulations. In…
Isogeometric Analysis (IgA) is a framework for setting up spline-based discretizations of partial differential equations, which has been introduced around a decade ago and has gained much attention since then. If large spline degrees are…
The interaction between discrete and continuous mathematics lies at the heart of many fundamental problems in applied mathematics and computational sciences. In this paper we discuss the problem of discretizing vector-valued functions…
We present a mass lumping approach based on an isogeometric Petrov-Galerkin method that preserves higher-order spatial accuracy in explicit dynamics calculations irrespective of the polynomial degree of the spline approximation. To…
In this paper we develop an isogeometric B\'ezier dual mortar method for the biharmonic problem on multi-patch domains. The well-posedness of the discrete biharmonic problem requires a discretization with $C^1$ continuous basis functions.…
We consider dual-primal isogeometric tearing and interconnection (IETI-DP) solvers for multi-patch geometries in Isogeometric Analysis. Recently, the authors have published a convergence analysis for those solvers that is explicit in both…
We present an isogeometric analysis technique that builds on manifold-based smooth basis functions for geometric modelling and analysis. Manifold-based surface construction techniques are well known in geometric modelling and a number of…
In this paper we compare approximation properties of degree $p$ spline spaces with different numbers of continuous derivatives. We prove that, for a given space dimension, $\smooth {p-1}$ splines provide better a priori error bounds for the…
Isogeometric Analysis (IGA) bridges Computer-Aided Design (CAD) and Finite Element Analysis (FEA) by employing splines as a common basis for geometry and analysis. One of the advantages of IGA is in the realm of thin shell analysis: due to…
The question of adaptive mesh generation for approximation by splines has been studied for a number of years by various authors. The results have numerous applications in computational and discrete geometry, computer aided geometric design,…
Strong approximation errors of both finite element semi-discretization and spatio-temporal full discretization are analyzed for the stochastic Allen-Cahn equation driven by additive noise in space dimension $d \leq 3$. The full…
We develop a method to compute $H^2$-conforming finite element approximations in both two and three space dimensions using readily available finite element spaces. This is accomplished by deriving a novel, equivalent mixed variational…