Domain Decomposition for Adaptive hp Finite Element Methods
暂无分享,去创建一个
A highly parallelizable domain decomposition solution technique for adaptive hp finite element methods is developed. The technique uses good partitioning strategies and a subspace decomposition based preconditioned itera- tive solver, Two level orthogonalization is used to obtain a reduced system which is preconditioned by a coarse grid operator. Numerical results show fast cOIl\'er- gence for the iterative solver and good control of the condition number (less than 16 for meshes with spectral orders up to 8).
[1] J. Pasciak,et al. The Construction of Preconditioners for Elliptic Problems by Substructuring. , 2010 .
[2] Leszek Demkowicz,et al. Toward a universal h-p adaptive finite element strategy , 1989 .
[3] I. Babuska,et al. Efficient preconditioning for the p -version finite element method in two dimensions , 1991 .
[4] F. K. Bechtel,et al. Mapping Multidimensional Space to One Dimension for Computer Output Display , 1968, IEEE Transactions on Computers.