Related papers: End Cover for Initial Value Problem: Complete Vali…
In this paper, we study the existence of positive solutions of a three-point integral boundary value problem (BVP) for the following second-order differential equation \begin{equation*} \begin{gathered} {u^{\prime \prime }}(t)+\lambda…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
We show that convex-concave Lipschitz stochastic saddle point problems (also known as stochastic minimax optimization) can be solved under the constraint of $(\epsilon,\delta)$-differential privacy with \emph{strong (primal-dual) gap} rate…
The goal in the stochastic vertex cover problem is to obtain an approximately minimum vertex cover for a graph $G^\star$ that is realized by sampling each edge independently with some probability $p\in (0, 1]$ in a base graph $G = (V, E)$.…
We present a finite element algorithm that computes eigenvalues and eigenfunctions of the Laplace operator for two-dimensional problems with homogeneous Neumann or Dirichlet boundary conditions or combinations of either for different parts…
Inverse optimization is the problem of determining the values of missing input parameters for an associated forward problem that are closest to given estimates and that will make a given target vector optimal. This study is concerned with…
We develop numerical algorithms to approximate positive solutions of elliptic boundary value problems with superlinear subcritical nonlinearity on the boundary of the form $-\Delta u + u = 0$ in $\Omega$ with $\frac{\partial u}{\partial…
We present an algorithm which allows to solve analytically linear systems of differential equations which factorize to first order. The solution is given in terms of iterated integrals over an alphabet where its structure is implied by the…
We establish optimal order a priori error estimates for implicit-explicit BDF methods for abstract semilinear parabolic equations with time-dependent operators in a complex Banach space settings, under a sharp condition on the…
Finite-sum optimization has wide applications in machine learning, covering important problems such as support vector machines, regression, etc. In this paper, we initiate the study of solving finite-sum optimization problems by quantum…
This study is concern with the numerical solution of the initial boundary value problem (IBVP) for the semilinear scale-invariant wave equation with damping and mass and power non-linearity. Numerical results of the aforementioned IBVP is…
Given a finite covering by closed convex sets of $B_X$, the unit ball of an infinite-dimensional Banach space, we investigate whether there is a set of the covering that contains balls of radius close to $1$ and (a) arbitrarily high finite…
This work investigates a new approach to find closed form analytical approximate solution of linear initial value problems. Classical Bernoulli polynomials have been used to derive a finite set of orthonormal polynomials and a finite…
We study generalizations of the classical Vertex Cover and Edge Cover problems that incorporate group-wise coverage constraints. Our first focus is the \emph{Weighted Prize-Collecting Partition Vertex Cover} (WP-PVC) problem: given a graph…
This paper addresses the properties of Continuous Interior Penalty (CIP) finite element solutions for the Helmholtz equation. The $h$-version of the CIP finite element method with piecewise linear approximation is applied to a…
In this paper well-posedness is proved for an initial and boundary value problem (IBVP) relative to a large class of quasilinear hyperbolic systems, in $p+q$ equations, on a strip, arising from a model of $H_2O$-phase transitions in the…
Accurate triangulation of the domain plays a pivotal role in computing the numerical approximation of the differential operators. A good triangulation is the one which aids in reducing discretization errors. In a standard collocation…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
As is known, the problems for the differential equations with continuously changing order of the derivatives are not considered completely. In this paper we consider the initial and boundary value problems for this type of linear ordinary…
This paper introduces an approach to decoupling singularly perturbed boundary value problems for fourth-order ordinary differential equations that feature a small positive parameter $\epsilon$ multiplying the highest derivative. We…