Abstract: In this paper, we introduce a generalized Chebyshev
collocation method (GCCM) based on the generalized Chebyshev
polynomials for solving stiff systems. For employing a technique
of the embedded Runge-Kutta method used in explicit schemes, the
property of the generalized Chebyshev polynomials is used, in which
the nodes for the higher degree polynomial are overlapped with those
for the lower degree polynomial. The constructed algorithm controls
both the error and the time step size simultaneously and further
the errors at each integration step are embedded in the algorithm
itself, which provides the efficiency of the computational cost. For
the assessment of the effectiveness, numerical results obtained by the
proposed method and the Radau IIA are presented and compared.
Abstract: In this paper, we introduce a method for improving
the embedded Runge-Kutta-Fehlberg4(5) method. At each integration
step, the proposed method is comprised of two equations for the
solution and the error, respectively. These solution and error are
obtained by solving an initial value problem whose solution has the
information of the error at each integration step. The constructed algorithm
controls both the error and the time step size simultaneously and
possesses a good performance in the computational cost compared to
the original method. For the assessment of the effectiveness, EULR
problem is numerically solved.