The paper deals with stiff systems of differential equations. To solve this sort of system numerically is a diffult task. In spite of the fact that we come across stiff systems quite often in the common practice, a very interesting and promissing numerical method of solving systems of ordinary differential equations (ODE) based on Taylor series has appeared. The question was how to harness the ...

degenerate kernel approximation method is generalized to solve hammerstein system of fredholm integral equations of the second kind. this method approximates the system of integral equations by constructing degenerate kernel approximations and then the problem is reduced to the solution of a system of algebraic equations. convergence analysis is investigated and on some test problems, the propo...

This paper presents a new approach to the functional approximation of the M/G/1/N built on a Taylor series approach. Specifically, we establish an approximative expression for the remainder term of the Taylor series that can be computed in an efficient manner. As we will illustrate with numerical examples, the resulting Taylor series approximation turns out to be of practical value.

The IBM Power4 processor uses series approximation to calculate square root. We formally verified the correctness of this algorithm using the ACL2(r) theorem prover. The proof requires the analysis of the approximation error on a Chebyshev series. This is done by proving Taylor’s theorem, and then analyzing the Chebyshev series using Taylor series. Taylor’s theorem is proved by way of non-stand...

In this study we produced a new method for solving regular differential equations with step size h and Taylor series. This method analyzes a regular differential equation with initial values and step size h. this types of equations include quadratic and cubic homogenous equations with constant coeffcients and cubic and second-level equations.