Polynomial Iteration for Nonsymmetric Indefinite Linear Systems.

Abstract

We examine iterative methods for solving sparse nonsymmetric indefinite systems of linear equations. Methods considered include a adaptive model based on polynomials that satisfy an optimality condition in the Chebyshev norm, the conjugate gradient-like method GMRES, and the conjugate gradient method applied to the normal equations. Numerical experiments on several non-self-adjoint indefinite elliptic boundary value problems suggest that none of these methods is dramatically superior to the others. Their performance in solving moderately difficult problems is satisfactory, but for harder problems their convergence is slow.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1985
Accession Number
ADA153094

Entities

People

  • H. C. Elman
  • R. L. Streit

Organizations

  • Yale University

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computations
  • Differential Equations
  • Eigenvalues
  • Eigenvectors
  • Equations
  • Helmholtz Equations
  • Iterations
  • Linear Programming
  • Linear Systems
  • Numerical Analysis
  • Partial Differential Equations
  • Polynomials
  • Quadrants
  • Residuals
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Operations Research