Related papers: On the complexity of solving initial value problem…
This work deals with the problem of choosing a time step for the numerical solution of boundary value problems for parabolic equations. The problem solution is derived using the fully implicit scheme, whereas a time step is selected via…
We compute the exact value of the squared condition number for the polynomial eigenvalue problem, when the input matrices have entries coming from the standard complex Gaussian distribution, showing that in general this problem is quite…
A method of calculating probability values from a system of marginal constraints is presented. Previous systems for finding the probability of a single attribute have either made an independence assumption concerning the evidence or have…
This paper deals with a priori pointwise error estimates for the finite element solution of boundary value problems with Neumann boundary conditions in polygonal domains. Due to the corners of the domain, the convergence rate of the…
The construction of initial conditions of an iterative method is one of the most important problems in solving nonlinear equations. In this paper, we obtain relationships between different types of initial conditions that guarantee the…
This article considers the spatially inhomogeneous, non-cutoff Boltzmann equation. We construct a large-data classical solution given bounded, measurable initial data with uniform polynomial decay of mild order in the velocity variable. Our…
Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers…
We consider initial value problems for differential-algebraic equations in a possibly infinite-dimensional Hilbert space. Assuming a growth condition for the associated operator pencil, we prove existence and uniqueness of solutions for…
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/\epsilon), where…
In this paper, we study the initial value problem of the Navier-Stokes equations in the half-space. Let a solenoidal initial velocity be given in the function space $ \dot{B}_{pq,0}^{\alpha-\frac{2}{2}}({\mathbb R}^n_+)$ for $\alpha +1 =…
The purpose of this paper is to study well-posedness of the initial value problem (IVP) for the inhomogeneous nonlinear Schr\"odinger equation (INLS) $$ i u_t +\Delta u+\lambda|x|^{-b}|u|^\alpha u = 0, $$ where $\lambda=\pm 1$ and $\alpha$,…
The trigonometric moment problem arises from the study of one-parameter families of centers in polynomial vector fields. It asks for the classification of the trigonometric polynomials $Q$ which are orthogonal to all powers of a…
In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm…
We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solution of size $k$ can be extended into a partial solution of…
MAP is the problem of finding a most probable instantiation of a set of variables in a Bayesian network given some evidence. Unlike computing posterior probabilities, or MPE (a special case of MAP), the time and space complexity of…
This paper is concerned with the initial-boundary value problem on the full Euler-Poisson system for ions over a half line. We establish the existence of stationary solutions under the Bohm criterion similar to the isentropic case and…
We prove that the KP-I initial-value problem \begin{eqnarray*} \begin{cases} \partial_tu+\partial_x^3u-\partial_x^{-1}\partial_y^2u+\partial_x(u^2/2)=0 {on}{\R}^2_{x,y}\times {\R}_t; u(x,y,0)=\phi(x,y), \end{cases} \end{eqnarray*} is…
The paper considers a boundary value problem for the high-order Lavrent'ev-Bitsadze equation. Necessary and sufficient conditions for the uniqueness of the solution are found. When substantiating the existence, the problem of "small…
We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP01). BQP01 has numerous applications and the problem is known…
We study from the proof complexity perspective the (informal) proof search problem: Is there an optimal way to search for propositional proofs? We note that for any fixed proof system there exists a time-optimal proof search algorithm.…