Searcharxiv⌕ Search

arXiv subjects

Espen Sande

Publications and source records attributed to Espen Sande.

16 recordsLinked to original sources
arXiv2025

On a robust inf-sup condition for the Stokes problem in slender domains -- with application to preconditioning

We identify a norm on the pressure variable in the Stokes equation that allows us to prove a continuous inf-sup condition with a constant independent of the domain's aspect ratio. This is in contrast to the standard inf-sup constant, which breaks down as the aspect ratio increases. We further apply our result to construct robust operator preconditioners for the Stokes problem in slender domains. Several numerical examples illustrate the theory.

math.NA↗
arXiv2025

On the prospects of interpolatory spline bases for accurate mass lumping strategies in isogeometric analysis

While interpolatory bases such as the Lagrange basis form the cornerstone of classical finite element methods, they have been replaced in the more general finite element setting of isogeometric analysis in favor of other desirable properties. Yet, interpolation is a key property for devising accurate mass lumping strategies that are ubiquitous in explicit dynamic analyses of structures. In this article, we explore the possibility of restoring interpolation for spline bases within isogeometric analysis for the purpose of mass lumping. Although reminiscent of the spectral element method, this technique comes with its lot of surprises and challenges, which are critically assessed.

math.NA↗
arXiv2025

Mass lumping and stabilization for immersogeometric analysis

Trimmed (multi-patch) geometries are the state-of-the-art technology in computer-aided design for industrial applications such as automobile crashworthiness. In this context, fast solution techniques extensively rely on explicit time integration schemes in conjunction with mass lumping techniques that substitute the consistent mass with a (usually diagonal) approximation. For smooth isogeometric discretizations, Leidinger [1] first showed that mass lumping removed the dependency of the critical time-step on the size of trimmed elements. This finding has attracted considerable attention but has unfortunately overshadowed another more subtle effect: mass lumping may disastrously impact the accuracy of low frequencies and modes, potentially inducing spurious oscillations in the solution. In this article, we provide compelling evidence for this phenomenon and later propose a stabilization technique based on polynomial extensions that restores a level of accuracy comparable to boundary-fitted discretizations.

math.NA↗
arXiv2024

A theoretical analysis of mass scaling techniques

Mass scaling is widely used in finite element models of structural dynamics for increasing the critical time step of explicit time integration methods. While the field has been flourishing over the years, it still lacks a strong theoretical basis and mostly relies on numerical experiments as the only means of assessment. This contribution thoroughly reviews existing methods and connects them to established linear algebra results to derive rigorous eigenvalue bounds and condition number estimates. Our results cover some of the most successful mass scaling techniques, unraveling for the first time well-known numerical observations.

math.NA↗
arXiv2024

Mass lumping and outlier removal strategies for complex geometries in isogeometric analysis

Mass lumping techniques are commonly employed in explicit time integration schemes for problems in structural dynamics and both avoid solving costly linear systems with the consistent mass matrix and increase the critical time step. In isogeometric analysis, the critical time step is constrained by so-called "outlier" frequencies, representing the inaccurate high frequency part of the spectrum. Removing or dampening these high frequencies is paramount for fast explicit solution techniques. In this work, we propose mass lumping and outlier removal techniques for nontrivial geometries, including multipatch and trimmed geometries. Our lumping strategies provably do not deteriorate (and often improve) the CFL condition of the original problem and are combined with deflation techniques to remove persistent outlier frequencies. Numerical experiments reveal the advantages of the method, especially for simulations covering large time spans where they may halve the number of iterations with little or no effect on the numerical solution.

math.NA↗
arXiv2022

A mathematical theory for mass lumping and its generalization with applications to isogeometric analysis

Explicit time integration schemes coupled with Galerkin discretizations of time-dependent partial differential equations require solving a linear system with the mass matrix at each time step. For applications in structural dynamics, the solution of the linear system is frequently approximated through so-called mass lumping, which consists in replacing the mass matrix by some diagonal approximation. Mass lumping has been widely used in engineering practice for decades already and has a sound mathematical theory supporting it for finite element methods using the classical Lagrange basis. However, the theory for more general basis functions is still missing. Our paper partly addresses this shortcoming. Some special and practically relevant properties of lumped mass matrices are proved and we discuss how these properties naturally extend to banded and Kronecker product matrices whose structure allows to solve linear systems very efficiently. Our theoretical results are applied to isogeometric discretizations but are not restricted to them.

math.NA↗
arXiv2022

Ritz-type projectors with boundary interpolation properties and explicit spline error estimates

In this paper we construct Ritz-type projectors with boundary interpolation properties in finite dimensional subspaces of the usual Sobolev space and we provide a priori error estimates for them. The abstract analysis is exemplified by considering spline spaces and we equip the corresponding error estimates with explicit constants. This complements our results recently obtained for explicit spline error estimates based on the classical Ritz projectors in [Numer. Math. 144(4):889--929, 2020].

math.NA↗
arXiv2021

