International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 147 - Number 14 |
Year of Publication: 2016 |
Authors: Shyam Lal, Manoj Kumar |
10.5120/ijca2016911210 |
Shyam Lal, Manoj Kumar . Wavelet Approximations using (Λ⋅C1) Matrix-Cesaro Summability Method of Jacobi Series. International Journal of Computer Applications. 147, 14 ( Aug 2016), 1-8. DOI=10.5120/ijca2016911210
In this paper, an application to the approximation by wavelets has been obtained by using matrix-Cesaro (Λ⋅C1) method of Jacobi polynomials. The rapid rate of convergence of matrix-Cesaro method of Jacobi polynomials are estimated. The result of Theorem (6.1) of this research paper is applicable for avoiding the Gibbs phenomenon in intermediate levels of wavelet approximations. There are major roles of wavelet approximations (obtained in this paper) in computer applications. The matrix-Cesaro (Λ⋅C1) method includes (N, pn)⋅C1 method as a particular case. The comparison between the numerical results obtained by the (N, pn)⋅C1 and matrix-Cesaro (Λ⋅C1) summability method reveals a slight improvement concerning the reduction of the excessive oscillations by using the approach of present paper.