Related papers: On the complexity of solving initial value problem…

In this work, we consider the initial value problem (IVP) for a system of modified Korteweg-de Vries (mKdV) equations \begin{equation} \begin{cases} \partial_t v + \partial_x^3 v+ \partial_x (v w^2) = 0, \hspace{0.98 cm} v(x,0)=\psi(x),\\…

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

In this paper we present explicit estimate for Lipschitz constant of solution to a problem of calculus of variations. The approach we use is due to Gamkrelidze and is based on the equivalence of the problem of calculus of variations and a…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

We formulate an initial boundary value problem (IBVP) for the vacuum Einstein equations by describing the boundary conditions of a spacetime metric in its associated gauge. This gauge is determined, equivariantly with respect to…

Preconditioned iterative methods for numerical solution of large matrix eigenvalue problems are increasingly gaining importance in various application areas, ranging from material sciences to data mining. Some of them, e.g., those using…

We study the initial value problem '$s\,' = c^{p - 1}, \; c\,' = -s^{p - 1}; \; \; s(0) = 0, \; c(0) = 1$' (both as a real system and as a complex system) for each integer $p > 2$, considering separately the cases '$p$ even' and '$p$ odd'.

The solution $u(t,x,y)$ of the Kadomtsev--Petviashvili I (KPI) equation with given initial data $u(0,x,y)$ belonging to the Schwartz space is considered. No additional special constraints, usually considered in literature, as…

In this paper, we consider the initial value problem for the Einstein-Vlasov-Scalar field equations in temporal gauge, where the initial data are prescribed on two characteristic smooth intersecting hypersurfaces. From a suitable choice of…

A polynomial-time algorithm for 0-1 integer linear programmings has been proposed. This method continues the classic idea of solving ILP with its LP relaxation. The innovation is that every constraint in the LP is reconstructed into a…

We focus on the initial boundary value problem for a general scalar balance law in one space dimension. Under rather general assumptions on the flux and source functions, we prove the well-posedness of this problem and the stability of its…

Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…

In this paper we consider an initial-boundary value problem with a Caputo time derivative of order $\alpha\in(0,1)$. The solution typically exhibits a weak singularity near the initial time and this causes a reduction in the orders of…

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…

We consider an inverse problem of determining a coefficient $p(x)$ of an evolution equation $\sigma\ppp_tu = a(x)\ppp_x^2u - p(x)u$ for $0<x<\ell$ and $0<t<T$, where $\sigma \in \C \setminus \{0\}$, $\ell>0$ and $T>0$ are arbitrarily given.…

We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

A Lax-Oleinik type explicit formula for 1D scalar balance laws has been recently obtained for the pure initial value problem by Adimurthi et al. in [1]. In this article, by introducing a suitable boundary functional, we establish a…

When one wishes to numerically solve an initial value problem, it is customary to rewrite it as an equivalent first-order system to which a method, usually from the class of Runge-Kutta methods, is applied. Directly treating higher-order…

Motivated by the fact that both the classical and quantum description of nature rest on causality and a variational principle, we develop a novel and highly versatile discretization prescription for classical initial value problems (IVPs).…