A sparse matrix scheme for finite elements (Q1205237): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0168-874x(92)90028-b / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039511316 / rank | |||
Normal rank | |||
Latest revision as of 11:05, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sparse matrix scheme for finite elements |
scientific article |
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
