Related papers: End Cover for Initial Value Problem: Complete Vali…
We consider the Generalized Bin Covering (GBC) problem: We are given $m$ bin types, where each bin of type $i$ has profit $p_i$ and demand $d_i$. Furthermore, there are $n$ items, where item $j$ has size $s_j$. A bin of type $i$ is covered…
Due to its highly oscillating solution, the Helmholtz equation is numerically challenging to solve. To obtain a reasonable solution, a mesh size that is much smaller than the reciprocal of the wavenumber is typically required (known as the…
In this paper, we propose an unconstrained framework for eigenvalue problems in both discrete and continuous settings. We begin our discussion to solve a generalized eigenvalue problem $A{\bf x} = \lambda B{\bf x}$ with two $N\times N$ real…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
We improve Izumi's inequality, which states that any divisorial valuation v centered at a closed point 0 on an algebraic variety Y is controlled by the order of vanishing at 0. More precisely, as v ranges through valuations that are…
The minimum linear ordering problem (MLOP) generalizes well-known combinatorial optimization problems such as minimum linear arrangement and minimum sum set cover. MLOP seeks to minimize an aggregated cost $f(\cdot)$ due to an ordering…
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…
In this article, we have interested the study of the existence and uniqueness of positive solutions of the first-order nonlinear Hilfer fractional differential equation \begin{equation*} D_{0^{+}}^{\alpha ,\beta }y(t)=f(t,y(t)),\text{…
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…
Finite difference schemes, using Backward Differentiation Formula (BDF), are studied for the approximation of one-dimensional diffusion equations with an obstacle term, of the form $$\min(v_t - a(t,x) v_{xx} + b(t,x) v_x + r(t,x) v, v-…
In this paper, we give an algorithm for finding general rational solutions of a given first-order ODE with parametric coefficients that occur rationally. We present an analysis, complete modulo Hilbert's irreducibility problem, of the…
The so-called unified method expresses the solution of an initial-boundary value problem (IBVP) for an evolution PDE in the finite interval in terms of an integral in the complex Fourier (spectral) plane. Simple IBVP, which will be referred…
This paper deals with the \emph{integral} version of the Dirichlet homogeneous fractional Laplace equation. For this problem weighted and fractional Sobolev a priori estimates are provided in terms of the H\"older regularity of the data. By…
We study initial value problems having dynamics ruled by discontinuous ordinary differential equations with the property of possessing a unique solution. We identify a precise class of such systems that we call solvable intitial value…
We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i.e.\ problems where the cost of evaluating/enforcing of the (possibly nonconvex or even disconnected)…
Due to challenging applications such as collaborative filtering, the matrix completion problem has been widely studied in the past few years. Different approaches rely on different structure assumptions on the matrix in hand. Here, we focus…
In this paper the simplest singular boundary problem of Dirichlet type for linear differential equation of the first order of general form is considered. The main result of this paper is criterion of correct solvability of above problem in…
A fundamental problem in program verification concerns the termination of simple linear loops of the form x := u ; while Bx >= b do {x := Ax + a} where x is a vector of variables, u, a, and c are integer vectors, and A and B are integer…
We propose a Bernoulli phase-fitted (BPF) finite difference method for the Helmholtz equation on the interval $(0, L)$ with impedance boundary conditions. The scheme is derived from a complexified Scharfetter--Gummel discretization of the…
In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming…