A sparse matrix scheme for finite elements (Q1205237)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 147053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sparse matrix scheme for finite elements |
scientific article; zbMATH DE number 147053 |
Statements
A sparse matrix scheme for finite elements (English)
0 references
1 April 1993
0 references
The authors propose an implementation of compact storage of the finite element matrix \(A\) arising from the discretization of problems which are described by a system of partial differential equations, so that some fixed number \(d>1\) of degrees of freedom correspond to each node. They show how to reduce approximately by \(d\) the storage required for indices of nonzero entries as compared with more conventional storage schemes and describe the implementation of matrix vector multiplication which may be exploited in iterative solvers.
0 references
compact storage
0 references
finite element matrix
0 references
system of partial differential equations
0 references
matrix vector multiplication
0 references
iterative solvers
0 references
sparse matrix storage
0 references
0.9291959
0 references
0.92664665
0 references
0.91315603
0 references
0.9131311
0 references
0.9118496
0 references
0 references
