Evaluation of a rational function
From MaRDI portal
Publication:688124
The aim of this paper is to present four algorithms for the evaluation of a rational function. (Horner's method, direct evaluation through a continued fraction representation or evaluation by a subsequent process that uses three-term recurrences.) The algorithms are presented and demonstrated. They are implemented using a parallel architecture (a four- node transputer system). Comparisons and discussions on costs and computation time are presented, both for serial and parallel computing.
Recommendations
Cited in
(8)- Fast methods for computing the values of the derivatives of a rational function
- Some applications of the Hermite matrix polynomials series expansions
- Incomplete partial fractions for parallel evaluation of rational matrix functions
- An accurate algorithm for evaluating rational functions
- Badness of small denominators in rational function evaluation
- A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors
- Evaluation of rational functions
- Fast evaluation of polynomials by rational preparation
This page was built for publication: Evaluation of a rational function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688124)