Notes on Computational Graph and Jacobian Accumulation
Symbolic Computation
2021-01-01 v1
Abstract
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these relations and differences, making plain their interconvertibility. By revealing different types of multiplication relations in algebraic expressions and their elimination dependencies in line-graph, we establish a theoretical limit on the efficiency of face elimination.
Cite
@article{arxiv.2012.15034,
title = {Notes on Computational Graph and Jacobian Accumulation},
author = {Yichong Zhou},
journal= {arXiv preprint arXiv:2012.15034},
year = {2021}
}