Computing entries of the inverse of a sparse matrix using the FIND algorithm (Q955257): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57369279, #quickstatements; #temporary_batch_1706974296281 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing entries of the inverse of a sparse matrix using the FIND algorithm |
scientific article |
Statements
Computing entries of the inverse of a sparse matrix using the FIND algorithm (English)
0 references
19 November 2008
0 references
nested dissection
0 references
Green's function
0 references
NEGF
0 references
nanotransistor
0 references
Gaussian elimination
0 references
sparse matrix
0 references
semiconductor field-effect transistor
0 references
