A block sparse shared-memory multifrontal finite element solver for problems of structural mechanics

  • S. Y. Fialko Institute of Computer Modeling, Cracow University of Technology, Cracow

Abstract

The presented method is used in finite-element analysis software developed for multicore and multiprocessor shared-memory computers, or it can be used on single-processor personal computers under the operating systems Windows 2000, Windows XP, or Windows Vista, widely popular in small or mediumsized design offices. The method has the following peculiar features: it works with any ordering; it uses an object-oriented approach on which a dynamic, highly memory-efficient algorithm is based; it performs a block factoring in the frontal matrix that entails a high-performance arithmetic on each processor and ensures a good scalability in shared-memory systems. Many years of experience with this solver in the SCAD software system have shown the method's high efficiency and reliability with various large-scale problems of structural mechanics (hundreds of thousands to millions of equations).

Keywords

finite element method, large-scale problems, multifrontal method, sparse matrices, ordering, multithreading,

References

[1] C. Ashcraft, J.W.-H. Liu. Robust Ordering of Sparse Matrices Using Multisection. Technical Report CS 96-01. Department of Computer Science, York University, Ontario, Canada, 1996.
[2] J.W. Demmel. Applied Numerical Linear Algebra. SIAM, Philadellphia, 1997.
[3] F. Dobrian, A. Pothen. Oblio: a sparse direct solver library for serial and parallel computations. Technical Report describing the OBLIO software library. 2000.
[4] I.S. Duff, J.K. Reid. The multifrontal solution of indefinite sparse symmetric linear systems.
ACM Transactions on Mathematical Software, 9: 302–325, 1983.
[5] I.S. Duff, J.K. Reid, J.A. Scott. The use of profile reduction algorithms with a frontal code. International Journal for Numerical Methods in Engineering, 28: 2555–2568, 1989.
[6] S.Yu. Fialko. A block sparse direct multifrontal solver in SCAD software. Proceedings of the CMM-2005 –Computer Methods in Mechanics, June 21-24, 2005, Częstochowa, Poland, pp.73–74, 2005.
[7] S.Yu. Fialko. Stress-Strain Analysis of Thin-Walled Shells with Massive Ribs. Int. App. Mech., 40(4): 432–439, 2004.
[8] A. George A., J.W.-H. Liu. Computer solution of sparse positive definite systems. Prentice-Hall, New Jersey, Inc. Englewood Cliffs, 1981.
[9] A. George A., J.W.-H. Liu. The Evolution of the Minimum Degree Ordering Algorithm. SIAM Rev., 31(March):1–19, 1989.
[10] N.I.M. Gould, Y. Hu, J.A. Scott. A numerical evaluation of sparse direct solvers for the solution of large sparse, symmetric linear systems of equations. Technical report RAL-TR-2005-005. Rutherford Appleton Laboratory, 2005.
[11] B.M. Irons. A frontal solution program for finite-element analysis. International Journal for Numerical Methodsin Engineering, 2: 5–32, 1970.
[12] G. Karypis, V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. Technical Report TR 95-035. Department of Computer Science, University of Minnesota, Minneapolis, 1995.
[13] J.A. Scott. A frontal solver for the 21st century. Communications in Numerical Methods in Engineering, 22: 1015–1029, 2006.
[14] S.W. Sloan. An algorithm for profile and wavefront reduction of sparse matrices. International Journal for Numerical Methods in Engineering, 23: 1315–1324, 1986.
Published
Jan 25, 2017
How to Cite
FIALKO, S. Y.. A block sparse shared-memory multifrontal finite element solver for problems of structural mechanics. Computer Assisted Methods in Engineering and Science, [S.l.], v. 16, n. 2, p. 117-131, jan. 2017. ISSN 2956-5839. Available at: <https://cames-old.ippt.pan.pl/index.php/cames/article/view/156>. Date accessed: 25 apr. 2025.
Section
Articles