The Computational Complexity of Elliptic Partial Differential Equations

  • Martin H. Schultz
Part of the The IBM Research Symposia Series book series (IRSS)


In this paper, we consider 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, we present and analyze a new asymptotically optimal procedure for this problem. Moreover, we will show that a preconditioned form of our procedure is well-conditioned.


Basis Function Arithmetic Operation Mesh Point Elliptic Partial Differential Equation Finite Element Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Press, New York 1972

Authors and Affiliations

  • Martin H. Schultz
    • 1
  1. 1.Department of Computer ScienceYale UniversityUSA

Personalised recommendations