Premium
Computing with sparse matrices
Author(s) -
Chow T. S.,
Kowalik J. S.
Publication year - 1973
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620070210
Subject(s) - sparse matrix , sorting , matrix (chemical analysis) , computation , computer science , algorithm , matrix free methods , sparse approximation , computational science , theoretical computer science , mathematics , algebra over a field , pure mathematics , physics , materials science , quantum mechanics , composite material , gaussian
A survey of recent developments in sparse matrix technology is presented. Two fundamental areas are reviewed: 1. Sorting and reordering techniques by which the non‐zero elements of a given sparse matrix can be rearranged to obtain a form which leads to more efficient computations. 2. Direct methods for solving systems of linear equations and computing inverses.