Construction of Sparse Matrices for Finite Elements with TBB Containers and OpenMP

Igor Gribanov

Rate me:

5.00/5 (6 votes)

6 Oct 2021CPOL9 min read

6.2K

An efficient algorithm for assembling sparse matrices in Compressed Sparse Row (CSR) format.

In the Finite Element Analysis, sparse matrices have a particular form - the diagonals are non-zero, and each row has a predictable upper bound on non-zero entries. Research codes often don't care about efficiency, but for large geometries the performance impact is measurable.

Views

Daily Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

Igor Gribanov

Engineer

Canada

I am a researcher working on numerical models for deformation, crushing and flow of ice. The models are based on continuum mechanics, where numerical approaches include particle-based methods and finite elements.

Construction of Sparse Matrices for Finite Elements with TBB Containers and OpenMP

Views

License

Comments and Discussions