Novel algebras for advanced analytics in Julia
A linear algebraic approach to graph algorithms that exploits the sparse adjacency matrix representation of graphs can provide a variety of benefits. These benefits include syntactic simplicity, easier implementation, and higher performance. One way to employ linear algebra techniques for graph algo...
Main Authors: | Shah, Viral B., Karpinski, Stefan, Edelman, Alan, Bezanson, Jeffrey Werner, Kepner, Jeremy |
---|---|
Other Authors: | Lincoln Laboratory |
Format: | Article |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2018
|
Online Access: | http://hdl.handle.net/1721.1/115964 https://orcid.org/0000-0001-7676-3133 |
Similar Items
-
Julia: A Fresh Approach to Numerical Computing
by: Karpinski, Stefan, et al.
Published: (2017) -
Array Operators Using Multiple Dispatch: A design methodology for array implementations in dynamic languages
by: Chen, Jiahao, et al.
Published: (2015) -
Julia : an efficient dynamic language for technical computing
by: Bezanson, Jeffrey Werner
Published: (2012) -
Julia implementation of the Dynamic Distributed Dimensional Data Model
by: Chen, Alexander Y., et al.
Published: (2018) -
Circuitscape in Julia: Empowering Dynamic Approaches to Connectivity Assessment
by: Hall, Kimberly R., et al.
Published: (2021)