|
hp-FEM is a general version of the finite element method (FEM), a numerical method for solving partial differential equations based on piecewise-polynomial approximations that employs elements of variable size ''(h)'' and polynomial degree ''(p)''. The origins of hp-FEM date back to the pioneering work of Ivo Babuska et al. 〔I. Babuska, B.Q. Guo: The h, p and h-p version of the finite element method: basis theory and applications, Advances in Engineering Software, Volume 15, Issue 3-4, 1992.〕 who discovered that the finite element method converges ''exponentially fast'' when the mesh is refined using a suitable combination of h-refinements (dividing elements into smaller ones) and p-refinements (increasing their polynomial degree). The exponential convergence makes the method a very attractive choice compared to most other finite element methods which only converge with an algebraic rate. The exponential convergence of the hp-FEM was not only predicted theoretically but also observed by numerous independent researchers.〔J.M. Melenk: hp-Finite Element Methods for Singular Perturbations, Springer, 2002〕 〔C. Schwab: p- and hp- Finite Element Methods: Theory and Applications in Solid and Fluid Mechanics, Oxford University Press, 1998〕 〔P. Solin: Partial Differential Equations and the Finite Element Method, J. Wiley & Sons, 2005〕 ==Differences from standard FEM== The hp-FEM differs from the standard (lowest-order) FEM in many aspects.〔P. Solin, K. Segeth, I. Dolezel: Higher-Order Finite Element Methods, Chapman & Hall/CRC Press, 2003〕 * Choice of higher-order shape functions: To begin with, the higher-degree polynomials in elements can be generated using different sets of shape functions. The choice of such set can influence dramatically the conditioning of the stiffness matrix, and in turn the entire solution process. This problem was first documented by Babuska et al.〔I. Babuska, M. Griebel and J. Pitkaranta, The problem of selecting the shape functions for a p-type finite element, Internat. J. Numer. Methods Engrg. (1989), pp. 1891-1908〕 * Automatic hp-adaptivity: In the hp-FEM, an element can be hp-refined in many different ways. One way is to just increase its polynomial degree without subdividing it in space. Or, the element can be subdivided geometrically, and various polynomial degrees can be applied to the subelements. The number of element refinement candidates easily reaches 100 in 2D and 1000 in 3D. Therefore, clearly, one number indicating the size of error in an element is not enough to guide automatic hp-adaptivity (as opposed to adaptivity in standard FEM). Other techniques such as ''reference solutions'' or ''analyticity considerations'' must be employed to obtain more information about the ''shape of error'' in every element.〔L. Demkowicz, W. Rachowicz, and Ph. Devloo: A Fully Automatic hp-Adaptivity, Journal of Scientific Computing, 17, Nos 1-3 (2002), 127-155〕 * Ratio of assembling and solution CPU times: In standard FEM, the stiffness matrix usually is assembled quickly but it is quite large. Therefore, typically, the solution of the discrete problem consumes the largest part of the overall computing time. On the contrary, the stiffness matrices in the hp-FEM typically are much smaller, but (for the same matrix size) their assembly takes more time than in standard FEM. Mostly, this is due to the computational cost of higher-order numerical quadrature. * Analytical challenges: The hp-FEM is more difficult to understand from the analytical point of view than standard FEM. This concerns numerous techniques, such as the discrete maximum principles (DMP) for elliptic problems. These results state that, usually with some limiting assumptions on the mesh, the piecewise-polynomial FEM approximation obeys analogous maximum principles as the underlying elliptic PDE. Such results are very important since they guarantee that the approximation remain physically admissible, leaving no possibility of computing a negative density, negative concentration, or negative absolute temperature. The DMP are quite well understood for lowest-order FEM but completely unknown for the hp-FEM in two or more dimensions. First DMP in one spatial dimension were formulated recently.〔P. Solin, T. Vejchodsky: A Weak Discrete Maximum Principle for hp-FEM, J. Comput. Appl. Math. 209 (2007) 54-65〕〔T. Vejchodsky, P. Solin: Discrete Maximum Principle for Higher-Order Finite Elements in 1D, Math. Comput. 76 (2007), 1833 - 1846〕 * Programming challenges: It is much harder to implement a hp-FEM solver than standard FEM code. The multiple issues that need to be overcome include (but are not limited to): higher-order quadrature formulas, higher-order shape functions, connectivity and orientation information relating shape functions on the reference domain with basis functions in the physical domain, etc.〔L. Demkowicz, J. Kurtz, D. Pardo, W. Rachowicz, M. Paszynski, A. Zdunek: Computing with hp-Adaptive Finite Elements, Chapman & Hall/CRC Press, 2007〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hp-FEM」の詳細全文を読む スポンサード リンク
|