Related papers: Finite gap integration of a discrete Euler top
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional…
This paper considers the implicit Euler discretization of Levant's arbitrary order robust exact differentiator in presence of sampled measurements. Existing implicit discretizations of that differentiator are shown to exhibit either…
We construct a method to fair a given discrete planar curve by using the integrable discrete analogue of Euler's elastica, which is a discrete version of the approximation algorithm presented by D. Brander, et al. We first give a brief…
We apply the concept of Asymptotic Preserving (AP) schemes to the linearized p-system and discretize the resulting elliptic equation using standard continuous Finite Elements instead of Finite Differences. The fully discrete method is…
The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…
A discretisation scheme that preserves topological features of a physical problem is extended so that differential geometric structures can be approximated in a consistent way thus giving access to the study of physical systems which are…
There has been significant recent progress on algorithms for approximating graph spanners, i.e., algorithms which approximate the best spanner for a given input graph. Essentially all of these algorithms use the same basic LP relaxation, so…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
We investigate the convergence of the primal-dual algorithm for composite optimization problems when the objective functions are weakly convex. We introduce a modified duality gap function, which is a lower bound of the standard duality gap…
We use a recently proposed scheme of matrix extension of dispersionless integrable systems for the Abelian case, in which it leads to linear equations, connected with the initial dispersionless system. In the examples considered, these…
For the elliptic Gaudin model (a degenerate case of XYZ integrable spin chain) a separation of variables is constructed in the classical case. The corresponding separated coordinates are obtained as the poles of a suitably normalized…
A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…
In this work, we present a new approach to the construction of variational integrators. In the general case, the estimation of the action integral in a time interval $[q_k,q_{k+1}]$ is used to construct a symplectic map $(q_k,q_{k+1})\to…
Viewing optimization methods as numerical integrators for ordinary differential equations (ODEs) provides a thought-provoking modern framework for studying accelerated first-order optimizers. In this literature, acceleration is often…
Initial results from new calculations of interacting anti-parallel Euler vortices are presented with the objective of understanding the origins of singular scaling presented by Kerr (1993) and the lack thereof by Hou and Li (2006). Core…
Stratified fluids composed of a sequence of alternate layers show interesting macroscopic properties, which may be quite different from those of the individual constituent fluids. On a macroscopic scale, such systems can be considered a…
In this work, new theoretical results on functional type a posteriori estimates for elliptic optimal control problems with control constraints are presented. More precisely, we derive new, sharp, guaranteed and fully computable lower bounds…
Problems that require the parameterization of closed contours arise frequently in computer vision applications. This article introduces a new curve parameterization algorithm that is able to fit a closed curve to a set of points while being…
In this paper we suggest a method for constructing minimal Lagrangian immersions of $R^2$ in $CP^2$ with induced diagonal metric in terms of Baker-Akhiezer functions of algebraic curves.
We present a continuous finite element method for some examples of fully nonlinear elliptic equation. A key tool is the discretisation proposed in Lakkis & Pryer (2011, SISC) allowing us to work directly on the strong form of a linear PDE.…