2015
DOI: 10.1016/j.amc.2015.08.128
|View full text |Cite
|
Sign up to set email alerts
|

Improving Petrov–Galerkin elements via Chebyshev polynomials and solving Fredholm integral equation of the second kind by them

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…We present in Table 13 the corresponding absolute errors R F n , R R n and R RF n respectively for this example. We compare our results with the results of Petrov-Galerkin elements via Chebyshev polynomials described in [2], for k ¼ 1 and n ¼ 10.…”
Section: Examplementioning
confidence: 73%
See 1 more Smart Citation
“…We present in Table 13 the corresponding absolute errors R F n , R R n and R RF n respectively for this example. We compare our results with the results of Petrov-Galerkin elements via Chebyshev polynomials described in [2], for k ¼ 1 and n ¼ 10.…”
Section: Examplementioning
confidence: 73%
“…Denote by R F n , R R n and R RF n error terms for the above three septic spline degenerate kernel method, respectively. We compare our methods with other methods such as discrete Galerkin methods and discrete collocation methods given in [8], Nyström methods given in [5], Iteration methods given in [4] and PetrovGalerkin elements via Chebyshev polynomials described in [2].…”
Section: Numerical Examplesmentioning
confidence: 99%
“…Besides, the spectral methods have enormous rates of convergence, they also have high level of reliability. The spectral method were divided into four classifications: collocation [5,6,26,27], tau [8,20,24,41], Galerkin [14,15,23] and Petrov-Galerkin [4,29] method. The main idea of the spectral methods is to express the solution of the problem as a finite sum of given basis of functions (orthogonal polynomials or combination of orthogonal polynomials) and then to choose the coefficients in order to minimize the difference between the exact and the numerical solutions.…”
Section: Introductionmentioning
confidence: 99%
“…In this method FIE is first converted into a system of linear equations. Later, Akhavan and Maleknejad [12] improved the Petrov-Galerkin elements using Chebyshev polynomials which eliminates some restrictions and improves accuracy from the previous method. Recently, Rostami and Maleknejad [13] used Galerkin method with Franklin wavelet as the basis for numerical approximation of two-dimensional FIE.…”
Section: Introductionmentioning
confidence: 99%