scientific article; zbMATH DE number 1062852
From MaRDI portal
Publication:4355305
DOI<3999::AID-NME35>3.0.CO;2-V 10.1002/(SICI)1097-0207(19961215)39:23<3999::AID-NME35>3.0.CO;2-VzbMath0884.73078MaRDI QIDQ4355305
No author found.
Publication date: 14 April 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods for sparse matrices (65F50) Finite element methods applied to problems in solid mechanics (74S05)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Automatic element reordering for finite element analysis with frontal solution schemes
- An algorithm for profile and wavefront reduction of sparse matrices
- The versatility of automatic mesh generators based on tree structures and advanced geometric constructs
- Sparse matrix test problems
- An Implementation of a Pseudoperipheral Node Finder
- Automatic reduction of frontwidth for finite element analysis
- A connectivity coordinate system for node and element ordering
- A parallel frontal solver on the alliant FX/80
- Frontal solution program for unsymmetric matrices
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- An Efficient Heuristic Procedure for Partitioning Graphs
- Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
- The design of a new frontal code for solving sparse, unsymmetric systems
- A set of level 3 basic linear algebra subprograms
- A two‐step approach to finite element ordering
- The use of profile reduction algorithms with a frontal code
- A frontal solution program for finite element analysis
- An algorithm for frontwidth reduction
