Premium
Solution techniques for the p ‐version of the adaptive finite element method
Author(s) -
Papadrakakis Manolis,
Babilis George P.
Publication year - 1994
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620370809
Subject(s) - schur complement , conjugate gradient method , finite element method , domain decomposition methods , stiffness matrix , lu decomposition , mathematics , sparse matrix , matrix (chemical analysis) , mixed finite element method , factorization , extended finite element method , preconditioner , matrix decomposition , algorithm , computer science , iterative method , structural engineering , engineering , eigenvalues and eigenvectors , physics , materials science , quantum mechanics , composite material , gaussian
This paper investigates the performance of a class of methods based on the Preconditioned Conjugate Gradient (PCG) method for the solution of large and sparse systems of linear equations which arise from the p ‐version of the adaptive finite element method. The hierarchical type of preconditioning used in the past is extended to the SSOR and incomplete factorization type preconditioning and applied with a global handling of the stiffness matrix. The paper also presents some new ideas on Domain Decomposition (DD) matrix‐handling techniques, whereby the explicit formulation of the resulting Schur complement is avoided by utilizing the PCG method with efficient preconditioners and by processing separately on the coarse and the fine mesh. The suitability of the methods to the p ‐version of the adaptive finite element method is demonstrated through extensive numerical tests in two dimensions.