Record Details

Iterated discrete polynomially based Galerkin methods

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Iterated discrete polynomially based Galerkin methods
 
Creator KULKARNI, RP
GNANESHWAR, N
 
Subject spectral approximation
equations
convergence rates
iterated discrete galerkin
spectral approximation
integral equations
polynomially based
 
Description Golberg and Bowman [Appl. Math. Comput. 96 (1998) 237] have studied polynomially based discrete Galerkin method for Fredholm and Singular integral equations. In this paper we consider polynomially based iterated discrete Galerkin method for solution of operator equations and for eigenvalue problem associated with an integral operator with a smooth kernel. We show that the error in the infinity norm, both for approximation of operator equation and of spectral subspace, is of the order of n(-r), where n is the degree of the polynomial approximation and r is the smoothness of the kernel. Thus the iterated discrete Galerkin solution improves upon the discrete Galerkin solution, which was shown to be of order n(-r+1) by Golberg and Bowman [Appl. Math. Comput. 96 (1998) 237]. We also give a shorter proof of the result by Golberg and Bowman which states that the error in 2-norm in discrete Galerkin method is of the order of n(-r). (C) 2002
 
Publisher ELSEVIER SCIENCE INC
 
Date 2011-07-27T09:57:27Z
2011-12-26T12:56:41Z
2011-12-27T05:45:45Z
2011-07-27T09:57:27Z
2011-12-26T12:56:41Z
2011-12-27T05:45:45Z
2003
 
Type Article
 
Identifier APPLIED MATHEMATICS AND COMPUTATION, 146(1), 153-165
0096-3003
http://dx.doi.org/10.1016/S0096-3003(02)00533-7
http://dspace.library.iitb.ac.in/xmlui/handle/10054/7191
http://hdl.handle.net/10054/7191
 
Language en