Filter matrix based on interpolation wavelets for solving Fredholm integral equations

✍ Scribed by K. Maleknejad; A. Khademi

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 638 KB
• Volume: 16
• Category: Article
• ISSN: 1007-5704
• DOI: 10.1016/j.cnsns.2011.03.019

✦ Synopsis

The interpolation wavelet is used to solve the Fredholm integral equation of the second kind in this study. Hence, by the extension of interpolation wavelets that [À1, 1] is divided to 2 N+1 (N P À 1) subinterval, we have polynomials with a degree less than M + 1 in each new interval. Therefore, by considering the two-scale relation the filter coefficients and filter matrix are used as the proof of theorems. The important point is interpolation wavelets lead to more sparse matrix when we try to solve integral equation by an approximate kernel decomposed to a lower and upper resolution. Using n-time, where (n P 2), two-scale relation in this method errors of approximate solution as O((2 À(N+1) ) n+1 ). Also, the filter coefficient simplifies the proof of some theorems and the order of convergence is estimated by numerical errors.