Specialized Symbolic Computation for Steady State Problems

Abstract

An implementation of symbolic computation for steady state problems is proposed in the paper. A mathematical basis is derived in order to specify the quantities that the implementation will concern. An analysis is performed so that an optimal algorithm can be chosen in terms of the two chosen criteria – the operation time and memory needed to store symbolic expressions. The implementation scheme of the specialized class for symbolic computation is presented with the use of a general figure and by an example. The implementation is made in C++ but the presented idea can also be applied in other programming languages that share similar properties. A program using the proposed algorithm was studied for its efficiency in terms of calculation time and memory used by symbolic expressions. This is made by comparing the calculations made by the author’s program with those made by a script written in Mathematica.