An Algorithm for Assembly of Stiffness Matrices into a Compacted Data Structure.

Abstract

A data structure is described that stores only the non-zero terms of the assembled stiffness matrix. This storage scheme results in considerable reduction in memory demand during the assembly phase of a finite element program. Therefore, larger matrices can be formed in the main memory of the computer. When secondary store must be used this approach reduces the I/O cost during the assembly stage. An algorithm is derived that starts with the element connectivity information and generates the compacted data structure. The elements matrices are then assembled to form the stiffness matrix with this storage scheme. The assembly algorithm is described and a FORTRAN listing of the routines are presented. The reduction in storage is demonstrated with the aid of numerical examples.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1984
Accession Number
ADA146727

Entities

People

  • B. Nour-omid
  • R. L. Taylor

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Assembly
  • Bandwidth
  • California
  • Civil Engineering
  • Computers
  • Data Transmission
  • Engineering
  • Equations
  • Finite Element Analysis
  • New York
  • Procedures (Computers)
  • Sparse Matrix
  • Stiffness
  • Structural Engineering
  • Structural Mechanics
  • Two Dimensional

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computer Science.
  • Structural Dynamics.