Related papers: The solution to the initial value problem for the …
The Somos 5 sequences are a family of sequences defined by a fifth order bilinear recurrence relation with constant coefficients. For particular choices of coefficients and initial data, integer sequences arise. By making the connection…
We present a stable and convergent method for solving initial value problems based on the use of differentiation matrices obtained by Lagrange interpolation. This implicit multistep-like method is easy-to-use and performs pretty well in the…
We consider the Euler equations of incompressible fluids and attempt to solve the initial value problem with the help of a concave maximization problem.We show that this problem, which shares a similar structure with the optimal transport…
A new approach for integration of the initial value problem for ordinary differential equations is suggested. The algorithm is based on approximation of the solution by a system of functions that contains orthogonal exponential polynomials.
Motivated by the search for an appropriate notion of a cluster superalgebra, incorporating Grassmann variables, Ovsienko and Tabachnikov considered the extension of various recurrence relations with the Laurent phenomenon to the ring of…
We study the ultradiscrete analogue of Lax pair proposed by Willox et al. This "pair" is a max-plus linear system comprising four equations. Our starting point is to treat this system as a combination of two max-plus eigenproblems, with two…
The explicit solution of the initial-values problem is exhibited of a subclass of the autonomous system of 2 coupled first-order ODE s with second-degree polynomial right-hand sides, hence featuring 12 a prior arbitrary (time-independent)…
Combinatorial expressions are presented to the solutions to initial value problems of the discrete and ultradiscrete Toda molecules. For the discrete Toda molecule, a subtraction-free expression of the solution is derived in terms of…
We develop the max-plus finite element method to solve finite horizon deterministic optimal control problems. This method, that we introduced in a previous work, relies on a max-plus variational formulation, and exploits the properties of…
We propose the functions defined by the maximum of a discrete quadratic form and satisfying the ultradiscrete KdV equation. These functions includes not only soliton solutions but also pseudo-periodic solutions. In the proof, we employ some…
We propose a novel methodology for solving a two-stage adjustable robust convex optimisation problem with a general (proximable) convex objective function and constraints defined by sum-of-squares (SOS) convex polynomials. These problems…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
Polynomial optimization problems represent a wide class of optimization problems, with a large number of real-world applications. Current approaches for polynomial optimization, such as the sum of squares (SOS) method, rely on large-scale…
In this work, we study the problem of finding approximate, with minimum support set, solutions to matrix max-plus equations, which we call sparse approximate solutions. We show how one can obtain such solutions efficiently and in polynomial…
We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…
In this paper, both semidiscrete and completely discrete finite volume element methods (FVEMs) are analyzed for approximating solutions of a class of linear hyperbolic integro- differential equations in a two-dimensional convex polygonal…
We present the results from our earlier paper (arXiv:math/0602484) on the affine normal flow on noncompact convex hypersurfaces in affine space from a more PDE point of view, emphasizing the estimates involved. Our results concern the…
We provide an elementary proof to a conjecture by Robinson that multiples of (powers of) primes in the Somos-4 sequence are equally spaced. We also show, almost as a corollary, for the generalised Somos-4 sequence defined by…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…
We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…