相关论文: Direct solution of piecewise linear systems

This paper provides an NP procedure that decides whether a linear-exponential system of constraints has an integer solution. Linear-exponential systems extend standard integer linear programs with exponential terms $2^x$ and remainder terms…

We study the computational complexity of the membership problem for arithmetic circuits over natural numbers with division. We consider different subsets of the operations {intersection,union,complement,+,x,/}, where / is the element-wise…

The Hamiltonian of the $N$-particle Calogero model can be expressed in terms of generators of a Lie algebra for a definite class of representations. Maintaining this Lie algebra, its representations, and the flatness of the Riemannian…

We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*\in\mathbb{R}^{m\times n}$. Algorithmically, the robust matrix…

We consider a nonlinear stochastic partial differential equation (SPDE) in divergence form where the forcing term is a Gaussian noise, that is white in time and colored in space such that the gradient of the solution is H\"older-continuous,…

An algorithm of solution of the Automatic Classification (AC for brevity) problem is set forth in the paper. In the AC problem, it is required to find one or several artitions, starting with the given pattern matrix or dissimilarity,…

An NP-hard problem is considered of intersecting a given set of $n$ straight line segments on the plane with the smallest cardinality set of disks of fixed radii $r>0,$ where the set of segments forms a straight line drawing $G=(V,E)$ of a…

Using the probability theory-based approach, this paper reveals the equivalence of an arbitrary NP-complete problem to a problem of checking whether a level set of a specifically constructed harmonic cost function (with all diagonal entries…

Efficient solutions to NP-complete problems would significantly benefit both science and industry. However, such problems are intractable on digital computers based on the von Neumann architecture, thus creating the need for alternative…

An explicit solution of the stationary one dimensional half-space boundary value problem for the linear Boltzmann equation is presented in the presence of an arbitrarily high constant external field. The collision kernel is assumed to be…

We propose a numerical method for solving high dimensional fully nonlinear partial differential equations (PDEs). Our algorithm estimates simultaneously by backward time induction the solution and its gradient by multi-layer neural…

We introduce a (variation of quadrics) ansatz for constructing explicit, real-valued solutions to broad classes of complex Hessian equations on domains in $\mathbb{C}^{n+1}$ and real Hessian equations on domains in $\mathbb{R}^{n+1}$. In…

Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…

Sparse matrix multiplication is an important component of linear algebra computations. Implementing sparse matrix multiplication on an associative processor (AP) enables high level of parallelism, where a row of one matrix is multiplied in…

Being inspired by phasor analysis in linear circuit theory, and its algebraic counterpart - the AC-(operational)-calculus for sinusoids developed by W. Marten and W. Mathis - we define a complex structure on several spaces of real-valued…

Various control schemes rely on a solution of a convex optimization problem involving a particular robust quadratic constraint, which can be reformulated as a linear matrix inequality using the well-known $\mathcal{S}$-lemma. However, the…

A characteristic feature of differential-algebraic equations is that one needs to find derivatives of some of their equations with respect to time, as part of so called index reduction or regularisation, to prepare them for numerical…

Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at least $k$ vertices is considered long. When $k \le 3$, the…

A symmetric characteristic singular integral equation with two fixed singularities at the endpoints in the class of functions bounded at the ends is analyzed. It reduces to a vector Hilbert problem for a half-disc and then to a vector…

Affine variational inequalities (AVI) are an important problem class that generalize systems of linear equations, linear complementarity problems and optimality conditions for quadratic programs. This paper describes PATHAVI, a…