The Rate of Convergence of a Class of Block Jacobi Schemes.

Abstract

The solution of many elliptic and parabolic partial differential equations lead to the need to solve large linear systems. With the usual serial computer architecture point iterative schemes frequently led to the efficient solution of many of these systems. In a point iterative scheme the current estimate of the solution is improved in a repetitive fashion by modifying only one component of the solution. The advent of vector and parallel computer architectures now allow the efficient solution of these systems by using block iterative schemes. In a block iterative scheme the current estimate of the solution is improved in a repetitive fashion by modifying several components of the solution. Since point iterative schemes can be viewed as particularly simple block iterative schemes one would expect to find that block iterative schemes can potentially converge faster than point iterative schemes. In this paper the rate of convergence of one class of block iterative schemes is precisely determined.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1984
Accession Number
ADA144738

Entities

People

  • W. E. Ferguson Jr

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Chebyshev Polynomials
  • Computer Architecture
  • Contracts
  • Convergence
  • Differential Equations
  • Eigenvalues
  • Equations
  • Formulas (Mathematics)
  • Geometry
  • Intervals
  • Linear Systems
  • Mathematics
  • Partial Differential Equations
  • Polynomials
  • United States
  • Wisconsin

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Calculus or Mathematical Analysis
  • Database Systems and Applications