English
Related papers

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

200 papers

In the recent paper arXiv:0710.4085 was shown that any solution of "the polynomial moment problem", which asks to describe polynomials Q orthogonal to all powers of a given polynomial P on a segment, may be obtained as a sum of some…

Dynamical Systems · Mathematics 2010-06-28 F. Pakovich

This paper investigates the initial value problem for a system of one-dimensional fourth-order dispersive partial differential-integral equations with nonlinearity involving derivatives up to second order. Examples of the system arise in…

Analysis of PDEs · Mathematics 2024-07-29 Eiji Onodera

We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and…

Optimization and Control · Mathematics 2017-01-03 Matthias Köppe , Maurice Queyranne , Christopher Thomas Ryan

An initial-boundary value problem for a time-fractional subdiffusion equation with the Riemann-Liouville derivatives on N-dimensional torus is considered. The uniqueness and existence of the classical solution of the posed problem are…

Analysis of PDEs · Mathematics 2021-05-18 Ravshan Ashurov , Oqila Muhiddinova

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

Optimization and Control · Mathematics 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…

Logic · Mathematics 2023-10-16 Ivan V. Latkin

A high precision, and space time fully decoupled, wavelet formulation numerical method is developed for a class of nonlinear initial boundary value problems. This method is established based on a proposed Coiflet based approximation scheme…

Numerical Analysis · Mathematics 2017-01-24 Jizeng Wang , Lei Zhang , You-He Zhou

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski , J. F. Voloch

In this paper, we investigate some special regularities and decay properties of solutions to the initial value problem(IVP) of the Benjamin equation. The main result shows that: for initial datum $u_{0}\in H^{s}(\mathbb{R})$ with $s>3/4,$…

Analysis of PDEs · Mathematics 2018-08-15 Boling Guo , Guoquan Qin

In this paper, we investigate the well-posedness and the long-time asymptotic behavior for the initial-boundary value problem for multi-term time-fractional diffusion equations, where the time differentiation consists of a finite summation…

Analysis of PDEs · Mathematics 2023-01-02 Zhiyuan Li , Yikan Liu , Masahiro Yamamoto

We show that the so called Robinson-Trautman-Maxwell equations do not constitute a well posed initial value problem. That is, the dependence of the solution on the initial data is not continuous in any norm built out from the initial data…

General Relativity and Quantum Cosmology · Physics 2008-11-26 Carlos Kozameh , Oscar Reula , Heinz-Otto Kreiss

It is shown that graph-theoretic problem CLIQUE can't be solved in polynomial time by any deterministic TM. This upgrades the well-known partial result that claims only monotone unsolvability thereof, and eventually implies P $\neq$ NP as…

Computational Complexity · Computer Science 2026-05-14 Lev Gordeev

We discuss existence, non-uniqueness and regularity of one- and two-sided solutions of initial value problems for scalar quasi-linear ordinary differential equations where the initial condition corresponds to an impasse point of the…

Dynamical Systems · Mathematics 2020-08-24 Werner M. Seiler , Matthias Seiss

For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient…

Logic · Mathematics 2020-12-03 Manuel Bodirsky , Johannes Greiner

This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…

Optimization and Control · Mathematics 2026-03-24 Samuel Awoniyi

The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…

Mathematical Physics · Physics 2008-11-18 D H Gebremedhin , C A Weatherford , X Zhang , A Wynn , G Tanaka

We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential…

Computational Complexity · Computer Science 2017-01-18 Olivier Bournez , Daniel S. Graça , Amaury Pouly

Results about existence and uniqueness of solutions of initial value problem for certain types of partial differential equations are recalled as well as iterative scheme and an error estimate for approximate solutions obtained using this…

Numerical Analysis · Mathematics 2016-02-23 Josef Rebenda , Zdeněk Šmarda

In this work we consider the initial value problem (IVP) associated to the Ostrovsky equations $$\left. \begin{array}{rl} u_t+\partial_x^3 u\pm \partial_x^{-1}u +u \partial_x u &\hspace{-2mm}=0,\qquad\qquad x\in\mathbb R,\; t\in\mathbb R,\\…

Analysis of PDEs · Mathematics 2016-03-03 Eddye Bustamante , José Jiménez Urrea , Jorge Mejía

In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…

Optimization and Control · Mathematics 2022-11-24 Divya Padmanabhan , Selin Damla Ahipasaoglu , Arjun Ramachandra , Karthik Natarajan