Memory-economic finite element and node renumbering
Main Author: | Auda, Hesham A. |
---|---|
Format: | Others |
Language: | en |
Published: |
McGill University
1981
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=57223 |
Similar Items
-
The cascade decomposition of finite-memory synchronous sequential machines.
by: Bakerdjian, Vartan George.
Published: (1971) -
High-performance direct solution of finite element problems on multi-core processors
by: Guney, Murat Efe
Published: (2010) -
Excessive Memory Usage of the ELLPACK Sparse Matrix Storage Scheme throughout the Finite Element Computations
by: G. Akinci, et al.
Published: (2014-12-01) -
Hardcoding finite automata
by: Ngassam, Ernest Ketcha
Published: (2013) -
Tiebreaking the minimum degree algorithm for ordering sparse symmetric positive definite matrices
by: Cavers, Ian Alfred
Published: (2010)