Pixel matrices: An elementary technique for solving nonlinear systems

  title={Pixel matrices: An elementary technique for solving nonlinear systems},
  author={David I. Spivak and Dominique Ernadote and Omar Hammammi},
  journal={2016 IEEE International Symposium on Systems Engineering (ISSE)},
A new technique for approximating the entire solution set, in any bounding box, for a nonlinear system of relations (nonlinear equations, inequalities, etc. involving algebraic, smooth, or even continuous functions) is presented. The technique is to first plot each function as a pixel matrix, and to then perform a sequence of basic matrix operations, as dictated by how variables are shared by the relations in the system. The result is a pixel matrix graphing the approximated simultaneous… 

Figures from this paper

Compositional Models for Power Systems
Considering the problem of distributing power on the grid in the presence of DERs, it is shown how to connect a generic problem specification with implementation-specific numerical solvers using the paradigm of categorical databases.
Fault Line Selection of Distribution Network Based on Modified CEEMDAN and GoogLeNet Neural Network
Aiming at the difficulty of single-phase grounding fault line selection in a small current grounding system, a distribution network fault line selection method based on modified CEEMDAN and


Solving systems of nonlinear polynomial equations faster
This paper considers projective problems, that is, the polynomials are homogeneous and the solutions are sought in n-dimensional projective space, and shows that the solutions of an affine system are specializations of the solution rays of its homogenized projective version.
A nonsmooth version of Newton's method
It is shown that the gradient function of the augmented Lagrangian forC2-nonlinear programming is semismooth, and the extended Newton's method can be used in the augmentedlagrangian method for solving nonlinear programs.
Practical quasi-Newton methods for solving nonlinear systems
The steady states of coupled dynamical systems compose according to matrix arithmetic
Open dynamical systems are mathematical models of machines that take input, change their internal state, and produce output. For example, one may model anything from neurons to robots in this way.
Matrix multiplication via arithmetic progressions
A new method for accelerating matrix multiplication asymptotically is presented, by using a basic trilinear form which is not a matrix product, and making novel use of the Salem-Spencer Theorem.
Introduction to mathematical systems theory: a behavioral approach, Texts in Applied Mathematics 26
This is a book about modelling, analysis, and control of linear time-invariant systems that are represented by systems of linear constant coefficient differential equations and uses what is called the behavioral approach towards mathematical modelling.
Polynomials in one variable Grobner bases of zero-dimensional ideals Bernstein's theorem and fewnomials Resultants Primary decomposition Polynomial systems in economics Sums of squares Polynomial
Optimizing Sparse Matrix—Matrix Multiplication for the GPU
The implementation is fully general and the optimization strategy adaptively processes the SpGEMM workload row-wise to substantially improve performance by decreasing the work complexity and utilizing the memory hierarchy more effectively.
Category Theory Based Solution for the Building Block Replacement Problem in Materials Design
An important objective in materials design is to develop a systematic methodology for replacing unavailable or expensive material building blocks by simpler and abundant ones, while maintaining or
Understanding the efficiency of GPU algorithms for matrix-matrix multiplication
An in-depth analysis of dense matrix-matrix multiplication, which reuses each element of input matrices O(n) times, finds even near-optimal GPU implementations are pronouncedly less efficient than current cache-aware CPU approaches.