Parallel Solution of Linear Systems with Striped Sparse Matrices. Part 2. Stiffness Matrices, A Case Study.

Abstract

The stripe structures of stiffness matrices resulting from irregular domains covered by regular grids; are analysed. It is proved that the non-zero elements in these matrices may be covered by very few stripes, and that these stripes may be non-overlapping, if the nodes of the grids are numbered appropriately. The exact number of stripes, which is independent of the size of the problem, is derived for different types of grids, and different numbering schemes. The stripe structure of some irregular grids are also examined. Keywords: Parallel processing; partial differential equations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1986
Accession Number
ADA166047

Entities

People

  • Rami Melhem

Organizations

  • University of Pittsburgh

Tags

DTIC Thesaurus Topics

  • Case Studies
  • Computations
  • Computer Science
  • Data Transmission
  • Differential Equations
  • Equations
  • Floating Point Operations
  • Linear Systems
  • Mathematics
  • Parallel Computing
  • Parallel Processing
  • Partial Differential Equations
  • Sparse Matrix
  • Statistics
  • Stiffness
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.
  • Neurological Diseases/Conditions/Disorders