Machine-efficient Chebyshev approximation for exact arithmetic: their use with first-order ordinary differential equations
Article No.: 84, Pages 1 - 7
Abstract
In this paper we use the idea of Brisebarre, Muller, Tisserand and Chevillard on machine-efficient Chebyshev approximation. Our aim is to provide high accuracy results for log, Gamma (and related functions), and the solution of Ordinary Differential Equations by Picard iteration using machine-efficient Chebyshev approximations. We demonstrate that these machine-efficient approximations do indeed improve the efficiency with which these operations can be performed. These practical calculations were performed using Muller's iRRAM.
References
[1]
Abutheraa, M. A., and D. Lester, Computable Function Representation Using Effective Chebyshev Polynomial, 4th CMSE. (2007), 103--110.
[2]
Abramowitz, M. and I. Segun, "Handbook of Mathematical Functions," New York: Dover Publications, INC., (1968).
[3]
Bajard, J., M. Ercegovac, L. Imbert and F. Rico, Fast evaluation of elementary functions with combined shift-and-add and polynomial methods, 4th RNC. (2000), 75--87.
[4]
Brisebarre, N. and S. Chevillard, Efficient polynomial L∞-approximation, 18th IEEE Arith. (2007), 169--176.
[5]
Brisebarre, N., J. M. Muller, and A. Tisserand, Computing Machine-Efficient Polynomial Approximation, ACM Transactions on Mathematical Software. 2 (2006), 236--256.
[6]
Brattka, V., Effective Borel measurability and reducibility of functions, CCA, 302 (2003), 117--152.
[7]
Clenshaw, C. W., The Numerical Solution of Linear Differential Equations in Chebyshev Series, Comb. Phil. Soc., (1957).
[8]
Clenshaw, C. W., and H. J. Norton, The Solution of Nonlinear Ordinary Differential Equations in Chebyshev Series, The Computer Journal, (1963).
[9]
Gowland, P., and D. Lester, A Survey of Exact Arithmetic Implementations, CCA2000, (2000), 99--116.
[10]
Hertling, P., Topological complexity with continuous operations, J. of Complexity. (1996).
[11]
Kincaid, D. and W. Cheney, "Numerical Analysis," Mathematics of Scientific Computing, Brooks/Cole (2002).
[12]
Ker-I Ko, On the Computational Complexity of Best Chebyshev Approximations. J. of Complexity, 2 (1986), 65--120.
[13]
Ker-I Ko, "Complexity Theory of Real Functions," Progress in Theoretical Computer Science, Birkhauser, Boston (1991).
[14]
Lester, D.; Exact Statistics and Continued Fractions, J. of Universal Computer Science, vol. 1 (7), (1995).
[15]
Lester, D., and P. Gowland; Using PVS to validate the algorithms of an exact arithmetic, Theoratical of Computer Science, (2003).
[16]
J. Mason, "Chebyshev Polynomials: Theory and Applications," Kluwer Academic, (1996).
[17]
Mason, J. C. and D. C. Handscomb, "Chebyshev Polynomials," CRC Press, (2003).
[18]
Muller, J. M., "Elementary Functions," Algorithms and Implementation, Birkhauser, (1997).
[19]
Müller, N. Th., The iRRAM: Exact Arithmetic in C++, CCA2000, (2000).
[20]
Pour-El, M. B. and J. I. Richards, "Computability in Analysis and Physics," Perspectives in Mathematical Logic, (1989).
[21]
Larson, R. E., R. P. Hostetler, B. H. Edwards, and D. E. Heyd, "Calculus with Analytic Geometry," D. C. Heath and Company, (1994).
[22]
Weihrauch, K., "Computable Analysis," Springer-Verlag Berlin, (2000).
[23]
Zhong, N., and K. Weihrauch, Computability Theory of Generalized Functions, J. of the ACM (JACM), vol. 50 4, (2003).
Recommendations
Solution of Linear Fractional Fredholm Integro-Differential Equation by Using Second Kind Chebyshev Wavelet
ITNG '14: Proceedings of the 2014 11th International Conference on Information Technology: New GenerationsIn the present paper, a numerical method is proposed to solve the fractional Fredholm integro-differential equation. The proposed method is based on the Chebyshev wavelet approximation. Using the approximation of an unknown function, its fractional ...
Chebyshev rational matrix approximation with a priori error bounds for linear and Riccati matrix equations
This paper deals with initial value problems for Lipschitz continuous coefficient matrix Riccati equations. Using Chebyshev polynomial matrix approximations the coefficients of the Riccati equation are approximated by matrix polynomials in a ...
A Numerical Method for Lane-Emden Equations Using Chebyshev Polynomials and the Collocation Method
ICCIS '10: Proceedings of the 2010 International Conference on Computational and Information SciencesA numerical method to solve Lane-Emden equations as singular initial value problems is presented in this work. This method is based on the replacement of unknown functions through a truncated series of Chebyshev expansions of function. The collocation ...
Comments
Information & Contributors
Information
Published In
April 2010
1726 pages
ISBN:9781450300698
- General Chairs:
- Robert McGraw,
- Eric Imsand,
- Program Chair:
- Michael J. Chinni
Sponsors
- SCS: Society for Modeling and Simulation International
In-Cooperation
Publisher
Society for Computer Simulation International
San Diego, CA, United States
Publication History
Published: 11 April 2010
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SpringSim '10
Sponsor:
- SCS
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 84Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in