The Chebyshev collocation method in [21] to solve stiff initial-value problems is generalized by using arbitrary degrees of interpolation polynomials and arbitrary collocation points. The convergence of this generalized Chebyshev collocation method is shown to be independent of the chosen collocation points. It is observed how the stability region does depend on collocation points. In particular, A-stability is shown by taking the mid points of nodes as collocation points.

Abstract. In this paper, we present a simple explicit type numerical method for discretizations in time for solving one dimensional Burgers' equations. The proposed method does not need an iteration process that may be required in most implicit methods and have good convergence and efficiency in computational sense compared to other known numerical methods. For evidences, several numerical demonstrations are also provided.

Abstract. In this article, we propose exponentially fitted error correction methods(EECM) which originate from the error correction methods recently developed by the authors (see [10,11] for examples) for solving nonlinear stiff initial value problems. We reduce the computational cost of the error correction method by making a local approximation of exponential type. This exponential local approximation yields an EECM that is exponentially fitted, A-stable and L-stable, independent of the approximation scheme for the error correction. In particular, the classical explicit Runge-Kutta method for the error correction not only saves the computational cost that the error correction method requires but also gives the same convergence order as the error correction method does. Numerical evidence is provided to support the theoretical results.