Numerical solution of mixed Volterra-Fredholm integral equations using iterative method via two-variables Bernstein polynomials
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2018, Vol 6, Issue 2
Abstract
This paper is concerned with the numerical solution of mixed Volterra-Fredholm integral equations, based on iterative method and two variable Bernstein polynomials. In the main result, this method has several benefits in proposing an efficient and simple scheme with good degree of accuracy. Our second main result is to prove the convergence of the method, and to derive an upper bound under assumptions. Numerical experiments are performed for the approximation of the solution of two examples to demonstrate the accuracy and integrity of the method.
Authors and Affiliations
Farkhondeh Hosseini Shekarabi, Ezzati Reza
Keywords
Related Articles
- EP ID EP478774
- DOI -
- Views 55
- Downloads 0
A Residual Approach for Balanced Truncation Model Reduction (BTMR) of Compartmental Systems
This paper presents a residual approach of the square root balanced truncation algorithm for model order reduction of continuous, linear and time-invariante compartmental systems. Specifically, the new approach uses a re...
Quadrature formulae of Euler-Maclaurin type based on generalized Euler polynomials of level m
This article deals with some properties -which are, to the best of our knowledge, new- of the generalized Euler polynomials of level $m$. These properties include a new recurrence relation satisfied by these polynomials...
Numerical solution of mixed Volterra-Fredholm integral equations using iterative method via two-variables Bernstein polynomials
This paper is concerned with the numerical solution of mixed Volterra-Fredholm integral equations, based on iterative method and two variable Bernstein polynomials. In the main result, this method has several benefits in...
A convex optimization approach for solving large scale linear systems
The well-known Conjugate Gradient (CG) method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this wo...
Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
Inexact restoration (IR) is a well established technique for continuous minimization problems with constraints that can be applied to constrained optimization problems with specific structures. When some variables are re...