The Computational Complexity of Elliptic Partial Differential Equations,

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)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1972
Accession Number
AD0739730

Entities

People

  • Martin H. Schultz

Organizations

  • Yale University

Tags

DTIC Thesaurus Topics

  • Computational Complexity
  • Computations
  • Computers
  • Differential Equations
  • Equations
  • Mathematical Analysis
  • Partial Differential Equations

Fields of Study

  • Mathematics

Readers

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