Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems.

Abstract

The present paper deals with the problem of computing a few of the eigenvalues with largest (or smallest) real parts, of a large sparse nonsymmetric matrix. We present a general acceleration technique based on Chebyshev polynomials and discuss its practical application to Arnoldi's method and the subspace iteration method. The resulting algorithms are compared with the classical ones in a few experiments which exhibit a sharp superiority of the Arnoldi-Chebyshev approach.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1982
Accession Number
ADA128062

Entities

People

  • Youcef Saad

Organizations

  • Yale University

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Chebyshev Polynomials
  • Civil Engineering
  • Computational Fluid Dynamics
  • Computational Science
  • Computations
  • Computers
  • Eigenvalues
  • Eigenvectors
  • Equations
  • Fluid Mechanics
  • Linear Algebra
  • Linear Systems
  • Markov Chains
  • New York
  • Polynomials
  • Probability

Readers

  • Linear Algebra
  • Systems Analysis and Design