|
ALGORITHM FOR SOLVING FLOW CHARTS BY THE GAUSSIAN REDUCTION
Flow charts are useful for modelling and analysis of linear systems, particularly in cases of their automatic solving by computers. A simple, efficient and completely formal algorithm for flow chart solving has been presented. It is based on Gaussian reduction, so it can be directly realized on a computer. Besides numerical solving, the algorithm also enables symbolical flow chart solving which extends its application to dynamical linear systems as well.
Ključne reči: Flow chart, Gaussian reduction, algorithm, linear system, symbolic solving. |