TH-collocation for the biharmonic equation
Introduction
This paper is part of a line of research in which a general and unified theory of domain decomposition methods (DDM), proposed by Herrera [1] and stemming from Trefftz method [2], is being explored. In it, the terms ‘domain decomposition methods’ are understood in broader sense than usual and they include many aspects of numerical methods for partial differential equations. As a matter of fact, Herrera's approach to partial differential equations constitutes a general and systematic formulation of discontinuous Galerkin methods [3], in which the use of ‘fully’ discontinuous functions is permitted. The investigations that are being carried out, in the line of research mentioned above, cover two different aspects. One is concerned with developing novel discretization procedures [4], [5] and the other one deals with producing new ways of efficiently using parallel computing resources in the numerical simulation of continuous systems [3].
The main purpose of the present paper is to present an improved orthogonal-collocation treatment of the biharmonic equation. This is based on the application of a new general collocation method, ‘TH-collocation’, which was introduced in a pair of previous papers [4], [5]. An interesting and attractive feature of TH-collocation is the relaxation of the continuity conditions, which allows using trial-spaces of functions that are globally only C0. This, in turn, permits deriving algorithms with better-structured matrices. In particular, it produces symmetric and positive matrices when it is applied to differential systems with such properties, as is the case of Laplace's and the biharmonic operators. Also, the number of degrees of freedom associated with each node is reduced. For Poisson equation, TH-collocation yields an algorithm of fourth order precision whose global matrix, in addition to being symmetric and positive definite, is block nine-diagonal, with blocks of at most 3×3 [5]. This is to be compared with orthogonal spline collocation (OSC), which for the same order of accuracy yields a global matrix that is neither symmetric, nor positive, and whose blocks are 4×4. Furthermore, TH-collocation also yields another algorithm [5], of second order precision, whose global matrix is strictly nine-diagonal (i.e. with blocks 1×1). Such reduction is not possible when OSC is applied. Due to these important advantages, over standard collocation procedures, which TH-collocation possesses, domain decomposition methods (DDM) can be effectively applied to TH-collocation algorithms using the Conjugate Gradient Method (CGM) in a direct manner [3].
For the biharmonic equation semi-analytical discretization procedures, of the Trefftz–Jirousek type [6], have been developed by several authors [7], [8], [9] and a review of such methods can be found in [10]. As for non-analytical discretization methods, a recent paper by Lou et al. [11] presents a discussion, and a brief comparison, of several discretization methods that are available to deal with the biharmonic equation. According to them, some of the existing finite difference methods are very efficient and one due to Bjorstad is of optimal complexity. The order of accuracy of such methods is only second order. However, a fourth order collocation algorithm was introduced in [11].
When approaching the discretization of the biharmonic equation with non-analytical procedures, there are mainly two options. The first one consists in using a 13-point stencil [12], [13] and in the second one, the ‘splitting approach’ [13], the biharmonic equation is rewritten as a system of two equations whose treatment requires solving two Poisson equations successively. When this latter procedure is applied, the effectiveness of the method and of its parallel computation depends essentially on those of the Poisson equations. The most popular collocation formulation for partial differential equations of second order, which the majority of the authors working in this field have used up to now, is OSC; i.e. the Hermite bi-cubic orthogonal spline collocation [14]. The OSC formulation is applied in a trial-space of functions which are globally C1; this produces a global matrix, which in its usual form is neither symmetric nor positive definite, even when the differential operator has these properties.
In this paper, we tackle the biharmonic equation using the splitting approach and solve each one of the Poisson equations by means of TH-collocation, profiting from the advantageous features of the TH-collocation treatment of Poisson equation. Thus far, the order of accuracy of our algorithms has been only derived experimentally, as was done in [5] and in Section 7. However, an interesting characteristic of our method is that it actually produces the same solutions as those obtained by Lou et al. [11]. Using this fact, a rigorous theoretical proof of the fourth order accuracy of our algorithm can be constructed. However, such discussions will be presented elsewhere.
Section snippets
Notations
In our formulation the notations Ω⊂Rn and ∂Ω are used for a domain of the Euclidean space of dimension n and its boundary, respectively. Throughout this paper n is taken to be equal to 2. Let Π≡{Ω1,…,ΩE} be a partition of Ω. Given such a partition, the boundaries of the subdomains are ∂Ωi, i=1,…,E. Clearly, and the ‘internal boundary’, , is defined to be the closed complement of ∂Ω relative to . Then, ∂Ω will be referred as ‘external boundary’. In the external boundary, the
Splitting formulation of the biharmonic equation
The formulation of well-posed problems in function spaces containing discontinuous functions require that some jump of the functions and their derivatives, across the internal boundary, be prescribed. A well-posed boundary value problem with prescribed jumps (BVPJ) for the biharmonic equation is considered in what follows. It is defined by the differential equationthe boundary conditionsand by the jump conditions:
When
Solution of Poisson equation
TH-collocation, as presented in [5], will be here applied to each one of the Poisson's problems of Eq. (9). To this end, the results presented in [5] are specialized for the following boundary value problem with prescribed jumpstogether with:
Our interest will focus in the case when and .
In Herrera's indirect approach, in which TH-collocation is based, a special class of test functions is used; they are taken from a linear
TH-discretization
When TH-collocation is applied for solving Poisson equation, the construction of the global system of equations is based on Eq. (19) but the linear subspace N⊂D of special test functions is replaced by a TH-complete system (see [5]). TH-complete systems are infinite for problems in more than one independent variable and, in numerical applications of TH-collocation, it is necessary to approximate TH-complete systems by finite families, whose members belong to N⊂D. This, of course, implies a
The test functions
As mentioned before, the test functions, w∈N, are uniquely determined by their traces on . In a manner similar to what was done in [5], in the applications to Poisson equation that are considered in this paper, the linear subspace of test functions, , is such that the traces on of its members are continuous piecewise polynomials of a fixed degree G. Two algorithms will be constructed. For Algorithm 1, G=1, and for Algorithm 2, G=3. In addition, for Algorithm 2, the traces are required to
The numerical experiments
Two sets of numerical experiments were carried out. The first one consisted in applying Algorithm 1 of Section 6, for solving the Poisson's equations that occur when the splitting method, of Section 3, is used to treat several examples of the BVPJ of Eqs. (10), (11). Exactly the same was done in the second set of numerical experiments but Algorithm 2 was used instead of Algorithm 1. The analytical solutions of each of these examples are given in Table 1. In all cases the domain of definition is
Conclusions
The new method of collocation introduced in [4], [5], TH-collocation, has been applied to the biharmonic equation subjected to one class of boundary conditions, using the splitting approach [13]. Two algorithms were developed in this manner that enjoy two general properties of discretization procedures, which are derived by means of Herrera's approach to domain decomposition; namely, the global matrices are symmetric and positive definite, when the original differential operators have these
References (16)
- et al.
A powerful finite element for plate bending
Comp Meth Appl Mech Eng
(1977) A unified theory of domain decomposition methods
(2002)- Trefftz E. Ein gegenstück zum ritzschen verfahren. In: Proceedings of the second international congress of applied...
- et al.
A general effective method for combining collocation and DDM: an application of discontinuous Galerkin methods
Numer Meth Part D E
(2005) - et al.
Indirect methods of collocation: Trefftz–Herrera collocation
Numer Meth Part D E
(1999) - et al.
General theory of domain decomposition: indirect methods
Numer Meth Part D E
(2002) On Jirousek method and its generalizations
Comput Assist Mech Eng Sci
(2001)- et al.
Trefftz method for Kirchhoff plate bending problems
Int J Numer Meth Eng
(1993)
Cited by (5)
A multiple-scale Trefftz method for an incomplete Cauchy problem of biharmonic equation
2013, Engineering Analysis with Boundary ElementsCitation Excerpt :Christodoulou et al. [9] analyzed the singular function boundary integral method for a biharmonic problem with one boundary singularity. The technique of collocation of the Trefftz method (TM) was improved by Jin et al. [10], Jin and Cheung [11], Herrera and Diaz [12], Herrera et al. [13], Diaz and Herrera [14], and Herrera et al. [15]. Chen et al. [16] have derived an equivalent relationship between the TM and the MFS when applying them to the biharmonic equation.
Collocation methods: More efficient procedures for applying collocation
2007, Advances in Engineering SoftwareCitation Excerpt :Nevertheless, the results of the present paper indicate that single-point-collocation methods do not offer any real advantages over standard FEM, as can be seen in Figs. 4 and 5. In previous papers the TH-collocation method was introduced and it was shown to possess clear advantages over the standard orthogonal collocation (OSC) [5–8]. This paper has been devoted to further develop and analyze such methodology; its conclusions can be summarized as follows:
A highly accurate MCTM for direct and inverse problems of biharmonic equation in arbitrary plane domains
2008, CMES - Computer Modeling in Engineering and SciencesTrefftz-herrera collocation method: Numerical modeling of combustion fronts in porous media
2008, Numerical Modeling of Coupled Phenomena in Science and Engineering: Practical Use and ExamplesMathematical and computational modeling in Mexico
2008, Numerical Modeling of Coupled Phenomena in Science and Engineering: Practical Use and Examples
- 1
Present address: Mexican Petroleum Institute (IMP).