An Algorithm for Integration, Differentiation and Finding Root Numerically
Keywords:
computer science, mathematics, engineering, and the sciences
Abstract
Numerical analysis concerns the development of algorithms for solving various types of problems of mathematics; it is a vast-ranging field having deep interaction with computer science, mathematics, engineering, and the sciences. Numerical analysis mainly consists of Numerical Integration, Numerical Differentiation and finding Roots numerically. In this paper we develop an algorithm combination of Numerical Integration (Trapezoidal rule, Simpson#x2019;s #x1D7CF;#x1D7CF;/#x1D7D1;#x1D7D1; rule, Simpson#x2019;s #x1D7D1;#x1D7D1;/#x1D7D6;#x1D7D6; rule and Weddle#x2019;s rule.), Numerical Differentiation (Euler, modified Euler and Runge- Kutta second and fourth order) and finding Roots (Bisection method and False position method) numerically.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2014-05-15
Issue
Section
License
Copyright (c) 2014 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.