English
Related papers

Related papers: Solution Theory for Systems of Bilinear Equations

200 papers

Quasilinear systems with piecewise constant arguments of generalized type are under investigation from the asymptotic point of view. The systems have discontinuous right-hand sides which are identified via a discrete-time map. It is…

Dynamical Systems · Mathematics 2025-03-13 Mehmet Onur Fen , Fatma Tokmak Fen

We explicate a procedure to solve general linear differential equations, which connects the desired solutions to monomials x^m of an appropriate degree m. In the process the underlying symmetry of the equations under study, as well as that…

Mathematical Physics · Physics 2012-05-03 N. Gurappa , Abhijit Sen , Rajneesh Atre , Prasanta K. Panigrahi

The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to…

Data Structures and Algorithms · Computer Science 2013-12-03 Krasimir Yordzhev

Linear Programs (LP) are celebrated widely, particularly so in machine learning where they have allowed for effectively solving probabilistic inference tasks or imposing structure on end-to-end learning systems. Their potential might seem…

Artificial Intelligence · Computer Science 2022-03-30 Matej Zečević , Florian Peter Busch , Devendra Singh Dhami , Kristian Kersting

We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of C. Bender and E. Ben-Naim. We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel…

Classical Analysis and ODEs · Mathematics 2015-05-13 Diego Dominici

A novel method, connecting the space of solutions of a linear differential equation, of arbitrary order, to the space of monomials, is used for exploring the algebraic structure of the solution space. Apart from yielding new expressions for…

Mathematical Physics · Physics 2007-05-23 N. Gurappa , Prasanta K. Panigrahi , T. Shreecharan

Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…

Logic in Computer Science · Computer Science 2023-10-20 Thomas Hader , Daniela Kaufmann , Laura Kovács

We study the existence of singular separable solutions to a class of quasilinear equations with reaction term. In the 2-dim case, we use a dynamical system approach to construct our solutions.

Analysis of PDEs · Mathematics 2007-08-07 Marie-Francoise Bidaut-Veron , Mustapha Jazar , Laurent Veron

A polynomial algorithm is obtained for the NP-complete linear ordering problem.

Computational Complexity · Computer Science 2007-05-23 Givi Bolotashvili

We analyse the problem of solving Boolean equation systems through the use of structure graphs. The latter are obtained through an elegant set of Plotkin-style deduction rules. Our main contribution is that we show that equation systems…

Logic in Computer Science · Computer Science 2025-08-08 Jeroen Keiren , Michel A. Reniers , Tim A. C. Willemse

In this paper estimates for the uniform norm of solutions of parabolic SPDEs are derived. The result is obtained through iteration techniques, motivated by the work of Moser in deterministic settings. As an application of the main result,…

Probability · Mathematics 2016-09-09 Konstantinos Dareiotis , Máté Gerencsér

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…

Computation · Statistics 2018-10-18 Simon Bartels , Jon Cockayne , Ilse C. F. Ipsen , Philipp Hennig

In this paper we consider a class of systems of two coupled real scalar fields in bidimensional spacetime, with the main motivation of studying classical or linear stability of soliton solutions. Firstly, we present the class of systems and…

High Energy Physics - Theory · Physics 2008-11-26 D. Bazeia , J. R. S. Nascimento , R. F. Ribeiro , D. Toledo

We are interested in finding a solution to the tensor complementarity problem with a strong M-tensor, which we call the M-tensor complementarity problem. We propose a lower dimensional linear equation approach to solve that problem. At each…

Optimization and Control · Mathematics 2020-07-28 Dong-Hui Li , Cui-Dan Chen , Hong-Bo Guan

We investigate the presence of localized solutions in models described by a single real scalar field with generalized dynamics. The study offers a method to solve very intricate nonlinear ordinary differential equations, and we illustrate…

High Energy Physics - Theory · Physics 2014-03-17 D. Bazeia , L. Losano , R. Menezes

Polynomial dynamical systems describing interacting particles in the plane are studied. A method replacing integration of a polynomial multi--particle dynamical system by finding polynomial solutions of a partial differential equations is…

Exactly Solvable and Integrable Systems · Physics 2014-07-08 Maria V. Demina , Nikolai A. Kudryashov

The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…

Numerical Analysis · Mathematics 2014-08-26 Federico Poloni

We investigate the conditions under which systems of two differential eigenvalue equations are quasi exactly solvable. These systems reveal a rich set of algebraic structures. Some of them are explicitely described. An exemple of quasi…

High Energy Physics - Theory · Physics 2009-10-22 Y. Brihaye , P. Kosinski

This paper is concerned with linear parameter-dependent systems and considers the notion uniform ensemble reachability. The focus of this work is on constructive methods to compute suitable parameter-independent open-loop inputs for such…

Optimization and Control · Mathematics 2023-06-16 Michael Schönlein

A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.

Computational Complexity · Computer Science 2008-02-03 Donald E. Knuth