Related papers: Solution Theory for Systems of Bilinear Equations

We suggest a method of solving the problem of existence of a triangle with prescribed two bisectors and one third element which can be taken as one of the angles, the sides, the heights or the medians, or the third bisector.

Some properties and relations satisfied by the polynomial solutions of the bispectral problem are studied. Given a differential operator, under certain restrictions its polynomial eigenfunctions are explicitly obtained, as well as the…

In this paper, we study the complexity of solving generic over-determined bilinear systems over a finite field $\mathbb{F}$. Given a generic bilinear sequence $B \in \mathbb{F}[\mathbf{x},\mathbf{y}]$, with respect to a partition of…

Using the dbar-problem and dual dbar-problem, we derive bilinear relations which allows us to construct integrable hierarchies in different parametrizations, their Darboux-B\"{a}cklund transformations and to analyze constraints for them ina…

A system of linear equations is normally understood as a linear mapping between two vector spaces. However, most direct solutions (e.g., QR, LU, ...) rely on the inelegant approach of back-substitution: a significant departure from such a…

Various versions of the Dynamical Systems Method (DSM) are proposed for solving linear ill-posed problems with bounded and unbounded operators. Convergence of the proposed methods is proved. Some new results concerning discrepancy principle…

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

We prove that if a linear equation, whose coefficients are continuous rational functions on a nonsingular real algebraic surface, has a continuous solution, then it also has a continuous rational solution. This is known to fail in higher…

In the framework of bidifferential graded algebras, we present universal solution generating techniques for a wide class of integrable systems.

Five equivalence classes had been found for systems of two second-order ordinary differential equations, transformable to linear equations (linearizable systems) by a change of variables. An "optimal (or simplest) canonical form" of linear…

A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happens for instance when the constraint matrix is totally…

How to handle division in systems that compute with logical formulas involving what would otherwise be polynomial constraints over the real numbers is a surprisingly difficult question. This paper argues that existing approaches from both…

We deal with interval parametric systems of linear equations and the goal is to solve such systems, which basically comes down to finding an enclosure for a parametric solution set. Obviously we want this enclosure to be as tight as…

A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…

Sylvester-type matrix equations have applications in areas including control theory, neural networks, and image processing. In this paper, we establish the necessary and sufficient conditions for the system of Sylvester-type quaternion…

In order to nd a non-negative solution to a system of inequalities, the corresponding dual problem is composed, which has a suitable unity basic matrix. In such a formulation, the objective function is replaced by set of constraints based…

The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…

Existence, regularity and location of solutions to quasilinear singular elliptic systems with general gradient dependence are established developing a method of sub-supersolution. The abstract theorems involving sub-supersolutions are…

We study matroidal networks introduced by Dougherty et al. We prove the converse of the following theorem: If a network is scalar-linearly solvable over some finite field, then the network is a matroidal network associated with a…

The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…