Accession Number : AD0739730

Title :   The Computational Complexity of Elliptic Partial Differential Equations,

Corporate Author : YALE UNIV NEW HAVEN CONN DEPT OF COMPUTER SCIENCE

Personal Author(s) : Schultz,Martin H.

Report Date : MAR 1972

Pagination or Media Count : 12

Abstract : In the paper, the author considers the computational complexity of the class of all procedures for computing a second order accurate approximation (on a square grid) to the solution of a linear, second order elliptic partial differential equation in a square domain. In particular, the author presents and analyzes a new asymptotically optimal procedure for this problem. (Author)

Descriptors :   (*PARTIAL DIFFERENTIAL EQUATIONS, NUMERICAL INTEGRATION), (*COMPUTER PROGRAMMING, PARTIAL DIFFERENTIAL EQUATIONS), ASYMPTOTIC SERIES, POLYNOMIALS, OPTIMIZATION, APPROXIMATION(MATHEMATICS), THEOREMS

Subject Categories : Numerical Mathematics
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE