Related papers: Point Decomposition Problem in Binary Elliptic Cur…
We consider a finite element method for elliptic equation with heterogeneous and possibly high-contrast coefficients based on primal hybrid formulation. A space decomposition as in FETI and BDCC allows a sequential computations of the…
A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an…
Linear Programming (LP) is an important decoding technique for binary linear codes. However, the advantages of LP decoding, such as low error floor and strong theoretical guarantee, etc., come at the cost of high computational complexity…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal…
We consider elliptic systems with superlinear and subcritical boundary conditions and a bifurcation parameter as a multiplicative factor. By combining the rescaling method with degree theory and elliptic regularity theory, we prove the…
We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…
In this article we investigate the existence of a solution to a semilinear, elliptic, partial differential equation with distributional coefficients and data. The problem we consider is a generalization of the Lichnerowicz equation that one…
Techniques are developed for decoupling dissipative differential equations. The approach considered is based upon obtaining a sufficient gap in the time dependent linear portion of the equation that corresponds to the linear variational…
Potentials play an important role in solving boundary value problems for elliptic equations. In the middle of the last century, a potential theory was constructed for a two-dimensional elliptic equation with one singular coefficient. In the…
In this article we study the inverse problem of determining a semilinear term appearing in an elliptic equation from boundary measurements. Our main objective is to develop flexible and general theoretical results that can be used for…
In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm, two-space method, the shifted inverse power method, and the polynomial…
We propose a simple domain decomposition method for $d$-dimensional elliptic PDEs which involves an overlapping decomposition into local subdomain problems and a global coarse problem. It relies on a space-filling curve to create equally…
We study boundary value problems for linear elliptic differential operators of order one. The underlying manifold may be noncompact, but the boundary is assumed to be compact. We require a symmetry property of the principal symbol of the…
Raynaud gave a criterion for a branched $G$-cover of curves defined over a mixed-characteristic discretely valued field $K$ with residue characteristic $p$ to have good reduction in the case of either a three-point cover of $\mathbb{P}^1$…
We introduce the {\it Bipartite Multi-cut} problem. This is a generalization of the {\it st-Min-cut} problem, is similar to the {\it Multi-cut} problem (except for more stringent requirements) and also turns out to be an immediate…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
The inversion problem for rational B\'ezier curves is addressed by using resultant matrices for polynomials expressed in the Bernstein basis. The aim of the work is not to construct an inversion formula but finding the corresponding value…
We study a weakly coupled supercritical elliptic system of the form \begin{equation*} \begin{cases} -\Delta u = |x_2|^\gamma \left(\mu_{1}|u|^{p-2}u+\lambda\alpha |u|^{\alpha-2}|v|^{\beta}u \right) & \text{in }\Omega,\\ -\Delta v =…