| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
08 February 2025 |
|
| | | |
|
Article overview
| |
|
Pixel Arrays: A fast and elementary method for solving nonlinear systems | David I. Spivak
; Magdalen R. C. Dobson
; Sapna Kumari
; | Date: |
1 Sep 2016 | Abstract: | We present a new method, called the Pixel Array method, for approximating all
solutions in a bounding box, for an arbitrary nonlinear system of relations. In
contrast with other solvers, our approach requires the user must specify which
variables are to be exposed, and which are to be left latent. The entire
solution set is then obtained---in terms of these exposed variables---by
performing a series of array multiplications on the $n_i$-dimensional plots of
the individual relations $R_i$. This procedure introduces no false negatives
and is much faster than Newton-based solvers. The key is the unexposed
variables, which Newton methods can make no use of. In fact, we found that with
even a single unexposed variable our system was more than 10x faster than
Julia’s NLsolve. The basic idea of the pixel array method is quite elementary,
and the purpose of this article is to give a complete account of it. | Source: | arXiv, 1609.0061 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|