Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
How Generous is the ELLPACK Sparse Matrix Storage Scheme for Finite Element Computations
Date
2012-11-03
Author
Akinci, Gokay
YILMAZ, ASIM EGEMEN
Kuzuoğlu, Mustafa
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
0
views
0
downloads
Sparse matrices are occasionally encountered during solutions of various problems by means of numerical methods, such as the finite element method. ELLPACK sparse matrix storage scheme, one of the most widely used methods due to its implementation ease, is investigated in this study. The scheme uses excessive memory due to its definition. For the conventional finite element method, where the node elements are used, the excessive memory caused by redundant entries in the ELLPACK sparse matrix storage scheme becomes negligible for large scale problems. On the other hand, our analyses show that the redundancy is still considerable for the occasions where facet or edge elements have to be used.
Subject Keywords
Finite Element Method
,
Sparse Matrix
,
Edge Elements
,
Computational Electromagnetcis
,
ELLPACK
URI
https://hdl.handle.net/11511/55797
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar