Related papers: An arbitrary-order discrete rot-rot complex on pol…
Regularisation allows one to handle ill-posed inverse problems. Here we focus on discrete unfolding problems. The properties of the results are characterised by the consistency between measurements and unfolding result and by the posterior…
Many coupled problems in engineering and science can be described by elliptic partial differential equations on adjacent domains, where the coupling can be considered either as a thin equidimensional overlap between the model domains, or as…
In mixed finite element approximations of Hodge Laplace problems associated with the de Rham complex, the exterior derivative operators are computed exactly, so the spatial locality is preserved. However, the numerical approximations of the…
We develop in this work the first polytopal complexes of differential forms. These complexes, inspired by the Discrete De Rham and the Virtual Element approaches, are discrete versions of the de Rham complex of differential forms built on…
Discrete regularization methods are often applied for obtaining stable approximate solutions for ill-posed operator equations $Tx=y$, where $T: X\to Y$ is a bounded operator between Hilbert spaces with non-closed range $R(T)$ and $y\in…
Direct methods for the simulation of optimal control problems apply a specific discretization to the dynamics of the problem, and the discrete adjoint method is suitable to calculate corresponding conditions to approximate an optimal…
We consider the finite element discretization and the iterative solution of singularly perturbed elliptic reaction-diffusion equations in three-dimensional computational domains. These equations arise from the optimality conditions for…
Group based moving frames have a wide range of applications, from the classical equivalence problems in differential geometry to more modern applications such as computer vision. Here we describe what we call a discrete group based moving…
In the discretization of differential problems on complex geometrical domains, discretization methods based on polygonal and polyhedral elements are powerful tools. Adaptive mesh refinement for such kind of problems is very useful as well…
We present a sampling-based framework for multi-robot motion planning which combines an implicit representation of a roadmap with a novel approach for pathfinding in geometrically embedded graphs tailored for our setting. Our pathfinding…
In this work, we propose a novel formulation for the solution of partial differential equations using finite element methods on unfitted meshes. The proposed formulation relies on the discrete extension operator proposed in the aggregated…
In the framework of virtual element discretizazions, we address the problem of imposing non homogeneous Dirichlet boundary conditions in a weak form, both on polygonal/polyhedral domains and on two/three dimensional domains with curved…
In this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomial on the mesh…
Two de Rham complex sequences of the finite element spaces are introduced for weak finite element functions and weak derivatives developed in the weak Galerkin (WG) finite element methods on general polyhedral elements. One of the sequences…
This paper is devoted to the construction of order reduced method of fourth order problems. A framework is presented such that a problem on a high-regularity space can be deduced in a constructive way to an equivalent problem on three…
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…
In this exploration paper, we design algorithms for deforming and contracting a simply connected discrete closed manifold to a discrete sphere. Such a contraction is a kind of shrinking or reducing process. In our algorithms, we need to…
We devise and analyze hybrid polyhedral methods of arbitrary order for the approximation of div-curl systems on three-dimensional domains featuring non-trivial topology. The div-curl systems we are interested in stem from magnetostatics,…
Motivated by a M\"obius invariant subdivision scheme for polygons, we study a curvature notion for discrete curves where the cross-ratio plays an important role in all our key definitions. Using a particular M\"obius invariant…
We study the discretisation of a uniaxial (rank-one) reduction of the Oldroyd-B model for dilute polymer solutions, in which the conformation tensor is represented as $\sig = \vec b \otimes \vec b$. Building on structural analogies with…