Neural Acceleration of Graph Based Utility Functions for Sparse Matrices
Many graph-based algorithms in high performance computing (HPC) use approximate solutions due to having algorithms that are computationally expensive or serial in nature. Neural acceleration, i.e., the process of speeding up approximation computation elements via artificial neural networks, is relat...
Main Authors: | Joshua Dennis Booth, Gregory S. Bolet |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10082918/ |
Similar Items
-
Computational methods for general sparse matrices /
by: 261477 Zlatev, Zahari
Published: (1991) -
Direct methods for sparse linear systems /
by: 237171 Davis, Timothy A.
Published: (2006) -
Linear equations and matrices /
by: 388937 Bolton, William Charles
Published: (1995) -
Introduction to matrices and linear transformations /
by: 314367 Finkbeiner, Daniel Talbot
Published: (1960) -
Introduction to matrices and linear transformations /
by: 314367 Finkbeiner, Daniel Talbot
Published: (1978)