Abstract P-version finite element method for the second order elliptic equation in an arbitrary sufficiently smooth domain is studied in the frame of DD method. Two types square reference elements are used with the products of the integrated Legendre's polynomials for the coordinate functions. There are considered the estimates for the condition numbers, preconditioning of the problems arising on subdomains and the Schur complement, the derivation of the DD preconditioner. For the result we obtain the DD preconditioner to which corresponds the generalized condition number of order (logp )2 . The paper consists of two parts. In part I there are given some preliminary re- sults for 1D case, condition number estimates and some inequalities for 2D reference element.

P-version finite element method for the second order elliptic equation in an arbitrary sufficiently smooth domain is studied in the frame of DD method. Two types square reference elements are used with the products of the integrated Legendre's polynomials for the coordinate functions. There are considered the estimates for the condition numbers, preconditioning of the problems arising on subdomains and the Schur complement, the derivation of the DD preconditioner. For the result we obtain the DD preconditioner to which corresponds the generalized condition number of order (logp )2 . The paper consists of two parts. In part I there are given some preliminary results for 1D case, condition number estimates and some inequalities for 2D reference element. Part II is devoted to the derivation of the Schur complement preconditioner and conditionality number estimates for the p-version finite element matrixes. Also DD preconditioning is considered.

The realization of the finite element method on parallel computers is usually based on a domain decomposition approach. This paper is concerned with the problem of finding an optimal decomposition and an appropriate mapping of the subdomains to the processors. The quality of this partitioning is measured in several metrics but it is also expressed in the computing time for solving specific systems of finite element equations. The software environment is first described. In particular, the data structure and the accumulation algorithm are introduced. Then several partitioning algorithms are compared. Spectral bisection was used with different modifications including Kernighan-Lin refinement, post-processing techniques and terminal propagation. The final recommendations should give good decompositions for all finite element codes which are based on principles similar to ours. The paper is a shortened English version of Preprint SFB393/96-18 (Uwe Reichel: Partitionierung von Finite-Elemente-Netzen), SFB 393, TU Chemnitz-Zwickau, December 1996. To be selfcontained, some material of Preprint SPC95_5 (see below) is included. The paper appeared as Preprint SFB393/96-18a, SFB 393, TU Chemnitz-Zwickau, January 1997.

Der Standard des Message Passing Interfaces (MPI) stellt dem Entwickler paralleler Anwendungen ein mächtiges Werkzeug zur Verfügung, seine Softwa- re effizient und weitgehend unabhängig von Details des parallelen Systems zu entwerfen. Im Rahmen einer Projektarbeit erfolgte die Umstellung der Kommunikationsbibliothek eines bestehenden FEM-Programmes auf den MPI-Mechanismus. Die Ergebnisse werden in der hier gegebenen Beschreibung der Cubecom-Implementierung zusammengefasst. In einem zweiten Teil dieser Arbeit wird untersucht, auf welchem Wege mit der in MPI verfügbaren Funktionalität auch die Koppelrandkommunikation mit einem einheitlichen und effizienten Verfahren durchgeführt werden kann. Sowohl fuer die Basisimplementierung als auch die MPI-basierte Koppelrandkommunikation wird die Effizienz untersucht und ein Ausblick auf weitere Anwendungsmoeglichkeiten gegeben.

The paper is concerned with the finite element resolution of layers appearing in singularly perturbed problems. A special anisotropic grid of Shishkin type is constructed for reaction diffusion problems. Estimates of the finite element error in the energy norm are derived for two methods, namely the standard Galerkin method and a stabilized Galerkin method. The estimates are uniformly valid with respect to the (small) diffusion parameter. One ingredient is a pointwise description of derivatives of the continuous solution. A numerical example supports the result. Another key ingredient for the error analysis is a refined estimate for (higher) derivatives of the interpolation error. The assumptions on admissible anisotropic finite elements are formulated in terms of geometrical conditions for triangles and tetrahedra. The application of these estimates is not restricted to the special problem considered in this paper.

From the viewpoint of the adaptive solution of partial differential equations a finit e element method on hierarchical triangular meshes is developed permitting hanging nodes arising from nonuniform hierarchical refinement. Construction, extension and restriction of the nonuniform hierarchical basis and the accompanying mesh are described by graphs. The corresponding FE basis is generated by hierarchical transformation. The characteristic feature of the generalizable concept is the combination of the conforming hierarchical basis for easily defining and changing the FE space with an accompanying nonconforming FE basis for the easy assembly of a FE equations system. For an elliptic model the conforming FEM problem is solved by an iterative method applied to this nonconforming FEM equations system and modified by projection into the subspace of conforming basis functions. The iterative method used is the Yserentant- or BPX-preconditioned conjugate gradient algorithm. On a MIMD computer system the parallelization by domain decomposition is easy and efficient to organize both for the generation and solution of the equations system and for the change of basis and mesh.

In this paper, several modifications of the quasi-interpolation operator of Scott and Zhang (Math. Comp. 54(1990)190, 483--493) are discussed. The modified operators are defined for non-smooth functions and are suited for the application on anisotropic meshes. The anisotropy of the elements is reflected in the local stability and approximation error estimates. As an application, an example is considered where anisotropic finite element meshes are appropriate, namely the Poisson problem in domains with edges.

The paper presents a method for generating curved surfaces of 3D finite element meshes by mesh refinement starting with a very coarse grid. This is useful for parallel implementations where the finest meshes should be computed and not read from large files. The paper deals with simple geometries as sphere, cylinder, cone. But the method may be extended to more complicated geometries. (with 45 figures)

For a class of two-dimensional boundary value problems including diffusion and elasticity problems it is proved that the constants in the corresponding strengthened Cauchy-Buniakowski-Schwarz (C.B.S.) inequality in the cases of h -hierarchical and p -hierarchical finite element discretizations with triangular meshes differ by the factor 0.75. For plane linear elasticity problems and triangulations with right isosceles tri- angles formulas are presented that show the dependence of the constant in the C.B.S. inequality on the Poisson's ratio. Furthermore, numerically determined bounds of the constant in the C.B.S. inequality are given for three-dimensional elasticity problems discretized by means of tetrahedral elements. Finally, the robustness of iterative solvers for elasticity problems is discussed briefly.

This paper is concerned with the anisotropic singular behaviour of the solution of elliptic boundary value problems near edges. The paper deals first with the description of the analytic properties of the solution in newly defined, anisotropically weighted Sobolev spaces. The finite element method with anisotropic, graded meshes and piecewise linear shape functions is then investigated for such problems; the schemes exhibit optimal convergence rates with decreasing mesh size. For the proof, new local interpolation error estimates in anisotropically weighted spaces are derived. Moreover, it is shown that the condition number of the stiffness matrix is not affected by the mesh grading. Finally, a numerical experiment is described, that shows a good agreement of the calculated approximation orders with the theoretically predicted ones.