Memristor models for SPICE simulation of extremely large memristive networks

In order to avoid non-convergence and other numerical problems associated with the simulation of extremely large memristive networks, suitable models of the individual memristors need to be developed. A circuit containing thousands of memristors for finding the shortest path in a complicated maze is a typical example of a numerically challenging simulation. A benchmark circuit for testing the applications of various complexities is used for the transient analysis. It is shown that various commonly used models, from simple behavioral to Pickett models, require special modifications for minimizing the simulation time and improving the convergence issue.