Fully analog memristive circuits for optimization tasks: a comparison
arXiv:2009.00758 · doi:10.1142/9789811235740_0007
Abstract
We introduce a Lyapunov function for the dynamics of memristive circuits, and compare the effectiveness of memristors in minimizing the function to widely used optimization software. We study in particular three classes of problems which can be directly embedded in a circuit topology, and show that memristors effectively attempt at (quickly) extremizing these functionals.
18 pages, invited book chapter for A. Adamatzky's book "Alternative Computing"
References in corpus (5)
- Memcomputing: a computing paradigm to store and process information on the same physical platform
- Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states
- The complex dynamics of memristive circuits: analytical results and universal slow relaxation
- Locality of interactions for planar memristive circuits
- Asymptotic behavior of memristive circuits