Memristive Linear Algebra
Jonathan Lin, Frank Barrows, Francesco Caravelli

TL;DR
This paper explores how memristive devices can be used to perform efficient, scalable analog linear algebra operations like matrix inversion, highlighting advantages and addressing practical challenges.
Contribution
It introduces memristive crossbar-based algorithms for matrix inversion, demonstrating their potential to reduce complexity and power consumption over digital methods.
Findings
Memristive arrays significantly reduce computational complexity.
Analog in-memory computing offers advantages over digital methods.
Addressed device variability and scalability challenges.
Abstract
The advent of memristive devices offers a promising avenue for efficient and scalable analog computing, particularly for linear algebra operations essential in various scientific and engineering applications. This paper investigates the potential of memristive crossbars in implementing matrix inversion algorithms. We explore both static and dynamic approaches, emphasizing the advantages of analog and in-memory computing for matrix operations beyond multiplication. Our results demonstrate that memristive arrays can significantly reduce computational complexity and power consumption compared to traditional digital methods for certain matrix tasks. Furthermore, we address the challenges of device variability, precision, and scalability, providing insights into the practical implementation of these algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
