On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand-Sides.

Abstract

This paper analyses two methods based on the Lanczos algorithm for solving large sparse symmetric linear systems with several right hand sides. The methods examined are suitable for the case where the right sides are not too different from one another as is often the case in time dependent or parameter dependent problems. We will show in particular that a modified Lanczos algorithm, introduced by Parlett is in some sense equivalent to the block Lanczos algorithm. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 13, 1985
Accession Number
ADA156816

Entities

People

  • Y. Saad

Organizations

  • Yale University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Accuracy
  • Air Force
  • Algorithms
  • Computer Science
  • Computers
  • Convergence
  • Eigenvalues
  • Errors
  • Galerkin Method
  • Linear Systems
  • Military Research
  • Orthogonality
  • Polynomials
  • Residuals
  • Sequences
  • Square Roots

Fields of Study

  • Mathematics

Readers

  • Linear Algebra