Iterated discrete polynomially based Galerkin methods.
type: Item
instance of: scholarly article
title: Iterated discrete polynomially based Galerkin methods.
zbMATH Open document ID: 1036.65114
DOI: 10.1016/S0096-3003(02)00533-7
author: Rekha P. Kulkarni
author: N. Gnaneshwar
published in: Applied Mathematics and Computation
publication date: 2003-11-25T00:00:00Z
review text: The authors consider a polynomially based iterated discrete Galerkin method for the solution of operator equations \(u-Ku=f\) and for an eigenvalue problem associated with an integral operator \((Kx)(s)=\int_{-1}^1 k(s,t)x(t)\,dm(t)\), \(s\in[-1,1]\), with a smooth kernel, \(k(\cdot,\cdot)\in C([-1,1]\times[-1,1])\). It is proved that the approximating operators in the iterated discrete Galerkin method converge to the integral operator in norm, in an appropriately chosen space. The error in the infinity norm, both for the approximation of the operator equation and of the 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 \textit{M. Golberg} and \textit{H. Bowman} [Appl. Math. Comput. 96, 237--271 (1998; Zbl 0944.65142)]. The authors also give a shorter proof of the result by Golberg and Bowman which states that \(\| u-v_n\|_2\) in discrete Galerkin method is of the order of \(n^{-r}\).
Mathematics Subject Classification ID: 65R20
Mathematics Subject Classification ID: 45C05
zbMATH DE Number: 2009026
zbMATH Keywords: convergence
zbMATH Keywords: iterated discrete Galerkin method
zbMATH Keywords: spectral approximation
zbMATH Keywords: integral equations
zbMATH Keywords: error bound
zbMATH Keywords: eigenvalue
zbMATH Keywords: integral operator
reviewed by: Nikolay Yakovlevich Tikhonenko
MaRDI profile type: Publication
cites work: The Discrete Galerkin Method for Integral Equations
cites work: Discrete polynomial-based Galerkin methods for Fredholm integral equations
cites work: Improved convergence rates for some discrete Galerkin methods
cites work: Optimal convergence rates for some discrete projection methods
cites work: Discrete Galerkin Methods for Fredholm Integral Equations of the Second Kind
cites work: SPECTRAL APPROXIMATION USING ITERATED DISCRETE GALERKIN METHOD
cites work: Spectral Approximation for Compact Operators
cites work: Polynomial interpolation and hyperinterpolation over general regions
cites work: Q3895980
cites work: On Superconvergence Properties of Galerkin's Method for Compact Operator Equations
Recommended article: SPECTRAL APPROXIMATION USING ITERATED DISCRETE GALERKIN METHOD
Recommended article: Q4020753
Recommended article: On the Discrete Galerkin Method for Fredholm Integral Equations of the Second Kind
Recommended article: Discrete Galerkin Methods for Fredholm Integral Equations of the Second Kind
Recommended article: The Discrete Galerkin Method for Integral Equations
Recommended article: Spectral refinement based on superconvergent Nyström and degenerate kernel methods
Recommended article: Richardson extrapolation of iterated discrete Galerkin method for eigenvalue problem of a two dimensional compact integral operator
Recommended article: Richardson extrapolation of iterated discrete projection methods for eigenvalue approximation
Recommended article: Discrete Legendre spectral Galerkin method for Urysohn integral equations
Recommended article: Spectral refinement using a new projection method
description: scientific article; zbMATH DE number 2009026