Factoring Symmetric Indefinite Matrices on High-Performance Architectures

Abstract

The Bunch-Kaufman algorithm is the method of choice for factoring symmetric indefinite matrices in many applications. However, the Bunch-Kaufman algorithm does not take advantage of high-performance architectures such as the Cray Y-MP. Three new algorithms, based on Bunch-Kaufman factorization, that take advantage of such architectures are described. Results from an implementation of the third algorithm are presented. (KT)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1990
Accession Number
ADA218784

Entities

People

  • Mark T. Jones
  • Merrell L. Patrick

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Bandwidth
  • Computations
  • Computer Architecture
  • Computers
  • Computing System Architectures
  • Contractors
  • Engineering
  • Equations
  • Floating Point Operations
  • Iterations
  • Multithreading
  • Permutations
  • Segmented
  • Sparse Matrix
  • Structural Engineering
  • Triangles

Fields of Study

  • Computer science

Readers

  • Database Systems and Applications
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Linear Algebra