2011
DOI: 10.1016/j.cam.2010.10.028
|View full text |Cite
|
Sign up to set email alerts
|

A numerical method for solving Fredholm–Volterra integral equations in two-dimensional spaces using block pulse functions and an operational matrix

Abstract: MSC: 45B05 45D05 45A05Keywords: Two-dimensional Fredholm-Volterra integral equations Block pulse functions Operational matrix a b s t r a c t In this paper, the block pulse functions (BPFs) and their operational matrix are used to solve two-dimensional Fredholm-Volterra integral equations (F-VIE). This method converts F-VIE to systems of linear equations whose solutions are the coefficients of block pulse expansions of the solutions of F-VIE.Finally some numerical examples are presented to show the efficiency … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 30 publications
(11 citation statements)
references
References 7 publications
0
10
0
Order By: Relevance
“…BPFs have been variously studied [16][17][18] and applied for solving different problems. The goal of this section is to recall notations and definition of the BPFs that are used in the next sections.…”
Section: Block Pulse Functionsmentioning
confidence: 99%
“…BPFs have been variously studied [16][17][18] and applied for solving different problems. The goal of this section is to recall notations and definition of the BPFs that are used in the next sections.…”
Section: Block Pulse Functionsmentioning
confidence: 99%
“…The literature on the numerical solution methods of such equations is fairly extensive [2][3][4][5][6][7][8][9]. But the analysis of computational methods for two-dimensional integral equations seem to have been discussed in only a few papers [10][11][12][13][14][15][16][17][18][19].…”
Section: Introductionmentioning
confidence: 99%
“…Among these methods, we refer to wavelet method, homotopy perturbation method, collocation method, and meshless method . A novel algorithm to get approximate solution of these equations is to express the solution as linear combination of orthogonal or nonorthogonal basis functions and polynomials such as block‐pulse functions, hat functions, Bernoulli polynomials, Legendre polynomials, Bessel polynomials, Chebyshev polynomials, Fibonacci polynomials, and orthonormal Bernstein polynomials …”
Section: Introductionmentioning
confidence: 99%