Abstract
The problem of function computation on dense grids is considered. Two approaches to expedite such computations are described: the use of base points and the adjustment of the computational method to certain interval of argument values. Implementations of the suggested algorithms can be integrated into modern computer algebra systems. Results of experiments on the Pentium II architecture are presented.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.REFERENCES
Zima, E.V., Automated Construction of Recurrent Relation Systems, Abstacts of Papers, Moskovskaya gorodskaya konferentsiya “Informatika, vychislitel'naya tekhnika, avtomatizatsiya v nauke i tekhnike, narodnom khozyaistve” (Moscow City Conference “Computer Science, Automation in Science, Engineering, and Economics”), Moscow, 1983, p. 53.
Zima, E.V., Simplification and Optimization Transformations of Chains of Recurrences, Proc. of ISSAC'95, Montreal: ACM, 1995, pp. 42–50.
Kislenkov, V., Mitrofanov, V., and Zima, E., Multidimensional Chains of Recurrences, Proc. of ISSAC'98, Rostock: ACM, 1998, pp. 199–206.
Bakhvalov, N.S., Chislennye metody (Numerical Methods), Moscow: Nauka, 1973.
Lyusternik, L.A., Chervonenkis, O.A., and Yanpol'skii, A.R., Matematicheskii analiz. Vychislenie elementarnykh funktsii (Mathematical Analysis: Calculation of Elementary Functions), Moscow: Fizmatgiz, 1963.
Olver, F., Asymptotics and Special Functions, New York: Academic, 1974. Translated under the title Vvedenie v asimptoticheskie metody i spetsial'nye funktsii, Moscow: Nauka, 1978.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kislenkov, V.V. Approaches to Expedite Function Computation on Dense Grids. Programming and Computer Software 28, 88–91 (2002). https://doi.org/10.1023/A:1014828901941
Issue Date:
DOI: https://doi.org/10.1023/A:1014828901941