Yale Sparse Matrix Package. I. The Symmetric Codes

Abstract

Consider the NxN system of linear equations M x = b, where the coefficient matrix M is large, sparse, symmetric, and positive definite. Such systems arise frequently in scientific computation, e.g., in finite difference and finite element approximations to elliptic boundary value problems. This report presents a package of efficient, reliable, well-documented, and portable FORTRAN subroutines for solving these systems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1977
Accession Number
ADA047724

Entities

People

  • A. H. Sherman
  • M. C. Gursky
  • Martin H. Schultz
  • S. C. Eisenstat

Organizations

  • Yale University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Boundary Value Problems
  • Coefficients
  • Computations
  • Computer Science
  • Computers
  • Difference Equations
  • Electrical Engineering
  • Elimination
  • Engineering
  • Equations
  • Linear Systems
  • Lists (Data Structures)
  • Permutations
  • Procedures (Computers)
  • Real Variables
  • Sparse Matrix

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Systems Analysis and Design