Recurrent relations and speed-up of computations using computer algebra systems
Implementation of various numerical methods often needs organisation of computation using complex iterative formulae, i.e. cycles. The time for performing a program on a computer and the necessary storage capacity are largely dependent on form of these formulae. It is desirable to construct computations so that each iterative step might use the results obtained at the previous steps as completely as possible. This implies the association of the given formulae with the recurrent relations, that bring about the same result but economise the arithmetic operations. A special algebraic method has been created that provides for the automatic construction of such recurrent relations. This method and main ways of its use in the algorithms of cycle optimisation, in the computer algebra systems and in algorithms of automatic parallel programs construction are explained. Many examples and programs are given.
Unable to display preview. Download preview PDF.
- 1.Zima E.V., Automatic Construction of Systems of Recurrence Relations. (in Journal of Computational Mathematics and Mathematical Physics.), Vol. 24, N 6, (1984), pp. 193–197.Google Scholar
- 2.Zima E.V., Transformations of Expressions Associated with Systems of Recursion Relations. (Moscow University Computational Mathematics and Cybernetics, 1985, N 1, pp. 60–66.)Google Scholar
- 3.Aho A.V., Ullman J.D., The theory of parsing, translation and compiling. Vol. 2: Compiling. (Prentice-Hall, Inc. Englewood Cliffs, N.J. 1973)Google Scholar
- 4.Hockney R.W., Jesshope C.R. Parallel Computers: arhitecture, programming and algorithms. Aden Hilgen Ltd., Bristol, 1983.Google Scholar
- 5.Evans, D.J.(ed.), Parallel Processing Systems. (Cambridge University press, 1982).Google Scholar
- 6.Supercomputers. Class YI Systems, Hardware and Software. S.Fernbach (ed.), North-Holland, 1986.Google Scholar