Application of optimal spline subspaces for the removal of spurious outliers in isogeometric discretizations

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 speaking, these optimal subspaces are obtained from the full spline space defined on certain uniform knot sequences by imposing specific additional boundary conditions. The spline subspaces of interest have been introduced in the literature some years ago when proving their optimality with respect to Kolmogorov $n$-widths in $L^2$-norm for some function classes. The eigenfunctions of the Laplacian -- with any standard type of homogeneous boundary conditions -- belong to such classes. Here we complete the analysis of the approximation properties of these optimal spline subspaces. In particular, we provide explicit $L^2$ and $H^1$ error estimates with full approximation order for Ritz projectors in the univariate and in the multivariate tensor-product setting. Besides their intrinsic interest, these estimates imply that, for a fixed number of degrees of freedom, all the eigenfunctions and the corresponding eigenvalues are well approximated, without loss of accuracy in the whole spectrum when compared to the full spline space. Moreover, there are no spurious values in the approximated spectrum. In other words, the considered subspaces provide accurate outlier-free discretizations in the univariate and in the multivariate tensor-product case. This main contribution is complemented by an explicit construction of B-spline-like bases for the considered spline subspaces. The role of such spaces as accurate discretization spaces for addressing general problems with non-homogeneous boundary behavior is discussed as well.

math.NA↗
arXiv2021

Best low-rank approximations and Kolmogorov n-widths

We relate the problem of best low-rank approximation in the spectral norm for a matrix $A$ to Kolmogorov $n$-widths and corresponding optimal spaces. We characterize all the optimal spaces for the image of the Euclidean unit ball under $A$ and we show that any orthonormal basis in an $n$-dimensional optimal space generates a best rank-$n$ approximation to $A$. We also present a simple and explicit construction to obtain a sequence of optimal $n$-dimensional spaces once an initial optimal space is known. This results in a variety of solutions to the best low-rank approximation problem and provides alternatives to the truncated singular value decomposition. This variety can be exploited to obtain best low-rank approximations with problem-oriented properties.

math.NA↗
arXiv2020

On best constants in $L^2$ approximation

In this paper we provide explicit upper and lower bounds on certain $L^2$ $n$-widths, i.e., best constants in $L^2$ approximation. We further describe a numerical method to compute these $n$-widths approximately, and prove that this method is superconvergent. Based on our numerical results we formulate a conjecture on the asymptotic behaviour of the $n$-widths. Finally we describe how the numerical method can be used to compute the breakpoints of the optimal spline spaces of Melkman and Micchelli, which have recently received renewed attention in the field of Isogeometric Analysis.

math.NA↗
arXiv2020

Explicit error estimates for spline approximation of arbitrary smoothness in isogeometric analysis

In this paper we provide a priori error estimates with explicit constants for both the $L^2$-projection and the Ritz projection onto spline spaces of arbitrary smoothness defined on arbitrary grids. This extends the results recently obtained for spline spaces of maximal smoothness. The presented error estimates are in agreement with the numerical evidence found in the literature that smoother spline spaces exhibit a better approximation behavior per degree of freedom, even for low smoothness of the functions to be approximated. First we introduce results for univariate spline spaces, and then we address multivariate tensor-product spline spaces and isogeometric spline spaces generated by means of a mapped geometry, both in the single-patch and in the multi-patch case.

math.NA↗
arXiv2019

The optimal convergence rate of monotone schemes for conservation laws in the Wasserstein distance

In 1994, Nessyahu, Tadmor and Tassa studied convergence rates of monotone finite volume approximations of conservation laws. For compactly supported, $\Lip^+$-bounded initial data they showed a first-order convergence rate in the Wasserstein distance. Our main result is to prove that this rate is optimal. We further provide numerical evidence indicating that the rate in the case of $\Lip^+$-unbounded initial data is worse than first-order.

math.NA↗
arXiv2019

Sharp error estimates for spline approximation: explicit constants, $n$-widths, and eigenfunction convergence

In this paper we provide a priori error estimates in standard Sobolev (semi-)norms for approximation in spline spaces of maximal smoothness on arbitrary grids. The error estimates are expressed in terms of a power of the maximal grid spacing, an appropriate derivative of the function to be approximated, and an explicit constant which is, in many cases, sharp. Some of these error estimates also hold in proper spline subspaces, which additionally enjoy inverse inequalities. Furthermore, we address spline approximation of eigenfunctions of a large class of differential operators, with a particular focus on the special case of periodic splines. The results of this paper can be used to theoretically explain the benefits of spline approximation under $k$-refinement by isogeometric discretization methods. They also form a theoretical foundation for the outperformance of smooth spline discretizations of eigenvalue problems that has been numerically observed in the literature, and for optimality of geometric multigrid solvers in the isogeometric analysis context.

math.NA↗
arXiv2018

Approximation in FEM, DG and IGA: A Theoretical Comparison

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 approximation of functions in $H^{p+1}(0,1)$. Our result holds for all practically interesting cases when comparing $\smooth {p-1}$ splines with $\smooth {-1}$ (discontinuous) splines. When comparing $\smooth {p-1}$ splines with $\smooth 0$ splines our proof covers almost all cases for $p\ge 3$, but we can not conclude anything for $p=2$. The results are generalized to the approximation of functions in $H^{q+1}(0,1)$ for $q<p$, to broken Sobolev spaces and to tensor product spaces.

math.NA↗
arXiv2018

Poincar\'e path integrals for elasticity

We propose a general strategy to derive null-homotopy operators for differential complexes based on the Bernstein-Gelfand-Gelfand (BGG) construction and properties of the de Rham complex. Focusing on the elasticity complex, we derive path integral operators $\mathscr{P}$ for elasticity satisfying $\mathscr{D}\mathscr{P}+\mathscr{P}\mathscr{D}=\mathrm{id}$ and $\mathscr{P}^{2}=0$, where the differential operators $\mathscr{D}$ correspond to the linearized strain, the linearized curvature and the divergence, respectively. In general we derive path integral formulas in the presence of defects. As a special case, this gives the classical Ces\`{a}ro-Volterra path integral for strain tensors satisfying the Saint-Venant compatibility condition.

math-ph↗