2006 | OriginalPaper | Chapter
Efficient Preconditioners for Special Situations in Finite Element Computations
Author : Arnd Meyer
Published in: Parallel Algorithms and Cluster Computing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
From the very efficient use of hierarchical techniques for the quick solution of finite element equations in case of linear elements, we discuss the generalization of these preconditioners to higher order elements and to the problem of crack growth, where the introduction to of the crack opening would destroy existing mesh hierarchies. In the first part of this paper, we deal with the higher order elements. Here, especially elements based on cubic polynomials require more complicate tasks such as the definition of ficticious spaces and the Ficticious Space Lemma. A numerical example demonstrates that iteration numbers similar to the linear case are obtained.