Simplification and optimization transformations of chains of recurrences (1995) [23 citations — 6 self]
Download:
|
|
by Eugene V. Zima
In Proc. of the International Symposium on Symbolic and Algebraic Computing
http://scg1.uwaterloo.ca/papers/zim-iss95.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Zima95simplificationand,author = {Eugene V. Zima},
title = {Simplification and optimization transformations of chains of recurrences},
booktitle = {In Proc. of the International Symposium on Symbolic and Algebraic Computing},
year = {1995},
pages = {42--50},
publisher = {ACM Press}
}
Years of Citing Articles
Abstract:
The problem of expediting the evaluation of closed-form functions at regular intervals is considered. The Chain of Recurrences technique to expedite computations is extended by rational simplifications and examined as a form of internal representation, oriented towards fast evaluation. Optimizing transformations of Chains of Recurrences are proposed.
Citations
| 31 | Chains of recurrences - a method to expedite the evaluation of closed-form functions – BACHMANN, WANG, et al. - 1994 |
| 16 | Recurrent relations and speed-up of computations using computer algebra systems – ZIMA - 1992 |
| 16 | Automatic construction of systems of recurrence relations – ZIMA - 1984 |
| 3 | Calcul formel – Davenport, Siret, et al. - 1987 |
| 3 | MapleV Language Reference Manual – Char, Geddes - 1991 |
| 2 | Numeric code optimization in computer algebra systems and recurrent relations technique – Zima - 1993 |
| 1 | Transformations of expressions associated with systems of recursive relations – Zima |
| 1 | a Source-Code Optimization PackagE for REDUCE, Twente Univ., The – SCOPE - 1994 |
