数学物理学报(英文版) ›› 1997, Vol. 17 ›› Issue (1): 69-84.

• 论文 • 上一篇    下一篇

AUTOMATIC AUGMENTED GALERKIN ALGORITHMS FOR FREDHOLM INTEGRAL EQUATIONS OF THE FIRST KIND

S. Abbasbandy, E. Babolian   

  1. Institute of Mathematics, Teacher Training University, Tehran 15614, IRAN
  • 收稿日期:1995-10-13 出版日期:1997-03-25 发布日期:1997-03-25

AUTOMATIC AUGMENTED GALERKIN ALGORITHMS FOR FREDHOLM INTEGRAL EQUATIONS OF THE FIRST KIND

S. Abbasbandy, E. Babolian   

  1. Institute of Mathematics, Teacher Training University, Tehran 15614, IRAN
  • Received:1995-10-13 Online:1997-03-25 Published:1997-03-25

摘要: In recent papers, Babolian & Delves[2] and Belward[3] described a Chebyshev series method for the solution of first kind integral equations. The expansion coefficients of the solution are determined as the solution of a mathematical programming problem.The method involves two regularization parameters, Cf and r, but values assigned to these parameters are heuristic in nature. Essah & Delves[7] described an algorithm for setting these parameters automatically, but it has some difficulties. In this paper we describe three iterative algorithms for computing these parameters for singular and non-singular first kind integral equations. We give also error estimates which are cheap to compute. Finally, we give a number of numerical examples showing that these algorithms work well in practice.

关键词: Fredholm integral equations, Galerkin method, Regularization parameters, Error estimation, Ill-posed problems, Product of Chebyshev series

Abstract: In recent papers, Babolian & Delves[2] and Belward[3] described a Chebyshev series method for the solution of first kind integral equations. The expansion coefficients of the solution are determined as the solution of a mathematical programming problem.The method involves two regularization parameters, Cf and r, but values assigned to these parameters are heuristic in nature. Essah & Delves[7] described an algorithm for setting these parameters automatically, but it has some difficulties. In this paper we describe three iterative algorithms for computing these parameters for singular and non-singular first kind integral equations. We give also error estimates which are cheap to compute. Finally, we give a number of numerical examples showing that these algorithms work well in practice.

Key words: Fredholm integral equations, Galerkin method, Regularization parameters, Error estimation, Ill-posed problems, Product of Chebyshev series