A Parallel FEA Computing Kernel for Building Structures


With the rapid development of high-rise buildings and long-span structures in the recent years, high performance com- putation (HPC) is becoming more and more important, sometimes even crucial, for the design and construction of com- plex building structures. To satisfy the engineering requirements of HPC, a parallel FEA computing kernel, which is designed typically for the analysis of complex building structures, will be presented and illustrated in this paper. This kernel program is based on the Intel Math Kernel Library (MKL) and coded by FORTRAN 2008 syntax, which is a parallel computer language. To improve the capability and efficiency of the computing kernel program, the parallel concepts of modern FORTRAN, such as elemental procedure, do concurrent, etc., have been applied extensively in coding and the famous PARDISO solver in MKL has been called to solve the Large-sparse system of linear equations. The ultimate objective of developing the computing kernel is to make the personal computer have the ability to analysis large building structures up to ten million degree of freedoms (DOFs). Up to now, the linear static analysis and dynamic analysis have been achieved while the nonlinear analysis, including geometric and material nonlinearity, has not been finished yet. Therefore, the numerical examples in this paper will be concentrated on demonstrating the validity and efficiency of the linear analysis and modal analysis for large FE models, while ignoring the verification of the nonlinear analysis capabilities.

Share and Cite:

Duan, J. , Li, Y. , Chen, X. , Qi, H. and Sun, J. (2013) A Parallel FEA Computing Kernel for Building Structures. Journal of Applied Mathematics and Physics, 1, 26-30. doi: 10.4236/jamp.2013.16006.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] ISO/IEC, “F2008 Working Document,” 2008.
[2] S. Norman, “Clermanand Walter Spector. Modern Fortran Style and Usage,” Cambridge University Press, Cambridge, 2012.
[3] O. Schenk, K. Gartner and W. Fichtner, “Efficient Sparse LU Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors,” BIT Numerical Mathematics, Vol. 40, No. 1, 2000, pp. 158-176. http://dx.doi.org/10.1023/A:1022326604210
[4] O. Schenk and K. Gartner, “On Fast Factorization Pivoting Methods for Symmetric Indefinite Systems,” Electronic Transactions on Numerical Analysis, Vol. 23, 2006, pp. 158-179.
[5] N. I. M. Gould, Y. Hu and J. A. Scott, “A Numerical Evaluation of Sparse Direct Solvers for the Solution of Large Sparse, Symmetric Linear Systems of Equations,” ACM Transactions on Mathematical Software, Vol. 33, No. 2, 2007, Article No. 10.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.