- Research Article
13
- 10.1016/s0096-3003(02)00533-7
Iterated discrete polynomially based Galerkin methods
- Jan 30, 2003
- Applied Mathematics and Computation
- Rekha P Kulkarni + 1 more +1
Iterated discrete polynomially based Galerkin methods
A general theory is given for discretized versions of the Galerkin method for solving Fredholm integral equations of the second kind.The discretized Galerkin method is obtained from using numerical integration to evaluate the integrals occurring in the Galerkin method.The theoretical framework that is given parallels that of the regular Galerkin method, including the error analysis of the superconvergence of the iterated Galerkin and discrete Galerkin solutions.In some cases, the iterated discrete Galerkin solution is shown to coincide with the Nyström solution with the same numerical integration method.The paper concludes with applications to finite element Galerkin methods.1. Introduction.Consider the numerical solution of the Fredholm integral equation of the second kind, (1.1)x(s)-f K(s,t)x(t)da(t)=y(s), s e D. JDIn this paper we will define and analyze the discrete Galerkin method for the numerical solution of (1.1).The Galerkin method is a well-known procedure for the approximate solution of this equation (e.g., see [5, p. 62]); and the discrete Galerkin method results when the integrations of the Galerkin method are evaluated numerically.Before giving a more precise definition of the discrete Galerkin method, we review results for the Galerkin method.In Eq. (1.1), the region D is to be a closed subset of Rm, some m > 1; and the dimension of D can be less than m, for example, if D is a surface in R3.For the discrete Galerkin method, we will assume that K(s, t) is continuous for s, t e D, although that is not necessary for the discussion of Galerkin's method given below.The equation (1.1) is written symbolically as (1.2) (I-Jf)x=y, with the integral operator assumed to be a compact operator from L2(D) to L2(D) and from L°°(D) to C(D).Further, it is assumed that (1.1) is uniquely solvable in SC for all y e 3C, for both 3C= C(D) and SC= L2(D).Additional assumptions on D and K(s, t) will be given as they are needed in the applications presented later in the paper.Generally y e C(D), and this will imply x e C(D).
Iterated discrete polynomially based Galerkin methods
Iterated discrete polynomially based Galerkin methods
Solving a class of nonlinear boundary integral equations based on the meshless local discrete Galerkin (MLDG) method
Solving a class of nonlinear boundary integral equations based on the meshless local discrete Galerkin (MLDG) method
Modelling and analysis framework for nonlinear dynamics of submerged tensioned cables
Modelling and analysis framework for nonlinear dynamics of submerged tensioned cables
Four Variants of the Galerkin Method for Integral Equations of the Second Kind
Four variants of the Galerkin method for integral equations of the form y = f+Ky, with K compact, are considered. They are the classical Galerkin method; the Kantorovich method (discussed recently by Schock), in which the inhomogeneous term f is treated exactly, and the Galerkin scheme applied to y−f; the iterated Galerkin method, obtained by substituting the Galerkin approximation into the right-hand side of the integral equation; and the similarly iterated Kantorovich method. The principal new result is that the iterated Kantorovich method converges faster than the Kantorovich method; and that the factor of improvement (the "superconvergence factor") has the same theoretical bound as that already known for iteration of the Galerkin method. Thus in the circumstances in which the Kantorovich modification is indicated (i.e. when y−f is smoother than y), the iterated Kantorovich method will generally be the most accurate of the four methods considered.
Read moreThe Numerical Solution of Integral Equations on the Half-Line
The Numerical Solution of Integral Equations on the Half-Line
Adaptive discontinuous Galerkin methods for state constrained optimal control problems governed by convection diffusion equations
We study a posteriori error estimates for the numerical approximations of state constrained optimal control problems governed by convection diffusion equations, regularized by Moreau---Yosida and Lavrentiev-based techniques. The upwind Symmetric Interior Penalty Galerkin (SIPG) method is used as a discontinuous Galerkin (DG) discretization method. We derive different residual-based error indicators for each regularization technique due to the regularity issues. An adaptive mesh refinement indicated by a posteriori error estimates is applied. Numerical examples are presented to illustrate the effectiveness of the adaptivity for both regularization techniques.
Read moreEfficient multistep procedures for nonlinear parabolic problems with nonlinear Neumann boundary conditions
Efficient multistep procedures for time-stepping Galerkin methods for nonlinear parabolic partial differential equations with nonlinear Neumann boundary conditions are presented and analyzed. The procedures involve using a precoditioned iterative method for approximately solving the differet linear equations arising at each time step in a discrete time Galerkin method. Optimal order convergence rates are obtained for the iterative methods. Work estimates of almost optimal order are obtained.
Read moreDiscrete multi-projection methods for eigen-problems of compact integral operators
Discrete multi-projection methods for eigen-problems of compact integral operators
Alternating Direction Implicit Galerkin Methods for an Evolution Equation with a Positive-Type Memory Term
We formulate and analyze new methods for the solution of a partial integrodifferential equation with a positive-type memory term. These methods combine the finite element Galerkin (FEG) method for the spatial discretization with alternating direction implicit (ADI) methods based on the Crank---Nicolson (CN) method and the second order backward differentiation formula for the time stepping. The ADI FEG methods are proved to be of optimal accuracy in time and in the $$L^2$$L2 norm in space. Furthermore, the analysis is extended to include an ADI CN FEG method with a graded mesh in time for problems with a nonsmooth kernel. Numerical results confirm the predicted convergence rates and also exhibit optimal spatial accuracy in the $$L^{\infty }$$L? norm.
Read moreOn a higher order accurate fully discrete Galerkin approximation to the Navier-Stokes equations
We consider approximating the solution of the initial and boundary value problem for the Navier-Stokes equations in bounded two- and three-dimensional domains using a nonstandard Galerkin (finite element) method for the space discretization and the third order accurate, three-step backward differentiation method (coupled with extrapolation for the nonlinear terms) for the time stepping. The resulting scheme requires the solution of one linear system per time step plus the solution of five linear systems for the computation of the required initial conditions; all these linear systems have the same matrix. The resulting approximations of the velocity are shown to have optimal rate of convergence in L 2 {L^2} under suitable restrictions on the discretization parameters of the problem and the size of the solution in an appropriate function space.
Read moreA discrete Galerkin method for a hypersingular boundary integral equation
Mathematics Department, University of Iowa, Iowa City, IA 52242, USA[Received 14 August 1995 and in revised form 20 August 1996]Consider solving the interior Neumann problemAu(P) = 0, PeD= /(/>), PeSwith D a simply-connected planar region and S = BD a smooth curve. Adouble-layer potential is used to represent the solution, and it leads to theproblem of solving a hypersingular integral equation. This integral equation isreformulated as a Cauchy singular integral equation. A discrete Galerkin methodwith trigonometric polynomials is then given for its solution. An error analysis isgiven, and numerical examples complete the paper.1. IntroductionLet D be a bounded open simply-connected region in the plane, and letits boundary S be sufficiently smooth. Consider the Neumann problem: findu 6 C
Read moreSupplement to The Discrete Galerkin Method for Integral Equations
6. Bound on G In this section we adopt the approach of h [17] in order to bound IIGh 11 in (4.20). This approach is quite general, and the reader may wish to refer ahead to Section 7, which contains more specific examples of subspaces Sh. We distinguish between two cases: n (i) D is a region in iR (ii) D is a surface in in. In the first case, the modifications needed of Descloux's presentation are just notational; while in the second, they are minor in every respect. Thus we introduce the following notations and assumptions.
Read moreNumerial Methods for Volterra Integral Equations with Singular Kernels
Numerial Methods for Volterra Integral Equations with Singular Kernels
A discrete finite element galerkin method for a unidimensional single-phase Stefan problem
Based on Landau-type transformation, a Stefan problem with nonlinear free boundary condition is transformed into a system consisting of parabolic equation and the ordinary differential equations. Semidiscrete approximations are constructed. Optimal orders of convergence of semidiscrete approximation inL2,H1 andH2 normed spaces are derived.
Read moreMixed methods for compressible miscible displacement with the effect of molecular dispersion
We consider a nonlinear parabolic system describing compressible miscible displacement in a porous medium[4]. Continuous time and discrete time Galerkin methods are introduced to approximate the solution, and optimalH 1-error estimates are obtained. This paper improves upon previously derived estimates in two aspects. Firstly, error estimates are given with no restrictions on the diffusion tensor. That is, we have included the effects of molecular diffusion and dispersion. Secondly, the complete compressible case is considered in the error analysis.
Read more