Related papers: Space Hardness of Solving Structured Linear System…
We study the design of polylogarithmic depth algorithms for approximately solving packing and covering semidefinite programs (or positive SDPs for short). This is a natural SDP generalization of the well-studied positive LP problem.…
We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other…
We study nearly-linear time approximation algorithms for non-preemptive scheduling problems in two settings: the unrelated machine setting, and the identical machine with job precedence constraints setting, under the well-studied objectives…
This paper studies the problem of testing whether a system of linear equality and inequality constraints admits a solution when the coefficients of that system may have to be estimated. We show that a wide range of inferential questions in…
The fastest known algorithms for dealing with structured matrices, in the sense of the displacement rank measure, are randomized. For handling classical displacement structures, they achieve the complexity bounds…
This paper considers the problem of testing whether there exists a non-negative solution to a possibly under-determined system of linear equations with known coefficients. This hypothesis testing problem arises naturally in a number of…
We study \emph{sublinear} algorithms that solve linear systems locally. In the classical version of this problem the input is a matrix $S\in \mathbb{R}^{n\times n}$ and a vector $b\in\mathbb{R}^n$ in the range of $S$, and the goal is to…
We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…
We establish the solvability of second order divergence type parabolic systems in Sobolev spaces. The leading coefficients are assumed to be only measurable in one spatial direction on each small parabolic cylinder with the spatial…
Since Harrow, Hassidim, and Lloyd (2009) showed that a system of linear equations with $N$ variables and condition number $\kappa$ can be solved on a quantum computer in $\operatorname{poly}(\log(N), \kappa)$ time, exponentially faster than…
An abstract construction of coarse spaces for non-Hermitian problems and non-Hermitian domain decomposition preconditioners based on extended generalized eigenproblems was proposed in [Nataf and Parolin, arXiv:2404.02758] and analyzed on…
In the present paper we study the existence of solutions for some classes of singular systems involving the p(x) and q(x) Laplacian operators. The approach is based on bifurcation theory and subsupersolution method for systems of…
We consider the solution of systems of linear algebraic equations (SLAEs) with an ill-conditioned or degenerate exact matrix and an approximate right-hand side. An approach to solving such a problem is proposed and justified, which makes it…
Certain many-particle Hardy inequalities are derived in a simple and systematic way using the so-called ground state representation for the Laplacian on a subdomain of $\mathbb{R}^n$. This includes geometric extensions of the standard Hardy…
We consider the linear elliptic systems or equations in divergence form with periodically oscillating coefficients. We prove the large-scale boundary Lipschitz estimate for the weak solutions in domains satisfying the so-called…
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific…
In this paper, the concept of matrix splitting is introduced to solve a large sparse ill-posed linear system via Tikhonov's regularization. In the regularization process, we convert the ill-posed system to a well-posed system. The…
Low-rank tensor approximation techniques attempt to mitigate the overwhelming complexity of linear algebra tasks arising from high-dimensional applications. In this work, we study the low-rank approximability of solutions to linear systems…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…