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

S. Akhavan and K. Maleknejad

Applied Mathematics and Computation, 2015, vol. 271, issue C, 352-364

Abstract: Two types of univariate Petrov–Galerkin elements using piecewise polynomials are described by Chen and Xu (1998) and four lemmas are proved for convergence of k−0 Petrov–Galerkin elements. For k−0 Petrov–Galerkin elements, the choice of k has a restriction 1 ≤ k ≤ 5.

Keywords: Fredholm integral equations; Petrov–Galerkin elements; Petrov–Galerkin method; Regular pairs; Chebyshev polynomials; Generalized Petrov–Galerkin elements (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315012096
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:271:y:2015:i:c:p:352-364

DOI: 10.1016/j.amc.2015.08.128

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().