Approaches to Expedite Function Computation on Dense Grids

Authors:
V. V. Kislenkov
Affiliations:
Department of Computational Mathematics and Cybernetics, Moscow State University, Vorob'evy gory, Moscow, 119899 Russia kislenkov@rambler.ru
Venue:
Programming and Computing Software
Year:
2002

Citing 2
Cited 1

Simplification and optimization transformations of chains of recurrences

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Multidimensional chains of recurrences

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation

Grid-Oriented Computation: Integrated Library GridComp

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

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.