Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


What is the complexity of related elliptic, parabolic, and hyperbolic problems?

Author: Arthur G. Werschulz
Journal: Math. Comp. 47 (1986), 461-472
MSC: Primary 65P05; Secondary 68Q15
MathSciNet review: 856697
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Traub and Woźniakowski have dealt with the complexity of some simple partial differential equations. They chose three model problems and showed that the parabolic problem considered had significantly lower complexity than the elliptic problem, which in turn had significantly lower complexity than the hyperbolic problem considered. They asked whether this is true in general. We show that this is not the case by proving that if L is a reasonably well-behaved elliptic operator, then the steady-state heat equation $ Lu = f$, the heat equation $ {\partial _t}u + Lu = f$, and the wave equation $ {\partial _{tt}}u + Lu = f$ all have roughly the same worst-case complexity for f in the unit ball of a certain Sobolev space of smoothness r.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65P05, 68Q15

Retrieve articles in all journals with MSC: 65P05, 68Q15

Additional Information

PII: S 0025-5718(1986)0856697-6
Keywords: Optimal solution of partial differential equations, elliptic problems, parabolic problems, hyperbolic problems, computational complexity, information-based complexity, optimal algorithms
Article copyright: © Copyright 1986 American Mathematical Society