High-performance symbolic-numerics via multiple dispatch

Abstract

As mathematical computing becomes more democratized in high-level languages, high-performance symbolic-numeric systems are necessary for domain scientists and engineers to get the best performance out of their machine without deep knowledge of code optimization. Naturally, users need different term types either to have different algebraic properties for them, or to use efficient data structures. To this end, we developed Symbolics.jl, an extendable symbolic system which uses dynamic multiple dispatch to change behavior depending on the domain needs. In this work we detail an underlying abstract term interface which allows for speed without sacrificing generality. We show that by formalizing a generic API on actions independent of implementation, we can retroactively add optimized data structures to our system without changing the pre-existing term rewriters. We showcase how this can be used to optimize term construction and give a 113x acceleration on general symbolic transformations. Further, we show that such a generic API allows for complementary term-rewriting implementations. Exploiting this feature, we demonstrate the ability to swap between classical term-rewriting simplifiers and e-graph-based term-rewriting simplifiers. We illustrate how this symbolic system improves numerical computing tasks by showcasing an e-graph ruleset which minimizes the number of CPU cycles during expression evaluation, and demonstrate how it simplifies a real-world reaction-network simulation to halve the runtime. Additionally, we show a reaction-diffusion partial differential equation solver which is able to be automatically converted into symbolic expressions via multiple dispatch tracing, which is subsequently accelerated and parallelized to give a 157x simulation speedup. Together, this presents Symbolics.jl as a next-generation symbolic-numeric computing environment geared towards modeling and simulation.

Interrogating the effect of enzyme kinetics on metabolism using differentiable constraint-based models

“…Moreover, similar to the classic MCA approach, if the derivatives of the constituent functions are known, then the constraint-based metabolic control analysis (CB-MCA) procedure is computationally efficient, because only a single linear system of equations needs to be solved (subsequent to the optimization) to calculate all the derivatives. Encouragingly, recent developments in automatic and symbolic differentiation allows these constituent function derivatives to be calculated efficiently for arbitrary problems automatically [30, 31, 32].…”

HyperGraphs.jl: representing higher-order relationships in Julia

“… Usage example of HyperGraphs.jl. Model of the MEK/ERK signaling cascade adapted from Filippi et al (2016) ( A ) and its definition as a chemical hypergraph ( B ), where ChE stands for chemical hyperedge, and species (with M representing MEK; E, ERK; Pt, phosphatase; and p, a phosphor group) are implemented as symbolic variables via Symbolics.jl ( Gowda et al , 2021 ). Note that if left unspecified, vertex multiplicity (encoding the stoichiometric coefficient of each species in a chemical hyperedge) defaults to 1.…”

HarmonicBalance.jl: A Julia suite for nonlinear dynamics using harmonic balance

“…Once defined, the equation of motion is stored in the dedicated object DifferentialEquation. For this primary input and subsequent symbolic manipulations, we employ the Julia package Symbolics.jl [97], whose emphasis on high performance is essential in dealing with complex problems, such as that shown in Section 5.4.…”