Abstract: | We introduce some general concepts and propositions relating to symbolic computation on a computer. We analyze the suitability of the known numerical methods for solving systems of linear algebraic equations with symbolic elements. We propose efficient algorithms for solving dense systems and certain sparse systems by branching continued fractions.Translated fromMatematicheskie Metody i Fiziko-Mekhanicheskie Polya, Issue 34, 1991, pp. 29–35. |