Eigenvalue Methods for Sparse Matrices,

Abstract

The problem of computing eigenvalues of sparse unsymmetric matrices is examined using a modern compiler-interpreter implementation. Methods are discussed which would, for example, extract all the eigenvalues of a 40-th order matrix in approximately one second. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1971
Accession Number
AD0731300

Entities

People

  • Donald Albert Calahan
  • W. J. Mccalla

Organizations

  • University of Michigan

Tags

DTIC Thesaurus Topics

  • Algebra
  • Compilers
  • Computer Language Translators
  • Computer Programs
  • Differential Equations
  • Digital Information
  • Eigenvalues
  • Equations
  • Linear Algebra
  • Mathematical Analysis
  • Mathematics
  • Sparse Matrix

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Systems Analysis and Design