Related papers: Hardness Results for Structured Linear Systems
We build convergent discretizations and semi-implicit solvers for the Infinity Laplacian and the game theoretical $p$-Laplacian. The discretizations simplify and generalize earlier ones. We prove convergence of the solution of the Wide…
In this work we deal with the class of nonlinear (p,q)-Laplacian system. Non-existence results of positive weak solutions for this system are established.
This paper studies linear classes of planar quasiregular mappings. We give a positive answer to a conjecture of K. Astala, T. Iwaniec, and G. Martin (2009) on reduced Beltrami equations. Moreover, we use it to prove a Wronsky-type theorem…
We present iterative solvers to approximate the solution of numerical schemes for stochastic Stefan problems. After briefly talking about the convergence results, we tackle the question of efficient strategies for solving the nonlinear…
The paper concerns the solvability by quadratures of linear differential systems, which is one of the questions of differential Galois theory. We consider systems with regular singular points as well as those with (non-resonant) irregular…
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…
We study a class of linearly coupled system of quasilinear equations. Under some assumptions on the nonlinear terms, we establish some results about the existence and regularity of vector solutions for the p-Laplacian systems by using…
Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…
Two families of symplectic methods specially designed for second-order time-dependent linear systems are presented. Both are obtained from the Magnus expansion of the corresponding first-order equation, but otherwise they differ in…
We present a randomized linear-space solver for general linear systems $\mathbf{A} \mathbf{x} = \mathbf{b}$ with $\mathbf{A} \in \mathbb{Z}^{n \times n}$ and $\mathbf{b} \in \mathbb{Z}^n$, without any assumption on the condition number of…
We present a complete reimplementation of the LinearSystem package of Magma, with substantial improvements in design and performance. The resulting efficiency enables computations that were previously out of reach. We briefly describe the…
The existence of a positive entire weak solution to a singular quasi-linear elliptic system with convection terms is established, chiefly through perturbation techniques, fixed point arguments, and a priori estimates. Some regularity…
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a $p$-adic lifting technique combined with the use of block matrices with structured blocks. It achieves a sub-cubic…
We describe a nearly-linear time algorithm to solve the linear system $L_1x = b$ parameterized by the first Betti number of the complex, where $L_1$ is the 1-Laplacian of a simplicial complex $K$ that is a subcomplex of a collapsible…
In [7], a new iterative method for solving linear system of equations was presented which can be considered as a modification of the Gauss-Seidel method. Then in [4] a different approach, say 2D-DSPM, and more effective one was introduced.…
Several recent works have developed a new, probabilistic interpretation for numerical algorithms solving linear systems in which the solution is inferred in a Bayesian framework, either directly or by inferring the unknown action of the…
We prove doubling inequalities for solutions of elliptic systems with an iterated Laplacian as diagonal principal part and for solutions of the Lame' system of isotropic linearized elasticity. These inequalities depend on global properties…
Discretizations of infinite-dimensional variational inequalities lead to linear and nonlinear complementarity problems with many degrees of freedom. To solve these problems in a parallel computing environment, we propose two active-set…
In this paper we aim to show continuous differentiability of weak solutions to a one-Laplace system perturbed by $p$-Laplacian with $1<p<\infty$. The main difficulty on this equation is that uniform ellipticity breaks near a facet, the…
We present a fast direct solver for structured linear systems based on multilevel matrix compression. Using the recently developed interpolative decomposition of a low-rank matrix in a recursive manner, we embed an approximation of the…