A New Proof of Global Convergence for the Tridiagonal QL Algorithm.

Abstract

By exploiting the relation of the QL algorithm to inverse iteration we obtain a proof of global convergence which is more conceptual and less computational than previous analyses. The proof uses a new, but simple, error estimate for the first step of inverse iteration. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 07, 1977
Accession Number
ADA057997

Entities

People

  • Beresford N. Parlett
  • W. Hoffman

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Advanced Electronics
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • California
  • Computer Science
  • Computers
  • Contracts
  • Convergence
  • Eigenvalues
  • Electronics
  • Equations
  • Homogeneity
  • Iterations
  • Mathematics
  • Polynomials
  • Universities

Fields of Study

  • Mathematics

Readers

  • Aquatic Ecology
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)