An Algorithm for Computing Reducing Subspaces by Block Diagonalization.

Abstract

This paper describes an algorithm for reducing a real matrix A to block diagonal form by a real similarity transformation. The columns of the transformation corresponding to a block span a reducing subspace of A, and the block is the representation of A in that subspace with respect to the basis. The algorithm attempts to control the condition of the transformation matrices, so that the reducing subspaces are well conditioned and the basis vectors are numerically independent. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1976
Accession Number
ADA032013

Entities

People

  • Connice A. Bavely
  • Gilbert W. Stewart

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Science
  • Convergence
  • Eigenvalues
  • Eigenvectors
  • Equations
  • Errors
  • Linear Systems
  • Maryland
  • Mathematics
  • Military Research
  • New Jersey
  • Polynomials
  • Procedures (Computers)
  • Real Variables
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Computer Programming and Software Development.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)