|
Abstract
|
Article Information:
Approximation of Mathematical Functions Using Horner’s Scheme and Continued Fraction
A.A. Eludire
Corresponding Author: A.A. Eludire
Submitted: 2011 March, 21
Accepted: 2011 April, 30
Published: 2011 September, 30 |
Abstract:
|
The choice of optimal algorithms for fast computation of functions are of great interest in numerical
theory and have increasing importance in the organisation and development of computer systems. The main
problem here is the definition of such computational methods of universal character in use and such functional
property that justifies the hardware implementation. This study examines the process of solving mathematical
functions on computers using Horner’s scheme and continued fraction. It concludes that procedures combining
both algorithms may be efficiently used as an option in software for the approximation of linear systems of
equations, serial and pipelined functions.
Key words: Approximation, continued fraction, Horner’s scheme, iterative functions, pipelined functions, serial functions,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
A.A. Eludire, . Approximation of Mathematical Functions Using Horner’s Scheme and Continued Fraction. Research Journal of Information Technology , (2): 68-71.
|
|
|
|
 |
ISSN (Online): 2041-3114
ISSN (Print): 2041-3106 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
