Related papers: High-Order Continuous Geometrical Validity
Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…
We study the problem of synthesizing polyhedral Lyapunov functions for hybrid linear systems. Such functions are defined as convex piecewise linear functions, with a finite number of pieces. We first prove that deciding whether there exists…
This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like…
A proof of convergence is given for a novel evolving surface finite element semi-discretization of Willmore flow of closed two-dimensional surfaces, and also of surface diffusion flow. The numerical method proposed and studied here…
This article discusses the search procedure for the Poincar\'e recurrences to classify solutions on an attractor of a fourth-order nonlinear dynamical system using a previously developed high-precision numerical method. For the resulting…
Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and…
We present a real-time algorithm that finds the Penetration Depth (PD) between general polygonal models based on iterative and local optimization techniques. Given an in-collision configuration of an object in configuration space, we find…
This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…
It is shown in this paper that non-conforming finite elements on the triangle using $P^{1}$-nonconforming polynomials and $P^{2}$ -conforming polynomials can be easily built and used.They appear as an 'enriched' version of the standard…
We devise and analyze two hybrid high-order (HHO) methods for the numerical approximation of the biharmonic problem. The methods support polyhedral meshes, rely on the primal formulation of the problem, and deliver $O(h^{k+1})$ $H^2$-error…
We present a method to decompose a set of multivariate real polynomials into linear combinations of univariate polynomials in linear forms of the input variables. The method proceeds by collecting the first-order information of the…
We develop a new method for equality constrained optimization problems based on a sequential cubic programming framework. Each iteration utilizes a step decomposition based on the Jacobian of the constraints into a normal and a tangential…
We consider the geometric numerical integration of Hamiltonian systems subject to both equality and "hard" inequality constraints. As in the standard geometric integration setting, we target long-term structure preservation. We…
We initiate the design and the analysis of stabilization-free Virtual Element Methods for the laplacian problem written in mixed form. A Virtual Element version of the lowest order Raviart-Thomas Finite Element is considered. To reduce the…
This paper presents a new and efficient numerical algorithm for the biharmonic equation by using weak Galerkin (WG) finite element methods. The WG finite element scheme is based on a variational form of the biharmonic equation that is…
Building on existing $hp$-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329--366] and the references therein, we propose a novel $h$-adaptive algorithm for a fixed polynomial…
A crucial step in the analysis of persistent homology is the transformation of data into an appropriate topological object (in our case, a simplicial complex). Modern packages for persistent homology often construct Vietoris--Rips or other…
A refined a priori error analysis of the lowest order (linear) Virtual Element Method (VEM) is developed for approximating a model two dimensional Poisson problem. A set of new geometric assumptions is proposed on shape regularity of…
We propose a novel a posteriori error estimator for conforming finite element discretizations of two- and three-dimensional Helmholtz problems. The estimator is based on an equilibrated flux that is computed by solving patchwise mixed…
In this work, we analyze the finite element method with arbitrary but fixed polynomial degree for the nonlinear Helmholtz equation with impedance boundary conditions. We show well-posedness and error estimates of the finite element solution…