Accession Number:

ADA009954

Title:

Marching Algorithms for Elliptic Boundary Value Problems. I. The Constant Coefficient Case.

Descriptive Note:

Technical rept. Sep 74-Apr 74,

Corporate Author:

HARVARD UNIV CAMBRIDGE MASS AIKEN COMPUTATION LAB

Personal Author(s):

Report Date:

1975-04-01

Pagination or Media Count:

129.0

Abstract:

Several new fast direct methods for solving constant coefficient elliptic boundary value problems are presented. The methods make extensive use of the algebraic properties of the modified Chebyshev polynomials S sub nx and C sub nx, which allow us to obtain operation counts of On squared or On squared logbase 2 for solving problems on an nXn grid. The algorithms are shown to be numerically stable by giving a Wilkinson-style error analysis. Previously studied fast direct methods, and shooting and multiple shooting techniques are related to the algorithms.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE